We propose in this paper a segmentation process that can deal with noisy discrete objects. A flexible approach considering arithmetic discrete planes with a variable width is used to avoid the over-segmentation that might happen when classical segmentation algorithms based on regular discrete planes are used to decompose the surface of the object. A method to choose a seed and different segmentation strategies according to the shape of the surface are also proposed. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Provot, L., & Debled-Rennesson, I. (2008). Segmentation of noisy discrete surfaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4958 LNCS, pp. 160–171). Springer Verlag. https://doi.org/10.1007/978-3-540-78275-9_14
Mendeley helps you to discover research relevant for your work.