Constraint Removal for Sparse Signal Recovery
Loading...
Files
Date
Authors
Özen, Serdar
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
BRONZE
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
This paper presents a new iterative algorithm called constraint removal (CR) for the recovery of a sparse signal x from an incomplete number of linear measurements y such that ym× 1= Am× nxn× 1 and m<n. It is empirically demonstrated that the CR algorithm has a recovery performance which is between basis pursuit linear programming (BP-LP) and subspace pursuit (SP) for both zero-one and Gaussian type signals.
Description
Keywords
Compressed sensing, Greedy pursuit, Sparse recovery, Underdetermined system, Signal reconstruction, Sparse recovery, Compressed sensing, Greedy pursuit, Underdetermined system, Signal reconstruction
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences
Citation
Şahin, A. and Özen, S. (2012). Constraint removal for sparse signal recovery. Signal Processing, 92(4), 1172-1175. doi:10.1016/j.sigpro.2011.11.014
WoS Q
Scopus Q
OpenCitations Citation Count
2
Source
Volume
92
Issue
4
Start Page
1172
End Page
1175
PlumX Metrics
Citations
CrossRef : 2
Scopus : 4
Captures
Mendeley Readers : 8
SCOPUS™ Citations
4
checked on Apr 27, 2026
Web of Science™ Citations
2
checked on Apr 27, 2026
Page Views
870
checked on Apr 27, 2026
Downloads
397
checked on Apr 27, 2026
Google Scholar™
