University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A greedy algorithm with learned statistics for sparse signal reconstruction

Rencker, L, Wang, W and Plumbley, MD (2017) A greedy algorithm with learned statistics for sparse signal reconstruction In: The 42nd IEEE International Conference on Acoustics, Speech and Signal Processing ICASSP 2017, 2017-03-05 - 2017-03-09, New Orleans, USA.

[img]
Preview
Text
Greedy_algorithm_with_learned_statistics.pdf - Accepted version Manuscript
Available under License : See the attached licence file.

Download (187kB) | Preview
[img]
Preview
PDF (licence)
SRI_deposit_agreement.pdf
Available under License : See the attached licence file.

Download (33kB) | Preview

Abstract

We address the problem of sparse signal reconstruction from a few noisy samples. Recently, a Covariance-Assisted Matching Pursuit (CAMP) algorithm has been proposed, improving the sparse coefficient update step of the classic Orthogonal Matching Pursuit (OMP) algorithm. CAMP allows the a-priori mean and covariance of the non-zero coefficients to be considered in the coefficient update step. In this paper, we analyze CAMP, which leads to a new interpretation of the update step as a maximum-a-posteriori (MAP) estimation of the non-zero coefficients at each step. We then propose to leverage this idea, by finding a MAP estimate of the sparse reconstruction problem, in a greedy OMP-like way. Our approach allows the statistical dependencies between sparse coefficients to be modelled, while keeping the practicality of OMP. Experiments show improved performance when reconstructing the signal from a few noisy samples.

Item Type: Conference or Workshop Item (Conference Poster)
Subjects : Electronic Engineering
Divisions : Faculty of Engineering and Physical Sciences > Electronic Engineering
Authors :
AuthorsEmailORCID
Rencker, LUNSPECIFIEDUNSPECIFIED
Wang, WUNSPECIFIEDUNSPECIFIED
Plumbley, MDUNSPECIFIEDUNSPECIFIED
Date : 2017
Funders : EPSRC
Copyright Disclaimer : © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Contributors :
ContributionNameEmailORCID
UNSPECIFIEDIEEE, UNSPECIFIEDUNSPECIFIED
Uncontrolled Keywords : Sparse representations, signal reconstruction, inpainting, Orthogonal Matching Pursuit
Related URLs :
Depositing User : Symplectic Elements
Date Deposited : 10 Feb 2017 18:40
Last Modified : 17 Feb 2017 14:52
URI: http://epubs.surrey.ac.uk/id/eprint/813519

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800