Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
532658 | Pattern Recognition | 2009 | 11 Pages |
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 is also proposed, as well as an application to smooth the border of convex noisy discrete objects.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
L. Provot, I. Debled-Rennesson,