Direct least squares fitting of ellipses:

Abstract: "This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b²=1 the new method incorporates the ellipticity co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Fitzgibbon, Andrew W. (VerfasserIn), Pilu, Maurizio (VerfasserIn), Fisher, Robert B. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Edinburgh 1996
Schriftenreihe:University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 794
Schlagworte:
Zusammenfassung:Abstract: "This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b²=1 the new method incorporates the ellipticity constraint into the normalization factor. The new method combines several advantages: (i) It is ellipse-specific so that even bad data will always return an ellipse; (ii) It can be solved naturally by a generalized eigensystem and (iii) it is extremely robust, efficient and easy to implement. We compare the proposed method to other approaches and show its robustness on several examples in which other non-ellipse-specific approaches would fail or require computationally expensive iterative refinements. Source code for the algorithm is supplied and a demonstration is available on http://www.dai.ed.ac.uk/groups/mvu/ellipse-demo.html"
Beschreibung:15 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!