A Globally Stable LPNN Model for Sparse Approximation

doi:10.1109/TNNLS.2021.3126730

A Globally Stable LPNN Model for Sparse Approximation

2023-08-01

5

PRE

AI

DOI：10.1109/TNNLS.2021.3126730

Original

Original request for help

Save

Abstract

En 中文

The objective of compressive sampling is to determine a sparse vector from an observation vector. This brief describes an analog neural method to achieve the objective. Unlike previous analog neural models which either resort to the l(1)-norm approximation or are with local convergence only, the proposed method avoids any approximation of the l(1)-norm term and is probably capable of leading to the optimum solution. Moreover, its computational complexity is lower than that of the other three comparison analog models. Simulation results show that the error performance of the proposed model is comparable to several state-of-the-art digital algorithms and analog models and that its convergence is faster than that of the comparison analog neural models.

Keywords:

Basis pursuit (BP)

Lagrange programming neural network (LPNN)

locally competitive algorithm (LCA)

projection theorem

sparse approximation

A Globally Stable LPNN Model for Sparse Approximation

Abstract

Journal

Organization