The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1992 vol.14)
pp: 501
ABSTRACT
<p>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.</p>
CITATION
A.K. Jain, "Editor's Notice", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.14, no. 5, pp. 501, May 1992, doi:10.1109/TPAMI.1992.10002
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool