A note on the least squares fitting of ellipses
Pattern Recognition Letters
Randomized Hough transform (RHT): basic mechanisms, algorithms, and computational complexities
CVGIP: Image Understanding
Matching 3-D anatomical surfaces with non-rigid deformations using octree-splines
International Journal of Computer Vision
Direct Least Square Fitting of Ellipses
IEEE Transactions on Pattern Analysis and Machine Intelligence
Head Detection and Tracking by 2-D and 3-D Ellipsoid Fitting
CGI '00 Proceedings of the International Conference on Computer Graphics
Contour Profiling by Dynamic Ellipse Fitting
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
An iterative approach for fitting multiple connected ellipse structure to silhouette
Pattern Recognition Letters
Hi-index | 0.01 |
In this paper, we seek to fit a model, specified in terms of connected ellipses, to an image silhouette. Some algorithms that have attempted this problem are sensitive to initial guesses and also may converge to a wrong solution when they attempt to minimize the objective function for the entire ellipse structure in one step. We present an algorithm that overcomes these issues. Our first step is to temporarily ignore the connections, and refine the initial guess using unconstrained Expectation-Maximization (EM) for mixture Gaussian densities. Then the ellipses are reconnected linearly. Lastly, we apply the Levenberg-Marquardt algorithm to fine-tune the ellipse shapes to best align with the contour. The fitting is achieved in a hierarchical manner based upon the joints of the model. Experiments show that our algorithm can robustly fit a complex ellipse structure to a corresponding shape for several applications.