<?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: Antialiased polygon scan conversion: Are you interested?</title>
	<atom:link href="http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/</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: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-24388</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Mon, 08 Aug 2011 19:35:52 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-24388</guid>
		<description>Rishabh&#8212;I haven&#039;t written it.</description>
		<content:encoded><![CDATA[<p>Rishabh&mdash;I haven&#8217;t written it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rishabh Jain</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-24379</link>
		<dc:creator>Rishabh Jain</dc:creator>
		<pubDate>Mon, 01 Aug 2011 21:02:30 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-24379</guid>
		<description>Hi Steve,

I really enjoyed your last several posts. I would really really find this code useful, esp. in generating stimuli at non grid locations for my simulations. Can you please share the code for the mentioned anti-aliased polyscan algorithm ?

Thanks a lot in advance
Rishabh</description>
		<content:encoded><![CDATA[<p>Hi Steve,</p>
<p>I really enjoyed your last several posts. I would really really find this code useful, esp. in generating stimuli at non grid locations for my simulations. Can you please share the code for the mentioned anti-aliased polyscan algorithm ?</p>
<p>Thanks a lot in advance<br />
Rishabh</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rishabh Jain</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-24378</link>
		<dc:creator>Rishabh Jain</dc:creator>
		<pubDate>Mon, 01 Aug 2011 18:27:40 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-24378</guid>
		<description>Hi Steve,

I really enjoyed your last several posts. I would really really find this code useful, esp. in generating stimuli at non grid locations for my simulations. Can you please share this anti-aliased polyscan algorithm ?

Thanks a lot in advance
Rishabh</description>
		<content:encoded><![CDATA[<p>Hi Steve,</p>
<p>I really enjoyed your last several posts. I would really really find this code useful, esp. in generating stimuli at non grid locations for my simulations. Can you please share this anti-aliased polyscan algorithm ?</p>
<p>Thanks a lot in advance<br />
Rishabh</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-23425</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Fri, 03 Sep 2010 20:04:23 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-23425</guid>
		<description>Thomas&#8212;If you have enough memory to upsample your image by a factor of 3 in both directions, then you could do bwboundaries on the result. Then if you can scale the boundary locations back down you can get boundaries along the pixel edges instead of through the pixel centers.

I&#039;ll think about doing a blog post on this idea.</description>
		<content:encoded><![CDATA[<p>Thomas&mdash;If you have enough memory to upsample your image by a factor of 3 in both directions, then you could do bwboundaries on the result. Then if you can scale the boundary locations back down you can get boundaries along the pixel edges instead of through the pixel centers.</p>
<p>I&#8217;ll think about doing a blog post on this idea.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Thomas</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-23367</link>
		<dc:creator>Thomas</dc:creator>
		<pubDate>Tue, 17 Aug 2010 09:01:58 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-23367</guid>
		<description>I&#039;m using the following combination to obtain the boundary-pixels of the convex hull of some marks in an image:

thresholding
bwboundaries (to get more information for (un)selecting marks)
convhull (gives me a poygon, but I need all the pixels, therefore ...)
poly2mask
bwtraceboundary

If I use this procedure objects are always shrinking (although valid convex marks should be an invariant of that procedure). Since I&#039;m using convhull, where I lose information about the boundary, I can not ensure that the marks don&#039;t get deformed slightly, but for keeping up the area it could be useful to have the fractional coverage for selection as parameter (better performance) or at least get it as result.
This would be useful, when having a fast precompiled poly2mask-version - an interpreted one is as good as writing it on my own.

(By the way: Another improvement for my algorithm would be, if bwtraceboundary would give me the outer coords, but not the center-coords of the pixels. Is there some way?)

Regards,
Thomas</description>
		<content:encoded><![CDATA[<p>I&#8217;m using the following combination to obtain the boundary-pixels of the convex hull of some marks in an image:</p>
<p>thresholding<br />
bwboundaries (to get more information for (un)selecting marks)<br />
convhull (gives me a poygon, but I need all the pixels, therefore &#8230;)<br />
poly2mask<br />
bwtraceboundary</p>
<p>If I use this procedure objects are always shrinking (although valid convex marks should be an invariant of that procedure). Since I&#8217;m using convhull, where I lose information about the boundary, I can not ensure that the marks don&#8217;t get deformed slightly, but for keeping up the area it could be useful to have the fractional coverage for selection as parameter (better performance) or at least get it as result.<br />
This would be useful, when having a fast precompiled poly2mask-version &#8211; an interpreted one is as good as writing it on my own.</p>
<p>(By the way: Another improvement for my algorithm would be, if bwtraceboundary would give me the outer coords, but not the center-coords of the pixels. Is there some way?)</p>
<p>Regards,<br />
Thomas</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-21239</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Tue, 11 Nov 2008 16:35:26 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-21239</guid>
		<description>Ruthy&#8212;Thanks for the suggested application.</description>
		<content:encoded><![CDATA[<p>Ruthy&mdash;Thanks for the suggested application.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ruthy</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-21238</link>
		<dc:creator>Ruthy</dc:creator>
		<pubDate>Tue, 11 Nov 2008 13:17:28 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-21238</guid>
		<description>Hi Steve,

I am doing a segmentation of an image and I use the boundary information to compare between two curves and decide weather they match. 
If I am using the output of the segmentation as a discrete numbers, I will have a very noise edge and the comparison will not be robust. 
I want to get the edge of the shape in a sub-pixel resolution to be able to better compare the edges.

Ruthy</description>
		<content:encoded><![CDATA[<p>Hi Steve,</p>
<p>I am doing a segmentation of an image and I use the boundary information to compare between two curves and decide weather they match.<br />
If I am using the output of the segmentation as a discrete numbers, I will have a very noise edge and the comparison will not be robust.<br />
I want to get the edge of the shape in a sub-pixel resolution to be able to better compare the edges.</p>
<p>Ruthy</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-21101</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 25 Sep 2008 11:21:59 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-21101</guid>
		<description>Ruthy&#8212;I&#039;m not sure what you mean by &quot;a mask containing subpixel coordinates.&quot;</description>
		<content:encoded><![CDATA[<p>Ruthy&mdash;I&#8217;m not sure what you mean by &#8220;a mask containing subpixel coordinates.&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ruthy</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-21099</link>
		<dc:creator>Ruthy</dc:creator>
		<pubDate>Thu, 25 Sep 2008 09:21:22 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-21099</guid>
		<description>Hi,

I read your blog today and it is very close to what I am looking for. 
In your blog you describe a better poly2mask function. 
I am looking for a function that &quot;smoothens&quot; a mask using the original image information and returns a mask containing subpixel coordinates. 
I am using this information to compare between similar contours of objects, and the granolarity of full pixel location causes errors in the similarity measure. 

Thanks,
Ruthy</description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>I read your blog today and it is very close to what I am looking for.<br />
In your blog you describe a better poly2mask function.<br />
I am looking for a function that &#8220;smoothens&#8221; a mask using the original image information and returns a mask containing subpixel coordinates.<br />
I am using this information to compare between similar contours of objects, and the granolarity of full pixel location causes errors in the similarity measure. </p>
<p>Thanks,<br />
Ruthy</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/02/06/antialiased-polygon-scan-conversion/#comment-6669</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Wed, 18 Apr 2007 22:06:52 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=114#comment-6669</guid>
		<description>David - Thanks for your input.</description>
		<content:encoded><![CDATA[<p>David &#8211; Thanks for your input.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

