Robust Ellipse Fitting Based on Maximum Correntropy Criterion With Variable Center

• URL: http://arxiv.org/abs/2210.12915v1
• Date: Mon, 24 Oct 2022 01:59:22 GMT
• Title: Robust Ellipse Fitting Based on Maximum Correntropy Criterion With Variable Center
• Authors: Wei Wang, Gang Wang, Chenlong Hu, and K. C. Ho
• Abstract summary: We develop an ellipse fitting method that is robust to outliers based on conerenren. The proposed method is shown to have significantly better performance over the existing methods in both simulated data and real images.
• Score: 25.20786549560683
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The presence of outliers can significantly degrade the performance of ellipse fitting methods. We develop an ellipse fitting method that is robust to outliers based on the maximum correntropy criterion with variable center (MCC-VC), where a Laplacian kernel is used. For single ellipse fitting, we formulate a non-convex optimization problem to estimate the kernel bandwidth and center and divide it into two subproblems, each estimating one parameter. We design sufficiently accurate convex approximation to each subproblem such that computationally efficient closed-form solutions are obtained. The two subproblems are solved in an alternate manner until convergence is reached. We also investigate coupled ellipses fitting. While there exist multiple ellipses fitting methods that can be used for coupled ellipses fitting, we develop a couple ellipses fitting method by exploiting the special structure. Having unknown association between data points and ellipses, we introduce an association vector for each data point and formulate a non-convex mixed-integer optimization problem to estimate the data associations, which is approximately solved by relaxing it into a second-order cone program. Using the estimated data associations, we extend the proposed method to achieve the final coupled ellipses fitting. The proposed method is shown to have significantly better performance over the existing methods in both simulated data and real images.

Related papers

• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration [76.40993825836222]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration. The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• Registration of algebraic varieties using Riemannian optimization [0.0]
  We consider the problem of finding a transformation between two point clouds that represent the same object but are expressed in different coordinate systems. Our approach is not based on a point-to-point correspondence, matching every point in the source point cloud to a point in the target point cloud.
  arXiv  Detail & Related papers  (2024-01-16T18:47:38Z)
• Handbook on Leveraging Lines for Two-View Relative Pose Estimation [82.72686460985297]
  We propose an approach for estimating the relative pose between image pairs by jointly exploiting points, lines, and their coincidences in a hybrid manner. Our hybrid framework combines the advantages of all configurations, enabling robust and accurate estimation in challenging environments.
  arXiv  Detail & Related papers  (2023-09-27T21:43:04Z)
• Optimised Least Squares Approach for Accurate Polygon and Ellipse Fitting [0.0]
  The method is validated on synthetic and real-world data sets. The proposed method is a powerful tool for shape fitting in computer vision and geometry processing applications.
  arXiv  Detail & Related papers  (2023-07-13T02:31:06Z)
• Approximating a RUM from Distributions on k-Slates [88.32814292632675]
  We find a generalization-time algorithm that finds the RUM that best approximates the given distribution on average. Our theoretical result can also be made practical: we obtain a that is effective and scales to real-world datasets.
  arXiv  Detail & Related papers  (2023-05-22T17:43:34Z)
• Robust Ellipsoid-specific Fitting via Expectation Maximization [0.0]
  Ellipsoid fitting is of general interest in machine vision, such as object detection and shape approximation. We propose a novel and robust method for ellipsoid fitting in a noisy, outlier-contaminated 3D environment. Our method is ellipsoid-specific, parameter free, and more robust against noise, outliers, and the large axis ratio.
  arXiv  Detail & Related papers  (2021-10-26T00:43:02Z)
• Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets [85.71360365315128]
  In many applications, we need algorithms which can align partially overlapping point sets are invariant to the corresponding corresponding RPM algorithm. We first show that the objective is a cubic bound function. We then utilize the convex envelopes of trilinear and bilinear monomial transformations to derive its lower bound. We next develop a branch-and-bound (BnB) algorithm which only branches over the transformation variables and runs efficiently.
  arXiv  Detail & Related papers  (2021-01-19T04:24:23Z)
• Random extrapolation for primal-dual coordinate descent [61.55967255151027]
  We introduce a randomly extrapolated primal-dual coordinate descent method that adapts to sparsity of the data matrix and the favorable structures of the objective function. We show almost sure convergence of the sequence and optimal sublinear convergence rates for the primal-dual gap and objective values, in the general convex-concave case.
  arXiv  Detail & Related papers  (2020-07-13T17:39:35Z)
• Efficient Clustering for Stretched Mixtures: Landscape and Optimality [4.2111286819721485]
  This paper considers a canonical clustering problem where one receives unlabeled samples drawn from a balanced mixture of two elliptical distributions. We show that the non-optimal clustering function exhibits desirable geometric properties when the sample size exceeds some constant statistical objectives.
  arXiv  Detail & Related papers  (2020-03-22T17:57:07Z)
• Efficient and Robust Shape Correspondence via Sparsity-Enforced Quadratic Assignment [16.03666555216332]
  We introduce a novel local pairwise descriptor and then develop a simple, effective iterative method to solve the resulting quadratic assignment. Our pairwise descriptor is based on the stiffness and mass iteration matrix of finite element approximation of the Laplace-Beltrami differential operator. We use various experiments to show the efficiency, quality, and versatility of our method on large data sets, patches, and point clouds.
  arXiv  Detail & Related papers  (2020-03-19T10:56:16Z)
• MINA: Convex Mixed-Integer Programming for Non-Rigid Shape Alignment [77.38594866794429]
  convex mixed-integer programming formulation for non-rigid shape matching. We propose a novel shape deformation model based on an efficient low-dimensional discrete model.
  arXiv  Detail & Related papers  (2020-02-28T09:54:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.