First order geometric distance (The Myth of Sampsonus)

BMVC 2006 - Proceedings of the British Machine Vision Conference 2006

Volumn , Issue , 2006, Pages 87-96

  Harker, Matthew ^a   O'Leary, Paul ^a  

^a UNIVERSITY OF LEOBEN   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER VISION;

COMPUTATIONAL EFFORT; FIRST ORDER; FIRST-ORDER APPROXIMATIONS; GEOMETRIC DISTANCES; LINGUISTIC DIFFERENCES; MAHALANOBIS DISTANCES; NUMERICAL TESTING; RELATIVE ERRORS;

GEOMETRY;

EID: 34447297071     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. S.J. Ahn, W. Rauh, and H.-J. Warnecke. Least-squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola. Pattern Recognition, 34:2283-2303, 2001.
2. D. Cox, J. Little, and D. O'Shea. Using Algebraic Geometry. Springer-Verlag, New York, Second edition, 2005.
3. W. Gander, G. Golub, and R. Strebel. Fitting of circles and ellipses least squares solution. Technical Report doc/tech-reports/1994/217.ps, ETH Zurich, Department Informatik, June 1994.
4. M. Harker and P. O'Leary. Using discriminants to derive direct polynomials in the Mahalanobis and Euclidean distances. Submitted to IEEE Trans. Pattern Analysis and Machine Intelligence, 2006.
5. R. Hartley and A. Zisserman. Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge, Second edition, 2003.
6. M. Minimair. MR: Macaulay Resultant Package for Maple, http://minimair.org/mr, 2005.
7. P.D. Sampson. Fitting conic sections to 'very scattered' data: An iterative refinement of the Bookstein algorithm. Computer Vision, Graphics, and Image Processing, 18:97-108, 1982.