• DocumentCode
    1377779
  • Title

    Fast 2-D Distance Transformations

  • Author

    Krinidis, Stelios

  • Author_Institution
    Dept. of Inf. Manage., Technol. Inst. of Kavala, Kavala, Greece
  • Volume
    21
  • Issue
    4
  • fYear
    2012
  • fDate
    4/1/2012 12:00:00 AM
  • Firstpage
    2178
  • Lastpage
    2186
  • Abstract
    The performance of a number of image processing methods depends on the output quality of a distance transformation (DT) process. Most of the fast DT methodologies are not accurate, whereas other error-free DT algorithms are not very fast. In this paper, a novel, fast, simple, and error-free DT algorithm is presented. By recording the relative x- and y-coordinates of the examined image pixels, an optimal algorithm can be developed to achieve the DT of an image correctly and efficiently in constant time without any iteration. Furthermore, the proposed method is general since it can be used by any kind of distance function, leading to accurate image DTs.
  • Keywords
    image processing; distance function; error-free DT algorithms; fast 2D distance transformation process; image processing methods; x-coordinates recording; y-coordinate recording; Approximation algorithms; Complexity theory; Computers; Euclidean distance; Image processing; Transforms; Vectors; Distance transformation (DT); Euclidean DT; Euclidean distance; image processing; object representation; Algorithms; Image Enhancement; Image Interpretation, Computer-Assisted; Reproducibility of Results; Sensitivity and Specificity;
  • fLanguage
    English
  • Journal_Title
    Image Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1057-7149
  • Type

    jour

  • DOI
    10.1109/TIP.2011.2176343
  • Filename
    6082440