<?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: Independent computation in software tests</title>
	<atom:link href="http://blogs.mathworks.com/steve/2008/09/11/independent-computation-in-software-tests/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.mathworks.com/steve/2008/09/11/independent-computation-in-software-tests/</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>Sat, 11 Feb 2012 18:27:50 +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/2008/09/11/independent-computation-in-software-tests/#comment-21060</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Sat, 13 Sep 2008 02:30:12 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2008/09/11/independent-computation-in-software-tests/#comment-21060</guid>
		<description>Chas&#8212;The &lt;tt&gt;fft&lt;/tt&gt; function computes the discrete Fourier transform. No more, and no less.</description>
		<content:encoded><![CDATA[<p>Chas&mdash;The <tt>fft</tt> function computes the discrete Fourier transform. No more, and no less.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chas Kenny</title>
		<link>http://blogs.mathworks.com/steve/2008/09/11/independent-computation-in-software-tests/#comment-21059</link>
		<dc:creator>Chas Kenny</dc:creator>
		<pubDate>Sat, 13 Sep 2008 02:25:09 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/2008/09/11/independent-computation-in-software-tests/#comment-21059</guid>
		<description>Hi Steve,
Does your new fft allow comparison of phase, one image to another, greater than modulo 2 pi?
Thanks,
Chas</description>
		<content:encoded><![CDATA[<p>Hi Steve,<br />
Does your new fft allow comparison of phase, one image to another, greater than modulo 2 pi?<br />
Thanks,<br />
Chas</p>
]]></content:encoded>
	</item>
</channel>
</rss>

