Abstract
Discrete Curve Evolution (DCE) algorithm is used to eliminate objects’ contour distortions while at the same time preserve the perceptual appearance at a level sufficient for object recognition. This method is widely used for shape similarity measure, skeleton pruning and salient point detection of binary objects on a regular 2D grid. Our paper aims at describing a new DCE algorithm for an arbitrary triangulated 3D mesh. The difficulty lies in the calculation of a vertex cost function for an object contour, as on a 3D surface the notion of Euclidean distance cannot be used. It is also very difficult to compute a geodesic angle between lines connecting vertices. We introduce a new cost function for border vertex which is only based on geodesic distances. We apply the proposed algorithm on vertex sets to compute an approximation of original contours, extract salient points and prune skeletons. The experimental results justify the robustness of our method with respect to noise distortions.
Chapter PDF
Similar content being viewed by others
References
Kudelski, D., Viseur, S., Mari, J.-L.: Skeleton extraction of vertex sets lying on arbitrary triangulated 3D meshes. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 203–214. Springer, Heidelberg (2013)
Rossl, C., Kobbelt, L., Seidel, H.P.: Extraction of feature lines on triangulated surfaces using morphological operators. In: AAAI Spring Symposium on Smart Graphics, vol. 00-04, pp. 71-75 (March 2000)
Bai, X., Latecki, L.J., Liu, W.-Y.: Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(3), 449–462 (2007)
Blum, H.: Biological Shape and Visual Science (Part I). J. Theoretical Biology 38, 205–287 (1973)
Latecki, L.J., Lakämper, R.: Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution. Computer Vision and Image Understanding (CVIU) 73, 441–454 (1999)
Latecki, L.J., Lakämper, R.: Polygon evolution by vertex deletion. In: Nielsen, M., Johansen, P., Fogh Olsen, O., Weickert, J. (eds.) Scale-Space 1999. LNCS, vol. 1682, pp. 398–409. Springer, Heidelberg (1999)
Latecki, L.J., Lakamper, R.: Shape similarity measure based on correspondence of visual parts. IEEE Trans. Pattern Analysis and Machine Intelligence (PAMI) 22(10), 1185–1190 (2000)
Kimmel, R., Sethian, J.A.: Computing Geodesic Paths on Manifolds. Proceedings of the National Academy of Sciences of the United States of America 95(15), 8431–8435 (1998)
Sethian, J.A.: Level Set Methods: Evolving Interfaces in Geometry, Fluid Mechanics, Computer Vision and Materials Sciences. Cambridge University Press (1996)
Yang, X., Bai, X., Yang, X., Zeng, L.: An Efficient Quick Algorithm for Computing Stable Skeletons. In: Congress on Image and Signal Processing (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Poltaretskyi, S., Chaoui, J., Hamitouche-Djabou, C. (2014). Discrete Curve Evolution on Arbitrary Triangulated 3D Mesh. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2014. Lecture Notes in Computer Science, vol 8668. Springer, Cham. https://doi.org/10.1007/978-3-319-09955-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-09955-2_34
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09954-5
Online ISBN: 978-3-319-09955-2
eBook Packages: Computer ScienceComputer Science (R0)