Recognition of digital hyperplanes and level layers with forbidden points

Authors:
Laurent Provot;Yan Gerard
Affiliations:
Univ. Clermont 1, ISIT, Campus des Cézeaux, Aubière, France;Univ. Clermont 1, ISIT, Campus des Cézeaux, Aubière, France
Venue:
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Year:
2011

Citing 10
Cited 0

Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem

DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
An elementary algorithm for digital arc segmentation

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Digital planarity-A review

Discrete Applied Mathematics
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model

Image and Vision Computing
3D noisy discrete objects: Segmentation and application to smoothing

Pattern Recognition
An elementary digital plane recognition algorithm

Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
From digital plane segmentation to polyhedral representation

Proceedings of the 11th international conference on Theoretical foundations of computer vision
An efficient and quasi linear worst-case time algorithm for digital plane recognition

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Introduction to digital level layers

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a new problem of recognition of digital primitives - digital hyperplanes or level layers - arising in a new practical application of surface segmentation. Such problems are usually driven by a maximal thickness criterion which is not satisfactory for applications as soon as the dimension of the primitives becomes greater than 1. It is a good reason to introduce a more flexible approach where the set to recognize (whose points are called inliers) is given along with two other sets of outliers that should each remain on his own side of the primitive. We reduce this problem of recognition with outliers to the separation of three point clouds of Rd by two parallel hyperplanes and we provide a geometrical algorithm derived from the well-known GJK algorithm to solve the problem.