ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On Selection of Search Space Dimension in Compressive Sampling Matching Pursuit

Ambat, Sooraj K and Chatterjee, Saikat and Hari, KVS (2012) On Selection of Search Space Dimension in Compressive Sampling Matching Pursuit. In: IEEE Region 10 Conference (TENCON) - Sustainable Development through Humanitarian Technology, NOV 19-22, 2012 , Cebu, PHILIPPINES.

[img] PDF
TENCON_2012.pdf - Published Version
Restricted to Registered users only

Download (146Kb) | Request a copy
Official URL: http://dx.doi.org/10.1109/TENCON.2012.6412345

Abstract

Compressive Sampling Matching Pursuit (CoSaMP) is one of the popular greedy methods in the emerging field of Compressed Sensing (CS). In addition to the appealing empirical performance, CoSaMP has also splendid theoretical guarantees for convergence. In this paper, we propose a modification in CoSaMP to adaptively choose the dimension of search space in each iteration, using a threshold based approach. Using Monte Carlo simulations, we show that this modification improves the reconstruction capability of the CoSaMP algorithm in clean as well as noisy measurement cases. From empirical observations, we also propose an optimum value for the threshold to use in applications.

Item Type: Conference Proceedings
Related URLs:
Additional Information: Copyright for this article belongs to the IEEE USA.
Keywords: Compressed sensing; Sparse Recovery; Greedy Pursuit Algorithms
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 04 Apr 2013 10:02
Last Modified: 04 Apr 2013 10:02
URI: http://eprints.iisc.ernet.in/id/eprint/46339

Actions (login required)

View Item View Item