.png){kind=icon}
返回
A Globally Stable LPNN Model for Sparse Approximation
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2021.3126730.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Basis pursuit (BP)
Lagrange programming neural network (LPNN)
locally competitive algorithm (LCA)
projection theorem
sparse approximation
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Low-dimensional recurrent neural network-based Kalman filter for speech enhancement.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏分享收藏Lanthanide-nota chelates as aqueous shift reagents: Interaction with cyclopropane carboxylic acid
PREAI
分享收藏Electron stimulated reduction of sapphire studied by electron energy loss and Auger spectroscopies
PREAI
分享收藏
查看更多内容