Fast and numerically stable circle fit
We develop a new algorithm for fitting circles that does not have drawbacks commonly found in existing circle fits. Our fit achieves ultimate accuracy (to machine precision), avoids divergence, and is numerically stable even when fitting circles get arbitrary large. Lastly, our algorithm takes less than 10 iterations to converge, on average.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Normalizing Flows on Tori and Spheres
Normalizing flows are a powerful tool for building expressive distributions in high dimensions. So far, most of the literature has concentrated on learning flows on Euclidean spaces. Some problems however, such as those …
Robust and Accurate Cylinder Triangulation
In this paper we present methods for triangulation of infinite cylinders from image line silhouettes. We show numerically that linear estimation of a general quadric surface is inherently a badly posed problem. Instead w…
A fast minimal solver for absolute camera pose with unknown focal length and radial distortion from four planar points
In this paper we present a fast minimal solver for absolute camera pose estimation from four known points that lie in a plane. We assume a perspective camera model with unknown focal length and unknown radial distortion.…
Camera Pose EstimationPose EstimationFast algorithm for Multiple-Circle detection on images using Learning Automata
Hough transform (HT) has been the most common method for circle detection exhibiting robustness but adversely demanding a considerable computational load and large storage. Alternative approaches include heuristic method…
Application and Evaluation of the Common Circles Method
We investigate the application of the common circle method for estimating sample motion in optical diffraction tomography (ODT) of sub-millimeter sized biological tissue. When samples are confined via contact-free acoust…
Motion Detection