This paper presents a boundary-based, topological shape descriptor: the distance profile. It is inspired by the LBP (= local binary pattern) scale space – a topological shape descriptor computed by a filtration with concentric circles around a reference point. For rigid objects, the distance profile is computed by the Euclidean distance of each boundary pixel to a reference point. A geodesic distance profile is proposed for articulated or deformable shapes: the distance is measured by a combination of the Euclidean distance of each boundary pixel to the nearest pixel of the shape’s medial axis and the geodesic distance along the shape’s medial axis to the reference point. In contrast to the LBP scale space, it is invariant to deformations and articulations and the persistence of the extrema in the profiles allows pruning of spurious branches (i.e. robustness against noise on the boundary). The distance profiles are applicable to any shape, but the geodesic distance profile is especially well-suited for articulated or deformable objects (e.g.applications in biology).
CITATION STYLE
Janusch, I., Artner, N. M., & Kropatsch, W. G. (2017). Euclidean and geodesic distance profiles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10502 LNCS, pp. 307–318). Springer Verlag. https://doi.org/10.1007/978-3-319-66272-5_25
Mendeley helps you to discover research relevant for your work.