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 March 2007

Abstract

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.

Type

Journal article

Publication

IEEE Transactions on Pattern Analysis and Machine Intelligence

Caption: Results of medial axis extraction on 3D objects: The first row presents the input binary shapes, the second one shows the Sk sets, and the last one shows the RDMA points.

@article{dcoeurjo_pami_RDMA,
      author = {Coeurjolly, David and Montanvert, Annick},
      doi = {10.1109/TPAMI.2007.54},
      journal = {IEEE Transactions on Pattern Analysis and Machine
Intelligence},
      month = {March},
      number = {3},
      pages = {437-448},
      title = {Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension},
      volume = {29},
      year = {2007}
}