Circle location from intensity and range data using the singular value decomposition

Describes a circle location in three-dimensional space from a single view by fusing intensity and range data gained by stereo cameras as a part of our robotic disassembling project. An effective nonlinear "outlier" filtering and a linear 3D-circle estimation are briefly presented. The circle estimation is divided into two linear least-squares problems generalized for modeling higher dimensional data of what we call a "hypercircle". The singular value decomposition is intensively used for most computations throughout the paper.

[1]  Yiu-Tong Chan,et al.  A simple approach for the estimation of circular arc center and its radius , 1989, Comput. Vis. Graph. Image Process..

[2]  G. W. Stewart,et al.  On the Early History of the Singular Value Decomposition , 1993, SIAM Rev..

[3]  Svetha Venkatesh,et al.  Dynamic Threshold Determination by Local and Global Edge Evaluation , 1995, CVGIP Graph. Model. Image Process..

[4]  Philip E. Gill,et al.  Numerical Linear Algebra and Optimization , 1991 .

[5]  John Porrill.  Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filter , 1990, Image Vis. Comput..

[6]  K. Kanatani.  3D recovery of polyhedra by rectangularity heuristics , 1989, International Workshop on Industrial Applications of Machine Intelligence and Vision,.

[7]  P. Dewilde,et al.  Singular value decomposition: an introduction , 1989 .

[8]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Kenichi Kanatani,et al.  Geometric computation for machine vision , 1993 .

[10]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.