<?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 6</title>
	<atom:link href="http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/</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: Yang</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-24041</link>
		<dc:creator>Yang</dc:creator>
		<pubDate>Tue, 22 Mar 2011 11:33:03 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-24041</guid>
		<description>OK, thanks for your reply! ^_^</description>
		<content:encoded><![CDATA[<p>OK, thanks for your reply! ^_^</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-24038</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Mon, 21 Mar 2011 17:38:43 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-24038</guid>
		<description>Yang&#8212;dmperm was already available as a fast, built-in MATLAB operation. Also, bwlabel is based the idea of labeling runs of pixels instead of labeling individual pixels, so the equivalence-class determination step is a relatively small fraction of the overall performance picture of bwlabel.</description>
		<content:encoded><![CDATA[<p>Yang&mdash;dmperm was already available as a fast, built-in MATLAB operation. Also, bwlabel is based the idea of labeling runs of pixels instead of labeling individual pixels, so the equivalence-class determination step is a relatively small fraction of the overall performance picture of bwlabel.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Yang</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-24037</link>
		<dc:creator>Yang</dc:creator>
		<pubDate>Sun, 20 Mar 2011 14:45:27 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-24037</guid>
		<description>Hi Steve:

I am a little confused. Do you use disjoint sets in bwlabel? I have read the source code, and it seems that you use dmperm instead. Why? Is dmperm faster than disjoint sets? 

Yang</description>
		<content:encoded><![CDATA[<p>Hi Steve:</p>
<p>I am a little confused. Do you use disjoint sets in bwlabel? I have read the source code, and it seems that you use dmperm instead. Why? Is dmperm faster than disjoint sets? </p>
<p>Yang</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-23305</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Wed, 21 Jul 2010 17:40:39 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-23305</guid>
		<description>Hilda&#8212;No, I doubt that it is feasible.</description>
		<content:encoded><![CDATA[<p>Hilda&mdash;No, I doubt that it is feasible.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Hilda</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-23304</link>
		<dc:creator>Hilda</dc:creator>
		<pubDate>Wed, 21 Jul 2010 17:13:17 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-23304</guid>
		<description>Hello, 
I have a set of code here that I need to translate to C by using the RTW.  Most of it adheres to the Embedded MatLab subset, but the function bwlabel is included.  In RTW C code generation you can insert functions already written in C.  So my question is, is it feasible to include the .cpps in the image toolbox/private folder that perform most of the bwlabel operations to bypass having to write the algorithm with embedded matlab compliant functions?</description>
		<content:encoded><![CDATA[<p>Hello,<br />
I have a set of code here that I need to translate to C by using the RTW.  Most of it adheres to the Embedded MatLab subset, but the function bwlabel is included.  In RTW C code generation you can insert functions already written in C.  So my question is, is it feasible to include the .cpps in the image toolbox/private folder that perform most of the bwlabel operations to bypass having to write the algorithm with embedded matlab compliant functions?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-22410</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Fri, 04 Dec 2009 18:48:16 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-22410</guid>
		<description>Evan&#8212;See the pseudocode and external links on &lt;a href=&quot;http://en.wikipedia.org/wiki/Disjoint-set_data_structure&quot; rel=&quot;nofollow&quot;&gt;this page&lt;/a&gt;.</description>
		<content:encoded><![CDATA[<p>Evan&mdash;See the pseudocode and external links on <a href="http://en.wikipedia.org/wiki/Disjoint-set_data_structure" rel="nofollow">this page</a>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Evan</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-22386</link>
		<dc:creator>Evan</dc:creator>
		<pubDate>Mon, 30 Nov 2009 01:18:08 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-22386</guid>
		<description>Hi, 
I am currently working on writing my own connected components code in MATLAB. I have read through all of your posts and find them very helpful in the theory part of the code. I have tried searching online for a example of the algorithm that I can implement in MATLAB but i cant find any example of the equivalence matrix or union find codes. My question is what the pseudocode for doing the union-find/equivalence matrix. I have also not had any luck in getting my hands on any of the recommended books through interlibrary loan. Any help would be awesome! Thanks.</description>
		<content:encoded><![CDATA[<p>Hi,<br />
I am currently working on writing my own connected components code in MATLAB. I have read through all of your posts and find them very helpful in the theory part of the code. I have tried searching online for a example of the algorithm that I can implement in MATLAB but i cant find any example of the equivalence matrix or union find codes. My question is what the pseudocode for doing the union-find/equivalence matrix. I have also not had any luck in getting my hands on any of the recommended books through interlibrary loan. Any help would be awesome! Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-22000</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Fri, 24 Jul 2009 00:36:22 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-22000</guid>
		<description>Anand&#8212;Connected-component labeling will probably be useful to you, but you don&#039;t need to implement the algorithm yourself.  Just use &lt;tt&gt;bwlabel&lt;/tt&gt; (or &lt;tt&gt;bwconncomp&lt;/tt&gt; if you already have the R2009a release) from the Image Processing Toolbox.</description>
		<content:encoded><![CDATA[<p>Anand&mdash;Connected-component labeling will probably be useful to you, but you don&#8217;t need to implement the algorithm yourself.  Just use <tt>bwlabel</tt> (or <tt>bwconncomp</tt> if you already have the R2009a release) from the Image Processing Toolbox.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: anand</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-21988</link>
		<dc:creator>anand</dc:creator>
		<pubDate>Tue, 21 Jul 2009 11:02:11 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-21988</guid>
		<description>Hi,
  I need to detect text (font) region in a image (a high resolution text imgae).. I just want to know , will this algo help me out?

thanks
Anand</description>
		<content:encoded><![CDATA[<p>Hi,<br />
  I need to detect text (font) region in a image (a high resolution text imgae).. I just want to know , will this algo help me out?</p>
<p>thanks<br />
Anand</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-21915</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 25 Jun 2009 15:03:36 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2007/05/25/connected-component-labeling-part-6/#comment-21915</guid>
		<description>Ardy&#8212;There is a lot information available online about the union find algorithm.  I can also recommend Sedgewick, Algorithms in C, 3rd ed, Parts 1-4, pp. 10-23.</description>
		<content:encoded><![CDATA[<p>Ardy&mdash;There is a lot information available online about the union find algorithm.  I can also recommend Sedgewick, Algorithms in C, 3rd ed, Parts 1-4, pp. 10-23.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

