http://blogs.mathworks.com/steve/2008/09/29/dilation-algorithms-decomposing-more-shapes/ Steve Eddins manages the Image & Geospatial development team at The MathWorks and coauthored Digital Image Processing Using MATLAB. He writes here about image processing concepts, algorithm implementations, and MATLAB. Sat, 11 Feb 2012 18:27:50 +0000 hourly 1 http://wordpress.org/?v=3.2.1 http://blogs.mathworks.com/steve/2008/09/29/dilation-algorithms-decomposing-more-shapes/#comment-21113 Steve Tue, 30 Sep 2008 13:25:05 +0000 http://blogs.mathworks.com/steve/2008/09/29/dilation-algorithms-decomposing-more-shapes/#comment-21113 WS—Because they are used twice. Here's an example: A 1-by-5 flat structuring element can be decomposed into two identical 1-by-3 flat structuring elements. WS—Because they are used twice. Here’s an example: A 1-by-5 flat structuring element can be decomposed into two identical 1-by-3 flat structuring elements.

]]> http://blogs.mathworks.com/steve/2008/09/29/dilation-algorithms-decomposing-more-shapes/#comment-21112 WS Tue, 30 Sep 2008 11:22:14 +0000 http://blogs.mathworks.com/steve/2008/09/29/dilation-algorithms-decomposing-more-shapes/#comment-21112 What I don't understand is, why some decomposed structuring elements are listed twice? What I don’t understand is, why some decomposed structuring elements are listed twice?

]]>