<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Connected component labeling &#8211; Part 3</title>
	<atom:link href="http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/</link>
	<description>Steve Eddins manages the Image &#38; Geospatial development team at The MathWorks and coauthored Digital Image Processing Using MATLAB. He writes here about image processing concepts, algorithm implementations, and MATLAB.</description>
	<lastBuildDate>Fri, 10 Feb 2012 18:55:59 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Gulcan</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23814</link>
		<dc:creator>Gulcan</dc:creator>
		<pubDate>Mon, 27 Dec 2010 21:01:38 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23814</guid>
		<description>Sorry for the previous comment. I thought I was writing for the post titled &quot;Almost-connected-component labeling&quot;. I posted my comment there as well, thanks.</description>
		<content:encoded><![CDATA[<p>Sorry for the previous comment. I thought I was writing for the post titled &#8220;Almost-connected-component labeling&#8221;. I posted my comment there as well, thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gulcan</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23812</link>
		<dc:creator>Gulcan</dc:creator>
		<pubDate>Mon, 27 Dec 2010 20:56:35 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23812</guid>
		<description>Hello Steve,
I have a kinda-similar problem. I am trying to detect buildings and obtain a labeled image after segmentation. I have also binary mask of buildings and I want to train my system for each building object. Thus, I have a labeled image and a binary mask for the desired objects. However, there are several labels in the region of corresponding component in binary mask and I want to merge these regions in labeled image and give them a single label for each object. I mean, I want to merge building segment labels which I know they are part of a building object indeed. I guess traversing all the pixels of objects in the binary mask is the most cumbersome way, but I can&#039;t think of any other thing. Any suggestions will be appreciated. Thanks a lot.</description>
		<content:encoded><![CDATA[<p>Hello Steve,<br />
I have a kinda-similar problem. I am trying to detect buildings and obtain a labeled image after segmentation. I have also binary mask of buildings and I want to train my system for each building object. Thus, I have a labeled image and a binary mask for the desired objects. However, there are several labels in the region of corresponding component in binary mask and I want to merge these regions in labeled image and give them a single label for each object. I mean, I want to merge building segment labels which I know they are part of a building object indeed. I guess traversing all the pixels of objects in the binary mask is the most cumbersome way, but I can&#8217;t think of any other thing. Any suggestions will be appreciated. Thanks a lot.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: huambrillo</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23495</link>
		<dc:creator>huambrillo</dc:creator>
		<pubDate>Thu, 16 Sep 2010 17:33:52 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23495</guid>
		<description>Mr. Steve , why did you have to put 1s on the diagonal of A?</description>
		<content:encoded><![CDATA[<p>Mr. Steve , why did you have to put 1s on the diagonal of A?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23490</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 16 Sep 2010 12:18:02 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23490</guid>
		<description>Jorge&#8212;What do want to know about it?</description>
		<content:encoded><![CDATA[<p>Jorge&mdash;What do want to know about it?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jorge</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23486</link>
		<dc:creator>jorge</dc:creator>
		<pubDate>Thu, 16 Sep 2010 05:35:02 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23486</guid>
		<description>do you know about K nearest neighbors? can you explain this into a post? 
http://www.mathworks.com/matlabcentral/fileexchange/15562-k-nearest-neighbors</description>
		<content:encoded><![CDATA[<p>do you know about K nearest neighbors? can you explain this into a post?<br />
<a href="http://www.mathworks.com/matlabcentral/fileexchange/15562-k-nearest-neighbors" rel="nofollow">http://www.mathworks.com/matlabcentral/fileexchange/15562-k-nearest-neighbors</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23463</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Fri, 10 Sep 2010 17:21:18 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23463</guid>
		<description>Stefano&#8212;To compute the connected components of the graph represented by the adjacency matrix.</description>
		<content:encoded><![CDATA[<p>Stefano&mdash;To compute the connected components of the graph represented by the adjacency matrix.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: stefano</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23461</link>
		<dc:creator>stefano</dc:creator>
		<pubDate>Fri, 10 Sep 2010 17:15:44 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23461</guid>
		<description>ok Steve thanks anyway. but why do you have to put 1s on the diagonal of A so that you put dmperm? . what is the propose of dmperm? why do you use this command?</description>
		<content:encoded><![CDATA[<p>ok Steve thanks anyway. but why do you have to put 1s on the diagonal of A so that you put dmperm? . what is the propose of dmperm? why do you use this command?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23453</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 09 Sep 2010 16:25:28 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23453</guid>
		<description>Stefano&#8212;I don&#039;t understand your first question. As to the second, I am not personally familiar the details of the dmperm algorithm; you&#039;ll need to research that yourself.</description>
		<content:encoded><![CDATA[<p>Stefano&mdash;I don&#8217;t understand your first question. As to the second, I am not personally familiar the details of the dmperm algorithm; you&#8217;ll need to research that yourself.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: stefano</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23452</link>
		<dc:creator>stefano</dc:creator>
		<pubDate>Thu, 09 Sep 2010 15:25:53 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23452</guid>
		<description>hi Steve! how can you “find” the number of nodes with the “find” function? 

Respect your dmperm ( dulmage-mendelsohn descomposition) I dont understand. Can you explain that algorithm? thank you in advance</description>
		<content:encoded><![CDATA[<p>hi Steve! how can you “find” the number of nodes with the “find” function? </p>
<p>Respect your dmperm ( dulmage-mendelsohn descomposition) I dont understand. Can you explain that algorithm? thank you in advance</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23113</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Fri, 14 May 2010 11:41:27 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/03/20/connected-component-labeling-part-3/#comment-23113</guid>
		<description>Amey&#8212;The Image Processing Toolbox does not have such a function.</description>
		<content:encoded><![CDATA[<p>Amey&mdash;The Image Processing Toolbox does not have such a function.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

