<?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>Renaud Bourassa &#187; Code</title>
	<atom:link href="http://renaudbourassa.com/blog/category/code/feed/" rel="self" type="application/rss+xml" />
	<link>http://renaudbourassa.com/blog</link>
	<description>Welcome to my World. Here, I am the Architect.</description>
	<lastBuildDate>Thu, 19 Jan 2012 05:45:50 +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>Playing with Snakes</title>
		<link>http://renaudbourassa.com/blog/2012/01/19/playing-with-snakes/</link>
		<comments>http://renaudbourassa.com/blog/2012/01/19/playing-with-snakes/#comments</comments>
		<pubDate>Thu, 19 Jan 2012 05:45:50 +0000</pubDate>
		<dc:creator>Rhino</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[Computer Vision]]></category>
		<category><![CDATA[Matlab]]></category>

		<guid isPermaLink="false">http://renaudbourassa.com/blog/?p=640</guid>
		<description><![CDATA[As part of my Introduction to Computer Vision class, I got to implement and analyze an algorithm of my choice. I ended up picking the Greedy Snake algorithm as described by Williams and Shah. Snakes are active contour models which, when positioned near an object, tend to converge to its edges. They are thus useful [...]]]></description>
			<content:encoded><![CDATA[<p>As part of my Introduction to Computer Vision class, I got to implement and analyze an algorithm of my choice. I ended up picking the Greedy Snake algorithm as described by <a href="http://pages.cs.wisc.edu/~dyer/ai-qual/williams-cvgip92.pdf">Williams and Shah</a>. Snakes are active contour models which, when positioned near an object, tend to converge to its edges. They are thus useful to track or find objects within an image given a decent initial guess. One interesting application of this algorithm is in video tracking, where the output from one frame can be used as the input to the following frame, making it possible to track the object&#8217;s position from frame to frame cheaply.</p>
<p style="text-align:center"><img src="http://renaudbourassa.com/blog/wp-content/uploads/2012/01/in-1.png" alt="" title="input" width="150" height="150" class="aligncenter size-full wp-image-642" /><img src="http://renaudbourassa.com/blog/wp-content/uploads/2012/01/out-11.png" alt="" title="output" width="150" height="150" class="aligncenter size-full wp-image-643" /></p>
<p>If you are interested in the details, I posted the MATLAB code as well as the analysis on <a href="https://github.com/renaudb/Greedy-Snake">Github</a>, so go ahead and fork it! </p>
]]></content:encoded>
			<wfw:commentRss>http://renaudbourassa.com/blog/2012/01/19/playing-with-snakes/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Euler 26 to 30</title>
		<link>http://renaudbourassa.com/blog/2009/02/10/euler-26-to-30/</link>
		<comments>http://renaudbourassa.com/blog/2009/02/10/euler-26-to-30/#comments</comments>
		<pubDate>Wed, 11 Feb 2009 04:37:20 +0000</pubDate>
		<dc:creator>Rhino</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[Ruby]]></category>

		<guid isPermaLink="false">http://renaudbourassa.com/blog/?p=242</guid>
		<description><![CDATA[I just finished uploading my solutions to the Project Euler problems 26 to 30. They are all in Ruby since it is the language I am currently learning during my free time. I decided this time not to write the answers at the end. This way you have to execute the code yourself if you [...]]]></description>
			<content:encoded><![CDATA[<p>I just finished uploading my <a href="http://renaudbourassa.com/blog/project-euler-solutions/">solutions</a> to the <a href="http://projecteuler.net">Project Euler</a> problems 26 to 30. They are all in Ruby since it is the language I am currently learning during my free time. I decided this time not to write the answers at the end. This way you have to execute the code yourself if you just want the answer. I also included comments to explain the parts that are harder to understand. If you have any question regarding any of the solutions, just post it as a comment.</p>
]]></content:encoded>
			<wfw:commentRss>http://renaudbourassa.com/blog/2009/02/10/euler-26-to-30/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Euler Posted</title>
		<link>http://renaudbourassa.com/blog/2009/01/18/euler-posted/</link>
		<comments>http://renaudbourassa.com/blog/2009/01/18/euler-posted/#comments</comments>
		<pubDate>Sun, 18 Jan 2009 22:00:24 +0000</pubDate>
		<dc:creator>Rhino</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://renaudbourassa.com/blog/?p=185</guid>
		<description><![CDATA[It took me a while, but all my solutions for the 25 first Project Euler problems are finally posted. To access them, you just have to click on the link in the sidebar, just under Inside.]]></description>
			<content:encoded><![CDATA[<p>It took me a while, but all my solutions for the 25 first <a href="http://projecteuler.net">Project Euler</a> problems are finally posted. To access them, you just have to click on the <a href="http://renaudbourassa.com/blog/project-euler-solutions/">link</a> in the sidebar, just under Inside.</p>
]]></content:encoded>
			<wfw:commentRss>http://renaudbourassa.com/blog/2009/01/18/euler-posted/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

