Result: On the detection of robust curves

Title:
On the detection of robust curves
Authors:
Source:
CVGIP. Graphical models and image processing. 56(3):189-204
Publisher Information:
Boston, MA; New York, NY; San Diego, CA: Academic Press, 1994.
Publication Year:
1994
Physical Description:
print, 32 ref
Original Material:
INIST-CNRS
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
New York univ., courant inst., New York NY 10012, United States
ISSN:
1049-9652
Rights:
Copyright 1994 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4188368
Database:
PASCAL Archive

Further Information

Given m points in the plane and a threshold t, a curve is defined to be robust if at least t points lie of it. Efficient algorithms for detecting robust curves are given; the key contribution is to use randomized sampling. In addition, an approximation version of the problem is introduced. A kinethic solution to this problem is given; it too can be enhanced by randomization. These algorithms are readily generalized to solve the problem of robust curve detection in a scene of curve fragments: given a set of curve segments, a curve σ is defined to be robust if curve segment of total length at least l lie on σ.