<?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: Lengths of digital curves, continued</title>
	<atom:link href="http://inperc.com/blog2/index.php/2007/10/20/lengths-of-digital-curves-continued/feed/" rel="self" type="application/rss+xml" />
	<link>http://inperc.com/blog2/2007/10/20/lengths-of-digital-curves-continued/</link>
	<description>Computer vision, image analysis, and related mathematics</description>
	<lastBuildDate>Thu, 17 Feb 2011 13:25:51 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.3</generator>
	<item>
		<title>By: Computer Vision for Dummies &#187; Connectivity (or Lengths of Digital Curves, part 6)</title>
		<link>http://inperc.com/blog2/2007/10/20/lengths-of-digital-curves-continued/comment-page-1/#comment-33</link>
		<dc:creator>Computer Vision for Dummies &#187; Connectivity (or Lengths of Digital Curves, part 6)</dc:creator>
		<pubDate>Fri, 07 Dec 2007 14:22:21 +0000</pubDate>
		<guid isPermaLink="false">http://inperc.com/blog2/2007/10/20/lengths-of-digital-curves-continued/#comment-33</guid>
		<description>[...] Yes, part 6! I thought I was done with the topic (Part 1, Part 2, Part 3,…), but a couple of days ago I ran into this blog post: General connectivity (MATLAB Central) . The issue is connectivity in digital images: 4-connectivity, 8-connectivity, and other “connectivities”. The issue (adjacency of pixels) is discussed in the wiki. When I wrote this article though I did not realize that the topic is connected to measuring lengths of curves. Indeed, the 8-connectivity produces curves that go only horizontally or vertically while the 4-connectivity allows diagonal edges as well. In the post the curves appear as “perimeters” of objects. More accurately, they should be called contours or boundaries of objects as the perimeter is mathematically the length of the boundary (that’s where “meter” comes from). But bwperim is the name of the standard MATLAB command for finding the boundary and we will have to live with that… [...]</description>
		<content:encoded><![CDATA[<p>[...] Yes, part 6! I thought I was done with the topic (Part 1, Part 2, Part 3,…), but a couple of days ago I ran into this blog post: General connectivity (MATLAB Central) . The issue is connectivity in digital images: 4-connectivity, 8-connectivity, and other “connectivities”. The issue (adjacency of pixels) is discussed in the wiki. When I wrote this article though I did not realize that the topic is connected to measuring lengths of curves. Indeed, the 8-connectivity produces curves that go only horizontally or vertically while the 4-connectivity allows diagonal edges as well. In the post the curves appear as “perimeters” of objects. More accurately, they should be called contours or boundaries of objects as the perimeter is mathematically the length of the boundary (that’s where “meter” comes from). But bwperim is the name of the standard MATLAB command for finding the boundary and we will have to live with that… [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Computer Vision for Dummies &#187; Lengths of digital curves, part 5</title>
		<link>http://inperc.com/blog2/2007/10/20/lengths-of-digital-curves-continued/comment-page-1/#comment-21</link>
		<dc:creator>Computer Vision for Dummies &#187; Lengths of digital curves, part 5</dc:creator>
		<pubDate>Tue, 13 Nov 2007 15:36:42 +0000</pubDate>
		<guid isPermaLink="false">http://inperc.com/blog2/2007/10/20/lengths-of-digital-curves-continued/#comment-21</guid>
		<description>[...] Here is how it happened. The algorithm for roundness computes the perimeter first. More precisely, it computes the “adjusted” perimeter. The reason is that the perimeter computed as the number of steps in the curve depends on the orientation of the curve with respect to the grid. This “first degree approximation” produces the same roundness for a square and a 5&#215;1 rectangle. To compute the better adjusted perimeter we use the “second degree approximation” that takes into account both the perimeter and the curvature (number of turns). Some error is still there but the results were supposed to be much better. And they were until I tried a diagonally oriented square. The roundness was way off! [...]</description>
		<content:encoded><![CDATA[<p>[...] Here is how it happened. The algorithm for roundness computes the perimeter first. More precisely, it computes the “adjusted” perimeter. The reason is that the perimeter computed as the number of steps in the curve depends on the orientation of the curve with respect to the grid. This “first degree approximation” produces the same roundness for a square and a 5&#215;1 rectangle. To compute the better adjusted perimeter we use the “second degree approximation” that takes into account both the perimeter and the curvature (number of turns). Some error is still there but the results were supposed to be much better. And they were until I tried a diagonally oriented square. The roundness was way off! [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Computer Vision for Dummies &#187; Lengths of digital curves, part 3</title>
		<link>http://inperc.com/blog2/2007/10/20/lengths-of-digital-curves-continued/comment-page-1/#comment-16</link>
		<dc:creator>Computer Vision for Dummies &#187; Lengths of digital curves, part 3</dc:creator>
		<pubDate>Sat, 27 Oct 2007 20:33:06 +0000</pubDate>
		<guid isPermaLink="false">http://inperc.com/blog2/2007/10/20/lengths-of-digital-curves-continued/#comment-16</guid>
		<description>[...] Recall that in the previous posts we discussed what happens if one computes the length of a curve in a digital image as the total sum of distances between consecutive points. The conclusion was that using the length computed this way to evaluate the shapes of objects leads to disastrous results. [...]</description>
		<content:encoded><![CDATA[<p>[...] Recall that in the previous posts we discussed what happens if one computes the length of a curve in a digital image as the total sum of distances between consecutive points. The conclusion was that using the length computed this way to evaluate the shapes of objects leads to disastrous results. [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

