返回
Framework for Segmented threshold?0 gradient approximation based network for sparse signal recovery
DOI:10.1016/j.neunet.2023.03.005.png)
摘要
En 中文
Signal reconstruction from compressed sensed data need iterative methods since the sparse measure-ment matrix is analytically non invertible. The iterative thresholding and 0 pound function minimization are of special interest as these two operations provide sparse solution. However these methods need an inverse operation corresponding to the measurement matrix for estimating the reconstruction error. The pseudo-inverse of the measurement matrix is used in general for this purpose. Here a sparse signal recovery framework using an approximate inverse matrix Q and iterative segment thresholding of 0 pound and 1 pound norm with residue addition is presented. Two recovery algorithms are developed using this framework. The 0 pound based method is later developed to a basis function dictionary based network for sparse signal recovery. The proposed framework enables the users experiment with different inverse matrix to achieve better efficiency in sparse signal recovery and implement the algorithm in computationally efficient way.(c) 2023 Elsevier Ltd. All rights reserved.
Keyword:
Sparse recovery
Thresholding
? 0 norm minimization
Polynomial approximation
Basis function network
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
引用论文
Smoothing inertial neurodynamic approach for sparse signal reconstruction via Lp-norm minimization
NEURAL NETWORKS
IF6.3
RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction
NEURAL NETWORKS
IF6.3
Mass Spectrometric Studies at High Temperatures. IX. The Sublimation Pressure of Copper(II) Fluoride

