• Publication
  • 2007
  • Issue No. 3 - March
  • Abstract - Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension
March 2007 (vol. 29 no. 3)
pp. 437-448
In binary images, the Distance Transformation (DT) and the geometrical skeleton extraction are classic tools for shape analysis. In this paper, we present time optimal algorithms to solve the reverse Euclidean distance transformation and the reversible medial axis extraction problems for d-dimensional images. We also present a d-dimensional medial axis filtering process that allows us to control the quality of the reconstructed shape.
Index Terms:
Shape representation, distance transformation, reverse Euclidean distance transformation, medial axis extraction, d--dimensional shapes.
Citation:
David Coeurjolly, Annick Montanvert, "Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 3, pp. 437-448, March 2007, doi:10.1109/TPAMI.2007.54
Usage of this product signifies your acceptance of the Terms of Use.