Robust method for finding sparse solutions to linear inverse problems using an L2 regularization
원문 초록
We analyzed the performance of a biologically inspired algorithm called the Corrected Projections Algorithm (CPA) when a sparseness constraint is required to unambiguously reconstruct an observed signal using atoms from an overcomplete dictionary. By changing the geometry of the estimation problem, CPA gives an analytical expression for a binary variable that indicates the presence or absence of a dictionary atom using an L2 regularizer. The regularized solution can be implemented using an efficient real-time Kalman-filter type of algorithm. The smoother L2 regularization of CPA makes it very robust to noise, and CPA outperforms other methods in identifying known atoms in the presence of strong novel atoms in the signal.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
DACN: Dual-Attention Convolutional Network for Hyperspectral Image Super-Resolution
WALINET: A water and lipid identification convolutional Neural Network for nuisance signal removal in 1H MR Spectroscopic Imaging
Monkeypox disease recognition model based on improved SE-InceptionV3
Convergence of a L2 regularized Policy Gradient Algorithm for the Multi Armed Bandit
Prevalidated ridge regression is a highly-efficient drop-in replacement for logistic regression for high-dimensional data
Gradient-based bilevel optimization for multi-penalty Ridge regression through matrix differential calculus
토론
이 논문과 연결된 포럼 글이 아직 없습니다.