Skip to main navigation Skip to search Skip to main content

A Globally Stable LPNN Model for Sparse Approximation

  • Hao Wang
  • , Ruibin Feng
  • , Chi-Sing Leung*
  • , John Sum
  • , Anthony G. Constantinides
  • *Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

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 ℓ1-norm approximation or are with local convergence only, the proposed method avoids any approximation of the ℓ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. © 2021 IEEE. 
Original languageEnglish
Pages (from-to)5218-5226
JournalIEEE Transactions on Neural Networks and Learning Systems
Volume34
Issue number8
Online published30 Nov 2021
DOIs
Publication statusPublished - Aug 2023

Research Keywords

  • Approximation algorithms
  • Basis pursuit (BP)
  • Biological neural networks
  • Complexity theory
  • Convergence
  • Lagrange programming neural network (LPNN)
  • locally competitive algorithm (LCA)
  • Neurons
  • Optimization
  • projection theorem
  • sparse approximation
  • Steady-state

Fingerprint

Dive into the research topics of 'A Globally Stable LPNN Model for Sparse Approximation'. Together they form a unique fingerprint.

Cite this