paper-with-me

Papers

Least square ellipsoid fitting using iterative orthogonal transformations

2017-04-17 · Amit Reza, Anand S. Sengupta

We describe a generalised method for ellipsoid fitting against a minimum set of data points. The proposed method is numerically stable and applies to a wide range of ellipsoidal shapes, including highly elongated and arbitrarily oriented ellipsoids. This new method also provides for the retrieval of rotational angle and length of semi-axes of the fitted ellipsoids accurately. We demonstrate the efficacy of this algorithm on simulated data sets and also indicate its potential use in gravitational wave data analysis.

📄 PDF Abstract BibTeX arXiv:1704.04877

Code (0)

등록된 구현이 없습니다.

Tasks

Retrieval

Similar Papers 제목 키워드 기반

Robust Ellipsoid-specific Fitting via Expectation Maximization

2021-10-26 · Zhao Mingyang, Jia Xiaohong, Ma Lei, Qiu Xinlin 외

Ellipsoid fitting is of general interest in machine vision, such as object detection and shape approximation. Most existing approaches rely on the least-squares fitting of quadrics, minimizing the algebraic or geometric …

Density Estimationobject-detectionObject Detection

Robust Ellipsoid Fitting Using Axial Distance and Combination

2023-04-02 · Min Han, Jiangming Kan, Gongping Yang, Xinghui Li

In random sample consensus (RANSAC), the problem of ellipsoid fitting can be formulated as a problem of minimization of point-to-model distance, which is realized by maximizing model score. Hence, the performance of elli…

Near-optimal fitting of ellipsoids to random points

2022-08-19 · Aaron Potechin, Paxton Turner, Prayaag Venkat, Alexander S. Wein

Given independent standard Gaussian points $v_1, \ldots, v_n$ in dimension $d$, for what values of $(n, d)$ does there exist with high probability an origin-symmetric ellipsoid that simultaneously passes through all of t…

Universality and sharp thresholds for ellipsoid fitting

2026-08-27 · Frederic Koehler, Youngtak Sohn arxiv

We establish a sharp phase transition for fitting random vectors by an ellipsoid. The random vectors have independent subgaussian coordinates with mean zero, variance one, and a common fourth moment, and the number of ve…

PRISM: Distribution-free Adaptive Computation of Matrix Functions for Accelerating Neural Network Training

2026-01-29 · Shenghao Yang, Zhichao Wang, Oleg Balabanov, N. Benjamin Erichson 외 arxiv

Matrix functions such as square root, inverse roots, and orthogonalization play a central role in preconditioned gradient methods for neural network training. This has motivated the development of iterative algorithms th…