<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Cris's Image Analysis Blog</title>
	<atom:link href="http://www.cb.uu.se/~cris/blog/index.php/feed" rel="self" type="application/rss+xml" />
	<link>http://www.cb.uu.se/~cris/blog</link>
	<description>theory, methods, algorithms, applications</description>
	<lastBuildDate>Mon, 13 Feb 2012 16:46:03 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>Computing Feret diameters from the convex hull</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/408</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/408#comments</comments>
		<pubDate>Mon, 13 Feb 2012 16:45:41 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[area]]></category>
		<category><![CDATA[boundary]]></category>
		<category><![CDATA[chain code]]></category>
		<category><![CDATA[convex hull]]></category>
		<category><![CDATA[Feret]]></category>
		<category><![CDATA[length]]></category>
		<category><![CDATA[measure]]></category>
		<category><![CDATA[object]]></category>
		<category><![CDATA[polygon]]></category>
		<category><![CDATA[width]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=408</guid>
		<description><![CDATA[Some time ago I wrote about how to compute the Feret diameters of a 2D object based on the chain code of its boundary. The diameters we computed were the longest and shortest projections of the object. The shortest projection, or smallest Feret diameter, is equivalent to the size measured when physically passing objects through [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/408/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>DIPimage 2.4 released</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/456</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/456#comments</comments>
		<pubDate>Thu, 12 Jan 2012 12:49:35 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[announcements]]></category>
		<category><![CDATA[bsxfun]]></category>
		<category><![CDATA[DIPimage]]></category>
		<category><![CDATA[singleton dimension]]></category>
		<category><![CDATA[singleton expansion]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=456</guid>
		<description><![CDATA[I&#8217;m pleased to announce that a new version of DIPimage has been released. There&#8217;s some performance improvements, some bug fixes, and some new functions. The measure function has some new features also, that use the convex hull of the objects. The Feret measure is computed differently now, also using the convex hull. This makes this [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/456/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Scientific writing and the pronoun I</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/421</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/421#comments</comments>
		<pubDate>Wed, 05 Oct 2011 16:08:29 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[rants]]></category>
		<category><![CDATA[scientific paper]]></category>
		<category><![CDATA[scientist]]></category>
		<category><![CDATA[style]]></category>
		<category><![CDATA[writing]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=421</guid>
		<description><![CDATA[Why are scientists so scared of writing their statements in the first person? Open any journal, and look for the word &#8220;I&#8221;. Chances are, you won&#8217;t find it. You&#8217;ll see article authors jump through hoops just to avoid this word. As if it were dirty, illegal. For example, instead of a normal, complete sentence like [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/421/feed</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>The convex hull of a 2D object</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/405</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/405#comments</comments>
		<pubDate>Sun, 18 Sep 2011 15:32:00 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[area]]></category>
		<category><![CDATA[boundary]]></category>
		<category><![CDATA[chain code]]></category>
		<category><![CDATA[convex hull]]></category>
		<category><![CDATA[convexity]]></category>
		<category><![CDATA[measure]]></category>
		<category><![CDATA[object]]></category>
		<category><![CDATA[polygon]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=405</guid>
		<description><![CDATA[Last year I wrote about computing the the boundary length and various other measures, given an object&#8217;s chain code. The chain code is a simple way of encoding the polygon that represents a 2D object. It is very simple to compute the object&#8217;s convex hull given this polygon. Why would I want to do that? [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/405/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bresenham&#8217;s line drawing algorithm in any number of dimensions</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/400</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/400#comments</comments>
		<pubDate>Fri, 22 Jul 2011 09:17:10 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[Bresenham]]></category>
		<category><![CDATA[line]]></category>
		<category><![CDATA[MATLAB]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=400</guid>
		<description><![CDATA[J.E. Bresenham published an algorithm in 1965, which is used to draw 2D digital lines. Many people have extended the algorithm to work in 3D, and I&#8217;ve even found a website with code for 4D, 5D and 6D versions of the algorithm. However, all the code I come across is way more complex that it [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/400/feed</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Panoramic photograph stitching &#8212; again</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/393</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/393#comments</comments>
		<pubDate>Sun, 03 Apr 2011 11:02:11 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[tutorials]]></category>
		<category><![CDATA[panorama]]></category>
		<category><![CDATA[photography]]></category>
		<category><![CDATA[region growing]]></category>
		<category><![CDATA[stitching]]></category>
		<category><![CDATA[watershed]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=393</guid>
		<description><![CDATA[In an earlier post, I described and implemented a method, that was published recently, to stitch together photographs from a panoramic set. In a comment this morning, Panda asked about the parameters that direct the region merging in the watershed that I used. This set me to think about how much region merging the watershed [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/393/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Dithering</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/355</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/355#comments</comments>
		<pubDate>Fri, 07 Jan 2011 09:20:04 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[binary]]></category>
		<category><![CDATA[blue noise]]></category>
		<category><![CDATA[color map]]></category>
		<category><![CDATA[dither]]></category>
		<category><![CDATA[halftone]]></category>
		<category><![CDATA[noise]]></category>
		<category><![CDATA[threshold]]></category>
		<category><![CDATA[white noise]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=355</guid>
		<description><![CDATA[First of all: Happy New Year! Over the holidays I&#8217;ve been learning about dithering, the process of creating the illusion of many grey levels using only black and white dots. This is used when displaying an image on a device with fewer than the 64 or so grey levels that we can distinguish, such as [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/355/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>More chain code measures</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/339</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/339#comments</comments>
		<pubDate>Wed, 13 Oct 2010 15:55:47 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[area]]></category>
		<category><![CDATA[boundary]]></category>
		<category><![CDATA[bounding box]]></category>
		<category><![CDATA[chain code]]></category>
		<category><![CDATA[Feret]]></category>
		<category><![CDATA[length]]></category>
		<category><![CDATA[measure]]></category>
		<category><![CDATA[object]]></category>
		<category><![CDATA[perimeter]]></category>
		<category><![CDATA[pixel]]></category>
		<category><![CDATA[width]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=339</guid>
		<description><![CDATA[Last month I wrote a post showing how to calculate the perimeter of an object using its chain code. In this post I want to review several more measures that can be easily obtained from the chain codes: the minimum bounding box; the object&#8217;s orientation, maximum length and minimum width; and the object&#8217;s area. The [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/339/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>How to obtain the chain code</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/324</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/324#comments</comments>
		<pubDate>Mon, 27 Sep 2010 12:39:29 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[boundary]]></category>
		<category><![CDATA[chain code]]></category>
		<category><![CDATA[measure]]></category>
		<category><![CDATA[object]]></category>
		<category><![CDATA[perimeter]]></category>
		<category><![CDATA[pixel]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=324</guid>
		<description><![CDATA[In the previous post I discussed simple techniques to estimate the boundary length of a binarized object. These techniques are based on the chain code. This post will detail how to obtain such a chain code. The algorithm is quite simple, but might not be trivial to understand. Future posts will discuss other measures that [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/324/feed</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
		<item>
		<title>Measuring boundary length</title>
		<link>http://www.cb.uu.se/~cris/blog/index.php/archives/310</link>
		<comments>http://www.cb.uu.se/~cris/blog/index.php/archives/310#comments</comments>
		<pubDate>Tue, 14 Sep 2010 15:55:37 +0000</pubDate>
		<dc:creator>Cris Luengo</dc:creator>
				<category><![CDATA[tutorials]]></category>
		<category><![CDATA[boundary]]></category>
		<category><![CDATA[chain code]]></category>
		<category><![CDATA[Freeman]]></category>
		<category><![CDATA[measure]]></category>
		<category><![CDATA[object]]></category>
		<category><![CDATA[perimeter]]></category>
		<category><![CDATA[pixel]]></category>

		<guid isPermaLink="false">http://www.cb.uu.se/~cris/blog/?p=310</guid>
		<description><![CDATA[Oftentimes we segment an image to find objects of interest, and then measure these objects &#8212; their area, their perimeter, their aspect ratio, etc. etc. Measuring the area is accomplished simply by counting the number of pixels. But measuring the perimeter is not as simple. If we simply count the number of boundary pixels we [...]]]></description>
		<wfw:commentRss>http://www.cb.uu.se/~cris/blog/index.php/archives/310/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>

