IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
Linear segmentation of discrete curves into blurred segments
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
An elementary algorithm for digital line recognition in the general case
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
3D noisy discrete objects: Segmentation and application to smoothing
Pattern Recognition
Gift-wrapping based preimage computation algorithm
Pattern Recognition
Geometric feature estimators for noisy discrete surfaces
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Segmentation of noisy discrete surfaces
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
| Hi-index | 0.00 |
We introduce a new discrete primitive, the blurred piece of a discrete plane, which relies on the arithmetic definition of discrete planes It generalizes such planes, admitting that some points are missing and then permits to adapt to noisy discrete data Two recognition algorithms of such primitives are proposed: the first one is a geometrical algorithm and minimizes the Euclidean distance and the second one relies on linear programming and minimizes the vertical distance.