Sparse Signal Recovery via ECME Thresholding Pursuits
نویسندگان
چکیده
The emerging theory of compressive sensing CS provides a new sparse signal processing paradigm for reconstructing sparse signals from the undersampled linear measurements. Recently, numerous algorithms have been developed to solve convex optimization problems for CS sparse signal recovery. However, in some certain circumstances, greedy algorithms exhibit superior performance than convex methods. This paper is a followup to the recent paper of Wang and Yin 2010 , who refine BP reconstructions via iterative support detection ISD . The heuristic idea of ISD was applied to greedy algorithms. We developed two approaches for accelerating the ECME iteration. The described algorithms, named ECME thresholding pursuits EMTP , introduced two greedy strategies that each iteration detects a support set I by thresholding the result of the ECME iteration and estimates the reconstructed signal by solving a truncated least-squares problem on the support set I. Two effective support detection strategies are devised for the sparse signals with components having a fast decaying distribution of nonzero components. The experimental studies are presented to demonstrate that EMTP offers an appealing alternative to state-of-the-art algorithms for sparse signal recovery.
منابع مشابه
ECME Thresholding Methods for Sparse Signal Reconstruction
We propose a probabilistic framework for interpreting and developing hard thresholding sparse signal reconstruction methods and present several new algorithms based on this framework. The measurements follow an underdetermined linear model, where the regression-coefficient vector is the sum of an unknown deterministic sparse signal component and a zero-mean white Gaussian component with an unkn...
متن کاملECME hard thresholding methods for image reconstruction from compressive samples
We propose two hard thresholding schemes for image reconstruction from compressive samples. The measurements follow an underdetermined linear model, where the regression-coefficient vector is a sum of an unknown deterministic sparse signal component and a zero-mean white Gaussian component with an unknown variance. We derived an expectation-conditional maximization either (ECME) iteration that ...
متن کاملLiterature Review on Sparse Optimization
Some thoughts about algorithms for minimizing l and TV norms for signal and image recovery. In particular, I put the emphasis on the connections between Lagrangian and l constrained optimizations, and between analysis and synthesis priors. 1 Lagrangian and Constrained l1 Pursuits Lagrangian l pursuit reads ã = argmin b 1 2 ‖f − Φ∗b‖2 + T‖b‖1. (1) It is a Lagrangian formulation of the following ...
متن کاملFast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
A spectrally sparse signal of order r is a mixture of r damped or undamped complex sinusoids. This paper investigates the problem of reconstructing spectrally sparse signals from a random subset of n regular time domain samples, which can be reformulated as a low rank Hankel matrix completion problem. We introduce an iterative hard thresholding (IHT) algorithm and a fast iterative hard threshol...
متن کاملRandom Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogonal Matching Pursuit (OMP) and Thresholding. While recovery by Basis Pursuit has recently been studied by several authors, we provide theoretical results on the success probability of reconstruction via Thresholding and ...
متن کامل