<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: Neighbor indexing</title>
	<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/</link>
	<description>Steve Eddins manages the Image &#38; Geospatial development team at &#60;a href="http://www.mathworks.com/"&#62;The MathWorks&#60;/a&#62; and coauthored &#60;a href="http://www.mathworks.com/support/books/book5291.html?category=-1&#38;language=-1"&#62;Digital Image Processing Using MATLAB&#60;/a&#62;. He writes here about image processing concepts, algorithm implementations, and MATLAB.&#60;br&#62;&#60;br&#62;&#60;img&#62;</description>
	<pubDate>Sun, 08 Nov 2009 04:48:02 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: Neha</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-15087</link>
		<dc:creator>Neha</dc:creator>
		<pubDate>Fri, 16 Nov 2007 17:02:41 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-15087</guid>
		<description>I was trying to find run lengths in diagonal directions, so wanted to use the neighbor offset to find that, but I found another solution, merely logical to it. 
Thanks!</description>
		<content:encoded><![CDATA[<p>I was trying to find run lengths in diagonal directions, so wanted to use the neighbor offset to find that, but I found another solution, merely logical to it.<br />
Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-15076</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Fri, 16 Nov 2007 12:02:47 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-15076</guid>
		<description>Reena&#8212;Use imshow.  Pay attention to data type issues.  For example, it matters whether your data is uint8 or double.  Please read the introductory chapters of the Image Processing Toolbox Users Guide.</description>
		<content:encoded><![CDATA[<p>Reena&mdash;Use imshow.  Pay attention to data type issues.  For example, it matters whether your data is uint8 or double.  Please read the introductory chapters of the Image Processing Toolbox Users Guide.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Reena</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-15074</link>
		<dc:creator>Reena</dc:creator>
		<pubDate>Fri, 16 Nov 2007 10:27:25 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-15074</guid>
		<description>Hello steave ,

I have follwing image data,How I display image using it?   

&lt;em&gt;[image data deleted from comment by Steve]&lt;/em&gt;

Thank you</description>
		<content:encoded><![CDATA[<p>Hello steave ,</p>
<p>I have follwing image data,How I display image using it?   </p>
<p><em>[image data deleted from comment by Steve]</em></p>
<p>Thank you</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-15003</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 15 Nov 2007 06:21:29 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-15003</guid>
		<description>Neha&#8212;Tell me a little bit more specifically about what you are trying to do, what you have tried, and why it didn't work.</description>
		<content:encoded><![CDATA[<p>Neha&mdash;Tell me a little bit more specifically about what you are trying to do, what you have tried, and why it didn&#8217;t work.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Neha</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14989</link>
		<dc:creator>Neha</dc:creator>
		<pubDate>Wed, 14 Nov 2007 21:25:09 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14989</guid>
		<description>Steve,

I'm facing similar problems. Can you suggest a solution to Xunkai's problem?

Thanks!</description>
		<content:encoded><![CDATA[<p>Steve,</p>
<p>I&#8217;m facing similar problems. Can you suggest a solution to Xunkai&#8217;s problem?</p>
<p>Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14888</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Mon, 12 Nov 2007 15:30:03 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14888</guid>
		<description>Xunkai&#8212;I'm glad to hear that you figured it out.</description>
		<content:encoded><![CDATA[<p>Xunkai&mdash;I&#8217;m glad to hear that you figured it out.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Xunkai Wei</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14878</link>
		<dc:creator>Xunkai Wei</dc:creator>
		<pubDate>Mon, 12 Nov 2007 08:38:40 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14878</guid>
		<description>Dear Steve,

I got a solution. Thanks.

Best,


Xunkai</description>
		<content:encoded><![CDATA[<p>Dear Steve,</p>
<p>I got a solution. Thanks.</p>
<p>Best,</p>
<p>Xunkai</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Xunkai Wei</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14817</link>
		<dc:creator>Xunkai Wei</dc:creator>
		<pubDate>Sun, 11 Nov 2007 04:59:12 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14817</guid>
		<description>Dear Steve,

the run length matrix is to count the occurrence times of each gray level. For 0', I think this is easy, because I can handle each row without use of offset and count it and then accumulate all,finally I can get the run length matrix. But for 45, 135,when using offset [-1 1] and [-1,-1], the problems occur. Using the offset, I can get a shifted submatrix, my problem is how to collect all elements of 45 or 135 into a row vector, could you give me some suggestions ? 

Best

Xunkai Wei</description>
		<content:encoded><![CDATA[<p>Dear Steve,</p>
<p>the run length matrix is to count the occurrence times of each gray level. For 0&#8242;, I think this is easy, because I can handle each row without use of offset and count it and then accumulate all,finally I can get the run length matrix. But for 45, 135,when using offset [-1 1] and [-1,-1], the problems occur. Using the offset, I can get a shifted submatrix, my problem is how to collect all elements of 45 or 135 into a row vector, could you give me some suggestions ? </p>
<p>Best</p>
<p>Xunkai Wei</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Xunkai Wei</title>
		<link>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14816</link>
		<dc:creator>Xunkai Wei</dc:creator>
		<pubDate>Sun, 11 Nov 2007 04:40:29 +0000</pubDate>
		<guid>http://blogs.mathworks.com/steve/2007/03/28/neighbor-indexing/#comment-14816</guid>
		<description>Dear Steve,

Could you give me some hints about gray level run length matrix ?
If possible, could you show me how to get the 45' direction run length matrix ?

I found that this essay contains some ideas of direction oriented neighbor search, but I do not know how to get all elements of the given direction in a specified matrix.

Looking forward to your reply


Best,
Xunkai</description>
		<content:encoded><![CDATA[<p>Dear Steve,</p>
<p>Could you give me some hints about gray level run length matrix ?<br />
If possible, could you show me how to get the 45&#8242; direction run length matrix ?</p>
<p>I found that this essay contains some ideas of direction oriented neighbor search, but I do not know how to get all elements of the given direction in a specified matrix.</p>
<p>Looking forward to your reply</p>
<p>Best,<br />
Xunkai</p>
]]></content:encoded>
	</item>
</channel>
</rss>
