Robust ellipse fitting based on Lagrange programming neural network and locally competitive algorithm

doi:10.1016/j.neucom.2020.02.100

Robust ellipse fitting based on Lagrange programming neural network and locally competitive algorithm

2020-07-01

10

PRE

AI

DOI：10.1016/j.neucom.2020.02.100

Original

Original request for help

Save

Abstract

En 中文

Given a set of 2-dimensional (2D) scattering points, obtained from the edge detection process, the aim of ellipse fitting is to construct an elliptic equation that best fits the scattering points. However, the 2D scattering points may contain some outliers. To address this issue, we devise a robust ellipse fitting approach based on two analog neural network models, Lagrange programming neural network (LPNN) and locally competitive algorithm (LCA). We formulate the fitting task as a nonsmooth constrained optimization problem, in which the objective function is an approximated l(0)-norm term. As the LPNN model cannot handle non-differentiable functions, we utilize the internal state concept of LCA to avoid the computation of the derivative at non-differentiable points. Simulation results show that the proposed ellipse fitting approach is superior to several state-of-the-art algorithms. (c) 2020 Elsevier B.V. All rights reserved.

Keywords:

Ellipse fitting

Outlier

Real-time solution

Lagrange programming neural network (LPNN)

Locally competitive algorithm (LCA)

Robust ellipse fitting based on Lagrange programming neural network and locally competitive algorithm

Abstract

Journal

Organization