What'S in a Set of Points?

N. Kiryati, A. M. Bruckstein

Research output: Contribution to journalArticlepeer-review

39 Scopus citations

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 tuned to be equivalent to well-known M estimators, thus allowing computationally efficient approximate M estimation.

Original languageEnglish
Pages (from-to)496-500
Number of pages5
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume14
Issue number4
DOIs
StatePublished - 1992
Externally publishedYes

Keywords

  • Hough transform
  • Mestimators
  • least sauares
  • line fitting
  • linear regression
  • robust regression

Fingerprint

Dive into the research topics of 'What'S in a Set of Points?'. Together they form a unique fingerprint.

Cite this