The University of Southampton
University of Southampton Institutional Repository

Gradient pursuits

Gradient pursuits
Gradient pursuits
Sparse signal approximations have become a fundamental tool in signal processing with wide ranging applications from source separation to signal acquisition. The ever growing number of possible applications and in particular the ever increasing problem sizes now addressed lead to new challenges in terms of computational strategies and the development of fast and efficient algorithms has become paramount.
Recently, very fast algorithms have been developed to solve convex optimisation problems that are often used to approximate the sparse approximation problem, however, it has also been shown, that in certain circumstances, greedy strategies, such as Orthogonal Matching Pursuit, can have better performance than the convex methods.
In this paper improvements to greedy strategies are proposed and algorithms are developed that approximate Orthogonal Matching Pursuit with computational requirements more akin to Matching Pursuit. Three different directional optimisation schemes based on the gradient, the conjugate gradient and an approximation to the conjugate gradient are discussed respectively. It is shown that the conjugate gradient update leads to a novel implementation of Orthogonal Matching Pursuit, while the gradient based approach as well as the approximate conjugate gradient methods both lead to fast approximations to Orthogonal Matching Pursuit, with the approximate conjugate gradient method being superior to the gradient method.
sparse representations/approximations, matching pursuit, orthogonal matching pursuit, gradient optimisation, conjugate gradient optimisation
1053-587X
2370 -2382
Blumensath, T.
470d9055-0373-457e-bf80-4389f8ec4ead
Davies, M.E.
2f97d5ab-efda-4d6f-936d-00ae95d19e65
Blumensath, T.
470d9055-0373-457e-bf80-4389f8ec4ead
Davies, M.E.
2f97d5ab-efda-4d6f-936d-00ae95d19e65

Blumensath, T. and Davies, M.E. (2008) Gradient pursuits. IEEE Transactions on Signal Processing, 56 (6), 2370 -2382. (doi:10.1109/TSP.2007.916124).

Record type: Article

Abstract

Sparse signal approximations have become a fundamental tool in signal processing with wide ranging applications from source separation to signal acquisition. The ever growing number of possible applications and in particular the ever increasing problem sizes now addressed lead to new challenges in terms of computational strategies and the development of fast and efficient algorithms has become paramount.
Recently, very fast algorithms have been developed to solve convex optimisation problems that are often used to approximate the sparse approximation problem, however, it has also been shown, that in certain circumstances, greedy strategies, such as Orthogonal Matching Pursuit, can have better performance than the convex methods.
In this paper improvements to greedy strategies are proposed and algorithms are developed that approximate Orthogonal Matching Pursuit with computational requirements more akin to Matching Pursuit. Three different directional optimisation schemes based on the gradient, the conjugate gradient and an approximation to the conjugate gradient are discussed respectively. It is shown that the conjugate gradient update leads to a novel implementation of Orthogonal Matching Pursuit, while the gradient based approach as well as the approximate conjugate gradient methods both lead to fast approximations to Orthogonal Matching Pursuit, with the approximate conjugate gradient method being superior to the gradient method.

Text
BDGP07.pdf - Other
Restricted to Repository staff only
Request a copy

More information

Published date: June 2008
Keywords: sparse representations/approximations, matching pursuit, orthogonal matching pursuit, gradient optimisation, conjugate gradient optimisation
Organisations: Other, Signal Processing & Control Grp

Identifiers

Local EPrints ID: 142525
URI: http://eprints.soton.ac.uk/id/eprint/142525
ISSN: 1053-587X
PURE UUID: 50d713b9-1e89-4070-8e68-42789e718a35
ORCID for T. Blumensath: ORCID iD orcid.org/0000-0002-7489-265X

Catalogue record

Date deposited: 31 Mar 2010 15:21
Last modified: 14 Mar 2024 02:55

Export record

Altmetrics

Contributors

Author: T. Blumensath ORCID iD
Author: M.E. Davies

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×