Ellipse fitting via low-rank generalized multidimensional scaling matrix recovery
DOI10.1007/S11045-016-0452-XzbMath1451.68292OpenAlexW2519805523MaRDI QIDQ784511
Pengliang Li, H. C. So, Ding Liu, Guoyang Yu, Yuntao Wu, Weiren Kong, Junli Liang, Liansheng Sui
Publication date: 3 August 2020
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11045-016-0452-x
low ranknuclear norm minimizationalternating direction method of multiplier (ADMM)ellipse fitting algorithmgeneralized multidimensional scaling matrixGivens transformunknown auxiliary parameter (UAP)
Machine vision and scene understanding (68T45) Computational issues in computer and robotic vision (65D19)
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Fixed point and Bregman iterative methods for matrix rank minimization
- Modern multidimensional scaling: theory and applications
- Estimation of circle parameters by centroiding
- A Singular Value Thresholding Algorithm for Matrix Completion
- The dynamic generalized Hough transform: Its relationship to the probabilistic Hough transforms and an application to the concurrent detection of circles and ellipses
- A note on the least squares fitting of ellipses
- Shape reconstruction by genetic algorithms and artificial neural networks
- Iterative Concave Rank Approximation for Recovering Low-Rank Matrices
- Robust Ellipse Fitting Based on Sparse Combination of Data Points
- Least-squares fitting of circles and ellipses
- Least-squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola
This page was built for publication: Ellipse fitting via low-rank generalized multidimensional scaling matrix recovery