<?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: Connected component labeling - Part 5</title>
	<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/</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>Sun, 22 Nov 2009 23:24:05 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-22349</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Sun, 15 Nov 2009 14:38:59 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-22349</guid>
		<description>Alvin&#8212;I already wrote a lot about these algorithms in this series. Be sure to check out all the &lt;a href="http://blogs.mathworks.com/steve/category/connected-components/" rel="nofollow"&gt;related posts&lt;/a&gt;.  There's also quite a lot of information about connected components labeling available in other online sources.</description>
		<content:encoded><![CDATA[<p>Alvin&mdash;I already wrote a lot about these algorithms in this series. Be sure to check out all the <a href="http://blogs.mathworks.com/steve/category/connected-components/" rel="nofollow">related posts</a>.  There&#8217;s also quite a lot of information about connected components labeling available in other online sources.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alvin</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-22348</link>
		<dc:creator>Alvin</dc:creator>
		<pubDate>Sun, 15 Nov 2009 09:35:20 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-22348</guid>
		<description>Hi steve, 
I go thru' the bwlabel and bwlabeln, but i don't understand how to write the algorithm with referring its theory. Mind to put on a simple example for my reference?
Million thanks to you, Steve.


Rgds,
Alvin</description>
		<content:encoded><![CDATA[<p>Hi steve,<br />
I go thru&#8217; the bwlabel and bwlabeln, but i don&#8217;t understand how to write the algorithm with referring its theory. Mind to put on a simple example for my reference?<br />
Million thanks to you, Steve.</p>
<p>Rgds,<br />
Alvin</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20997</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Fri, 22 Aug 2008 13:25:03 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20997</guid>
		<description>DP&#8212;There are one or two &lt;a href="http://www.mathworks.com/products/image/demos.html" rel="nofollow"&gt;Image Processing Toolbox product demos&lt;/a&gt; that might be helpful.</description>
		<content:encoded><![CDATA[<p>DP&mdash;There are one or two <a href="http://www.mathworks.com/products/image/demos.html" rel="nofollow">Image Processing Toolbox product demos</a> that might be helpful.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: DP</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20996</link>
		<dc:creator>DP</dc:creator>
		<pubDate>Fri, 22 Aug 2008 13:18:01 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20996</guid>
		<description>Hi Steve:
i am happy to saw that your update on "Image visualization using transparency" to label the two connected objects as a single object.
However, i am having a problem with seperating two overlap object to seperate. in binary image i am trying to seperate two/three overlap rectangular object to seperate them and calculate the centroids of each seperated object. could you please show me one example?

Thank you.
Sincerely,
DP</description>
		<content:encoded><![CDATA[<p>Hi Steve:<br />
i am happy to saw that your update on &#8220;Image visualization using transparency&#8221; to label the two connected objects as a single object.<br />
However, i am having a problem with seperating two overlap object to seperate. in binary image i am trying to seperate two/three overlap rectangular object to seperate them and calculate the centroids of each seperated object. could you please show me one example?</p>
<p>Thank you.<br />
Sincerely,<br />
DP</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20993</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Fri, 22 Aug 2008 13:12:29 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20993</guid>
		<description>Nawal&#8212;You can the convex hull of each connected component via &lt;tt&gt;regionprops&lt;/tt&gt;.  Then you need a routine to determine if two polygons overlap.  You don't a routine that works for general polygons, because the convex hull polygons will be, well, convex.  :-)  You might try searching the MATLAB Central File Exchange in addition to Google.</description>
		<content:encoded><![CDATA[<p>Nawal&mdash;You can the convex hull of each connected component via <tt>regionprops</tt>.  Then you need a routine to determine if two polygons overlap.  You don&#8217;t a routine that works for general polygons, because the convex hull polygons will be, well, convex.  :-)  You might try searching the MATLAB Central File Exchange in addition to Google.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nawal</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20988</link>
		<dc:creator>Nawal</dc:creator>
		<pubDate>Thu, 21 Aug 2008 23:52:53 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20988</guid>
		<description>Thank you Steve. 

Sorry, in my case there is an overlap between bounding box of connected component not in connected component it self. I read today in some research paper the follwing idea we can use convex hull of connected component. where if there are an overlaping between two convex hull there are an overlap between bounding box of component.</description>
		<content:encoded><![CDATA[<p>Thank you Steve. </p>
<p>Sorry, in my case there is an overlap between bounding box of connected component not in connected component it self. I read today in some research paper the follwing idea we can use convex hull of connected component. where if there are an overlaping between two convex hull there are an overlap between bounding box of component.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20987</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 21 Aug 2008 17:22:26 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20987</guid>
		<description>Nawal&#8212;You can't have two connected components that are overlapping.  "Overlapping" indicates that you really only have one connected component.</description>
		<content:encoded><![CDATA[<p>Nawal&mdash;You can&#8217;t have two connected components that are overlapping.  &#8220;Overlapping&#8221; indicates that you really only have one connected component.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nawal</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20985</link>
		<dc:creator>Nawal</dc:creator>
		<pubDate>Thu, 21 Aug 2008 15:05:55 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20985</guid>
		<description>hi steve. 
How we can detect an overlaping between connected cmponent.
can you help me. 

Thanks in advance
Nawal</description>
		<content:encoded><![CDATA[<p>hi steve.<br />
How we can detect an overlaping between connected cmponent.<br />
can you help me. </p>
<p>Thanks in advance<br />
Nawal</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20876</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Tue, 15 Jul 2008 16:54:04 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20876</guid>
		<description>Karthik&#8212;You didn't check your A matrix.  This line:

&lt;pre&gt;
A(1:5+1:end) = 1;
&lt;/pre&gt;

doesn't do what you thought it would.

See &lt;a href="http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-6814" rel="nofollow"&gt;this comment&lt;/a&gt; from Tim Davis about efficiently putting 1s on the diagonal of a sparse matrix.</description>
		<content:encoded><![CDATA[<p>Karthik&mdash;You didn&#8217;t check your A matrix.  This line:</p>
<pre>
A(1:5+1:end) = 1;
</pre>
<p>doesn&#8217;t do what you thought it would.</p>
<p>See <a href="http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-6814" rel="nofollow">this comment</a> from Tim Davis about efficiently putting 1s on the diagonal of a sparse matrix.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Karthik</title>
		<link>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20875</link>
		<dc:creator>Karthik</dc:creator>
		<pubDate>Tue, 15 Jul 2008 16:23:54 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/05/11/connected-component-labeling-part-5/#comment-20875</guid>
		<description>Hi Steve, i have a problem in using dmperm function, as my adjacency pairs are not incremental.  ie. example in below case i dont have label 4, as it forms a individual un-connected cluster.

pairs = [ 2 3; 3 2; 1 2; 2 1; 5 6; 6 5];

here i have 5 nodes in total (ie. 1,2,3,5,6)

A = sparse(pairs(:,1), pairs(:,2), 1);
A(1:5+1:end) = 1;

[p, q, r, s] = dmperm(A);

this does not give correct result. how to solve this problem?</description>
		<content:encoded><![CDATA[<p>Hi Steve, i have a problem in using dmperm function, as my adjacency pairs are not incremental.  ie. example in below case i dont have label 4, as it forms a individual un-connected cluster.</p>
<p>pairs = [ 2 3; 3 2; 1 2; 2 1; 5 6; 6 5];</p>
<p>here i have 5 nodes in total (ie. 1,2,3,5,6)</p>
<p>A = sparse(pairs(:,1), pairs(:,2), 1);<br />
A(1:5+1:end) = 1;</p>
<p>[p, q, r, s] = dmperm(A);</p>
<p>this does not give correct result. how to solve this problem?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
