<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: Dilation algorithms&#8212;Introduction</title>
	<link>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/</link>
	<description>Steve Eddins manages the Image &#38; Geospatial development team at &#60;a href="http://www.mathworks.com/"&#62;The MathWorks&#60;/a&#62; and coauthored &#60;a href="http://www.mathworks.com/support/books/book5291.html?category=-1&#38;language=-1"&#62;Digital Image Processing Using MATLAB&#60;/a&#62;. He writes here about image processing concepts, algorithm implementations, and MATLAB.&#60;br&#62;&#60;br&#62;&#60;img&#62;</description>
	<pubDate>Mon, 23 Nov 2009 00:49:55 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: software developer</title>
		<link>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-22222</link>
		<dc:creator>software developer</dc:creator>
		<pubDate>Fri, 16 Oct 2009 09:24:06 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-22222</guid>
		<description>Interesting,

this is a good article to help with algorithms...

keep up the good work

Thanks for writing about it</description>
		<content:encoded><![CDATA[<p>Interesting,</p>
<p>this is a good article to help with algorithms&#8230;</p>
<p>keep up the good work</p>
<p>Thanks for writing about it</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21030</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 04 Sep 2008 17:40:32 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21030</guid>
		<description>Cris&#8212;You're right, I should have caught the plot scaling issue.  I wasn't actually trying hide the point.  I updated the post to make it more clear.  Thanks.  Also, thanks for the TrIP pointer; I'll take a look.</description>
		<content:encoded><![CDATA[<p>Cris&mdash;You&#8217;re right, I should have caught the plot scaling issue.  I wasn&#8217;t actually trying hide the point.  I updated the post to make it more clear.  Thanks.  Also, thanks for the TrIP pointer; I&#8217;ll take a look.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Cris Luengo</title>
		<link>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21029</link>
		<dc:creator>Cris Luengo</dc:creator>
		<pubDate>Thu, 04 Sep 2008 15:04:15 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21029</guid>
		<description>Not to spoil your upcoming bog entry too much, but if you scale the first graph (times vs Q) by setting the lower ylim to 0, you'll see it is pretty close to a horizontal line. There's only a 10% difference from low to high.

However, isn't this supposed to be an O(1) algorithm? Where's the increase coming from? Actually, only yesterday I saw some paper with a timing plot, where operations with a linear SE actually had lower times for longer SE. That one seriously surprises to me! (Urbach and Wilkinson, IEEE TIP 17(1):1-8, fig 9)</description>
		<content:encoded><![CDATA[<p>Not to spoil your upcoming bog entry too much, but if you scale the first graph (times vs Q) by setting the lower ylim to 0, you&#8217;ll see it is pretty close to a horizontal line. There&#8217;s only a 10% difference from low to high.</p>
<p>However, isn&#8217;t this supposed to be an O(1) algorithm? Where&#8217;s the increase coming from? Actually, only yesterday I saw some paper with a timing plot, where operations with a linear SE actually had lower times for longer SE. That one seriously surprises to me! (Urbach and Wilkinson, IEEE TIP 17(1):1-8, fig 9)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21027</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 04 Sep 2008 01:58:37 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21027</guid>
		<description>Jim&#8212;Thanks for adding your comment showing how the syntax works for matrices.</description>
		<content:encoded><![CDATA[<p>Jim&mdash;Thanks for adding your comment showing how the syntax works for matrices.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jim</title>
		<link>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21026</link>
		<dc:creator>Jim</dc:creator>
		<pubDate>Wed, 03 Sep 2008 21:33:30 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21026</guid>
		<description>for i = A
...statements...
end;


Description:  
The ...statements... are executed (as MATLAB commands) for i equal sequentially to each column in A.  If A is 3D or greater, the ...statements... are executed for i equal sequentially to the vector of first index values for each combination of the other indices of A.


Example:
A = [1 2 3; 4 5 6];
for i = A
this_is_i = i
end;

Result:
this_is_i =

          1.00
          4.00


this_is_i =

          2.00
          5.00


this_is_i =

          3.00
          6.00</description>
		<content:encoded><![CDATA[<p>for i = A<br />
&#8230;statements&#8230;<br />
end;</p>
<p>Description:<br />
The &#8230;statements&#8230; are executed (as MATLAB commands) for i equal sequentially to each column in A.  If A is 3D or greater, the &#8230;statements&#8230; are executed for i equal sequentially to the vector of first index values for each combination of the other indices of A.</p>
<p>Example:<br />
A = [1 2 3; 4 5 6];<br />
for i = A<br />
this_is_i = i<br />
end;</p>
<p>Result:<br />
this_is_i =</p>
<p>          1.00<br />
          4.00</p>
<p>this_is_i =</p>
<p>          2.00<br />
          5.00</p>
<p>this_is_i =</p>
<p>          3.00<br />
          6.00</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21025</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Wed, 03 Sep 2008 20:51:14 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21025</guid>
		<description>Omar&#8212;Nice work.</description>
		<content:encoded><![CDATA[<p>Omar&mdash;Nice work.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Omar</title>
		<link>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21024</link>
		<dc:creator>Omar</dc:creator>
		<pubDate>Wed, 03 Sep 2008 20:38:51 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2008/09/03/dilation-algorithms-introduction/#comment-21024</guid>
		<description>for wk = w

w is a 1-by-n vector that contains n indices. wk will iterate n-times w and use each value in w as a current index. E.g.,

wk = [1, 3, 5, 7]

wk will have values (1,3,5,7) at each of the four iterations.</description>
		<content:encoded><![CDATA[<p>for wk = w</p>
<p>w is a 1-by-n vector that contains n indices. wk will iterate n-times w and use each value in w as a current index. E.g.,</p>
<p>wk = [1, 3, 5, 7]</p>
<p>wk will have values (1,3,5,7) at each of the four iterations.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
