A mathematical morphology approach to Euclidean distance transformation

被引:66
|
作者
Shih, Frank Yeong-Chyang [1 ]
Mitchell, Owen Robert
机构
[1] New Jersey Inst Technol, Dept Comp & Informat Sci, Newark, NJ 07102 USA
[2] Univ Texas Arlington, Dept Elect Engn, Arlington, TX 76019 USA
关键词
morphology; image processing; gray scale morphology; distance transform; Euclidean distance; computer architecture;
D O I
10.1109/83.136596
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a distance transformation technique for a binary digital image using a gray scale mathematical morphology approach. A distance transformation converts a binary image which consists of object (foreground) and nonobject (background) pixels into an image where every object pixel has a value corresponding to the minimum distance from the background. The distance computation is, in fact, a global operation. Morphological erosion is an operation which selects the minimum value from the combination of an image and the predefined weighted structuring element within a window. Hence, mathematical morphology is the most appropriate approach to distance transformation. Applying well-developed decomposition properties of mathematical morphology, we can significantly reduce the tremendous cost of global operations to that of small neighborhood operations suitable for parallel pipelined computers. In the first part of this paper, the distance transformation using mathematical morphology is developed. In the second part, several approximations of the Euclidean distance are discussed. In the third part, 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.
引用
收藏
页码:197 / 204
页数:8
相关论文
共 50 条
  • [1] Fast multidimensional parallel Euclidean distance transform based on mathematical morphology
    Lotufo, RA
    Zampirolli, FA
    XIV BRAZILIAN SYMPOSIUM ON COMPUTER GRAPHICS AND IMAGE PROCESSING, PROCEEDINGS, 2001, : 100 - 105
  • [2] A deriving two-scan approach for exact Euclidean Distance transformation
    Shih, FY
    Wu, YT
    PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 825 - 828
  • [3] A parallel Euclidean distance transformation algorithm
    Embrechts, H
    Roose, D
    COMPUTER VISION AND IMAGE UNDERSTANDING, 1996, 63 (01) : 15 - 26
  • [4] An efficient algorithm for the Euclidean distance transformation
    Kato, T
    Hirata, T
    Saito, T
    Kise, K
    SYSTEMS AND COMPUTERS IN JAPAN, 1996, 27 (07) : 18 - 24
  • [5] Cellular architecture for Euclidean distance transformation
    Sudha, N
    Nandi, S
    Sridharan, K
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (05): : 335 - 342
  • [6] Parallel Euclidean distance transformation algorithm
    Katholieke Universiteit Leuven, Heverlee, Belgium
    CVIU Comput Vision Image Undersanding, 1 (15-26):
  • [7] Fast Exact Euclidean Distance (FEED) transformation
    Schouten, T
    van den Broek, E
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 3, 2004, : 594 - 597
  • [8] The efficient algorithms for achieving Euclidean distance transformation
    Shih, FY
    Wu, YT
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2004, 13 (08) : 1078 - 1091
  • [9] CONTINUOUS UTILITY - EUCLIDEAN DISTANCE APPROACH
    GLUSTOFF, E
    QUARTERLY JOURNAL OF ECONOMICS, 1975, 89 (03): : 512 - 517
  • [10] A EUCLIDEAN DISTANCE TRANSFORM USING GRAYSCALE MORPHOLOGY DECOMPOSITION
    HUANG, CT
    MITCHELL, OR
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1994, 16 (04) : 443 - 448