Analysis of a low memory implementation of the Orthogonal Matching Pursuit greedy strategy

08/31/2016
by   Laura Rebollo-Neira, et al.
0

The convergence and numerical analysis of a low memory implementation of the Orthogonal Matching Pursuit greedy strategy, which is termed Self Projected Matching Pursuit, is presented. This approach provides an iterative way of solving the least squares problem with much less storage requirement than direct linear algebra techniques. Hence, it is appropriate for solving large linear systems. Furthermore, the low memory requirement of the method suits it for massive parallelization, via Graphics Processing Unit, to tackle systems which can be broken into a large number of subsystems of much smaller dimension.

READ FULL TEXT
research
09/12/2012

Sparse Representation of Astronomical Images

Sparse representation of astronomical images is discussed. It is shown t...
research
10/25/2018

Sparse approximation of multivariate functions from small datasets via weighted orthogonal matching pursuit

We show the potential of greedy recovery strategies for the sparse appro...
research
10/03/2010

Convolutional Matching Pursuit and Dictionary Training

Matching pursuit and K-SVD is demonstrated in the translation invariant ...
research
02/20/2019

Orthogonal Matching Pursuit with Tikhonov and Landweber Regularization

The Orthogonal Matching Pursuit (OMP) for compressed sensing iterates ov...
research
02/21/2017

A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe

Two of the most fundamental prototypes of greedy optimization are the ma...
research
02/16/2022

Fast Matching Pursuit with Multi-Gabor Dictionaries

Finding the best K-sparse approximation of a signal in a redundant dicti...
research
07/12/2018

Orthogonal Matching Pursuit for Text Classification

In text classification, the problem of overfitting arises due to the hig...

Please sign up or login with your details

Forgot password? Click here to reset