What's in a set of points? [straight line fitting]
Kiryati, N.
Bruckstein, A.M.
Technion, Haifa;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Apr 1992
Volume: 14,
Issue: 4
On page(s): 496-500
ISSN: 0162-8828
References Cited: 20
CODEN: ITPIDJ
INSPEC Accession Number: 4166332
Digital Object Identifier: 10.1109/34.126810
Current Version Published: 2002-08-06
Abstract
The problem of fitting a straight line to a planar set of points
is reconsidered. A parameter space computational approach capable of
fitting one or more lines to a set of points is presented. The suggested
algorithm handles errors in both coordinates of the data points, even
when the error variances vary between coordinates and among points and
can be readily made robust to outliers. The algorithm is quite general
and allows line fitting according to several useful optimality criteria
to be performed within a single computational framework. It is observed
that certain extensions of the Hough transform can be turned to be
equivalent to well-known M estimators, thus allowing
computationally efficient approximate M estimation
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
