By Topic

Recursive implementation of erosions and dilations along discrete lines at arbitrary angles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Soille, P. ; Lab. de Genie Inf. et d''Ingenierie de Production, Ecole des Mines d''Ales, Nimes, France ; Breen, E.J. ; Jones, R.

Van Herk (1992) has shown that the erosion/dilation operator with a linear structuring element of an arbitrary length can be implemented in only three min/max operations per pixel. In this paper, the algorithm is generalized to erosions and dilations along discrete lines at arbitrary angles. We also address the padding problem; so that the operation can be performed in place without copying the pixels to and from an intermediate buffer. Applications to image filtering and to radial decompositions of discs are presented

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:18 ,  Issue: 5 )