Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A mathematical morphology approach to Euclidean distance transformation

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

2 Author(s)
Shih, F.Y.-C. ; Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA ; Mitchell, Owen Robert

A distance transformation technique for a binary digital image using a gray-scale mathematical morphology approach is presented. Applying well-developed decomposition properties of mathematical morphology, one can significantly reduce the tremendous cost of global operations to that of small neighborhood operations suitable for parallel pipelined computers. First, the distance transformation using mathematical morphology is developed. Then several approximations of the Euclidean distance are discussed. The decomposition of the Euclidean distance structuring element is presented. The decomposition technique employs a set of 3 by 3 gray scale morphological erosions with suitable weighted structuring elements and combines the outputs using the minimum operator. Real-valued distance transformations are considered during the processes and the result is approximated to the closest integer in the final output image

Published in:

Image Processing, IEEE Transactions on  (Volume:1 ,  Issue: 2 )