scispace - formally typeset
Journal ArticleDOI

Sparse Representation Using Stepwise Tikhonov Regularization With Offline Computations

Ramon A. Delgado, +1 more
- 01 Apr 2019 - 
- Vol. 26, Iss: 6, pp 873-877
TLDR
A novel algorithm for sparse reconstruction that relies on the recently proposed stepwise Tikhonov regularization (STIR) method to implement forward selection procedures such as Orthogonal least squares, orthogonal matching pursuit, and STIR.
Abstract
This letter describes a novel algorithm for sparse reconstruction. The method uses offline computations to reduce the computational burden of online execution. The approach relies on the recently proposed stepwise Tikhonov regularization (STIR) method to implement forward selection procedures such as orthogonal least squares (OLS), orthogonal matching pursuit (OMP), and STIR. Numerical simulations show the efficacy of the proposed approach, which is competitive against state-of-the-art implementation of OLS and OMP.

read more

References
More filters
Journal ArticleDOI

Regression Shrinkage and Selection via the Lasso

TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Journal ArticleDOI

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

TL;DR: In this paper, the authors considered the model problem of reconstructing an object from incomplete frequency samples and showed that with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the lscr/sub 1/ minimization problem.
Journal ArticleDOI

Atomic Decomposition by Basis Pursuit

TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
Journal ArticleDOI

Robust Face Recognition via Sparse Representation

TL;DR: This work considers the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise, and proposes a general classification algorithm for (image-based) object recognition based on a sparse representation computed by C1-minimization.
Journal ArticleDOI

Matching pursuits with time-frequency dictionaries

TL;DR: The authors introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions, chosen in order to best match the signal structures.
Related Papers (5)