Segmentation of noisy discrete surfaces

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free