Discrete Combinatorial Surfaces
Graphical Models and Image Processing
On digital distance transforms in three dimensions
Computer Vision and Image Understanding
Recognizing arithmetic straight lines and planes
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Multigrid convergence and surface area estimation
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Geometric feature estimators for noisy discrete surfaces
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Scaling of plane figures that assures faithful digitization
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Segmentation of noisy discrete surfaces
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Discrete surfaces segmentation into discrete planes
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Recognition of blurred pieces of discrete planes
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Minimal decomposition of a digital surface into digital plane segments is NP-Hard
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Maximal planes and multiscale tangential cover of 3D digital objects
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Recognition of digital hyperplanes and level layers with forbidden points
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
| Hi-index | 0.01 |
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.