<?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 7</title>
	<link>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/</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, 08 Nov 2009 05:06:50 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-21711</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Mon, 27 Apr 2009 00:14:51 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-21711</guid>
		<description>Ashwati&#8212;Thanks! I forwarded your comment to Dr. Gonzalez, who wrote the frequency domain processing chapter.</description>
		<content:encoded><![CDATA[<p>Ashwati&mdash;Thanks! I forwarded your comment to Dr. Gonzalez, who wrote the frequency domain processing chapter.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ashwati</title>
		<link>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-21710</link>
		<dc:creator>Ashwati</dc:creator>
		<pubDate>Sun, 26 Apr 2009 13:58:09 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-21710</guid>
		<description>Dear Steve,
I am currently doing a project in Digital Image Processing. I just wanted to say that I have followed your book, DIP with Matlab, and have found it a very satisfying experience, especially the section of Frequency Domain processing, cleared a lot of cobwebs. Thank you very much.
Ashwati</description>
		<content:encoded><![CDATA[<p>Dear Steve,<br />
I am currently doing a project in Digital Image Processing. I just wanted to say that I have followed your book, DIP with Matlab, and have found it a very satisfying experience, especially the section of Frequency Domain processing, cleared a lot of cobwebs. Thank you very much.<br />
Ashwati</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-21196</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Wed, 29 Oct 2008 22:47:02 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-21196</guid>
		<description>Jxwht&#8212;Not directly by using indexing offsets, but it can be programmed in MATLAB.  I have done it in the past, but a long time ago.  I don't have code for it anymore.</description>
		<content:encoded><![CDATA[<p>Jxwht&mdash;Not directly by using indexing offsets, but it can be programmed in MATLAB.  I have done it in the past, but a long time ago.  I don&#8217;t have code for it anymore.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jxwht</title>
		<link>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-21179</link>
		<dc:creator>jxwht</dc:creator>
		<pubDate>Tue, 21 Oct 2008 12:23:32 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-21179</guid>
		<description>Hi Steve,
  As you mentioned before, we can find the 4- or 8- connected "pairs" by using linear indexing and linear neighbor index offsets, is there a similar algorithm to find the 4- or 8- connected "pairs" RUNs?
  Thank you!</description>
		<content:encoded><![CDATA[<p>Hi Steve,<br />
  As you mentioned before, we can find the 4- or 8- connected &#8220;pairs&#8221; by using linear indexing and linear neighbor index offsets, is there a similar algorithm to find the 4- or 8- connected &#8220;pairs&#8221; RUNs?<br />
  Thank you!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-14131</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Mon, 05 Nov 2007 23:52:28 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-14131</guid>
		<description>Emanuele&#8212;I'm glad you liked it.  Thanks for taking the time to comment.</description>
		<content:encoded><![CDATA[<p>Emanuele&mdash;I&#8217;m glad you liked it.  Thanks for taking the time to comment.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Emanuele Rodolà</title>
		<link>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-14118</link>
		<dc:creator>Emanuele Rodolà</dc:creator>
		<pubDate>Mon, 05 Nov 2007 22:11:42 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/06/12/connected-component-labeling-part-7/#comment-14118</guid>
		<description>Just finished reading through your seven-parts tour. Thanks a lot, found it very useful!</description>
		<content:encoded><![CDATA[<p>Just finished reading through your seven-parts tour. Thanks a lot, found it very useful!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
