Pre-weighted Matching Pursuit Algorithms for Sparse Recovery
|
|
- Thomasina Underwood
- 6 years ago
- Views:
Transcription
1 Journal of Information & Computational Science 11:9 (214) June 1, 214 Available at Pre-weighted Matching Pursuit Algorithms for Sparse Recovery Jingfei He, Guiling Sun, Jie Zuo, Mengqiu Fan College of Electronic Information and Optical Engineering, Nankai University, Tianjin 371, China Abstract This paper presents a novel pre-weighted method for the matching pursuit algorithms, termed the Preweighted Matching Pursuit (PwMP) algorithm. The weighted measurement vector is obtained through the pre-weighted process to measurement matrix. PwMP recovers the weighted sparse signal by the weighted measurement vector and unweighted sensing matrix. At last, we get the sparse signal via weighted removal. It is empirically demonstrated that the PwMP algorithm outperforms many existing reconstruction algorithms for both zero-one and Gaussian type signals. Keywords: Compressed Sensing; Reconstruction Algorithm; Pre-weighted; Matching Pursuit 1 Introduction In Compressed Sensing (CS) theory [1], we assume that f is a discrete-time signal of dimension N, which can be represented as a sparse linear combination f = Ψx. Here, x is a K-sparse signal of dimension N, Ψ represents an N N sparse matrix. Sparse signal x has at most K nonzero entries. The measurement vector y can be obtained via y = Φf, where Φ represents an M N measurement matrix with M < N. CS combines signal sampling and data compression together through sampling data in a compressed form. The signal f or, what is equivalent, the vector x can be recovered through the linear system of equations y = ΦΨx = Φx. (1) Here, Φ = ΦΨ represents the sensing matrix. However, (1) is underdetermined and has infinitely many solutions. The straightforward way to find the sparsest signal is solving an l minimization problem [2] which can be represented as: min x s.t. Φx = y. (2) Project supported by the National Nature Science Foundation of China (No ) and Doctoral Program Foundation of Institutions of Higher Education of China (No ). Corresponding author. address: hejingfei@mail.nankai.edu.cn (Jingfei He) / Copyright 214 Binary Information Press DOI: /jics213758
2 2934 J. He et al. / Journal of Information & Computational Science 11:9 (214) Unfortunately, the above l minimization problem is NP-hard, and hence solving it requires combinatorial optimization and is impractical. It is equivalent to use minimal l 1 norm representation instead of the l minimization in some sense [3], such as Basis Pursuit (BP) [4]: min x 1 s.t. Φx = y. (3) It is a convex optimization problem that can be solved efficiently by Linear Programming (LP) techniques. However, this kind of algorithms is associated with fairly heavy computationally burdens and cannot be used for practical applications. Recently, another popular class of sparse recovery algorithms called matching pursuit algorithms has received more and more attention due to their simple and rapid computation. Such as Orthogonal Matching Pursuit (OMP) [5], Compressive Sampling Matching Pursuit (CoSaMP) [6], Subspace Pursuit (SP) [7], and the Sparsity Adaptive Matching Pursuit (SAMP) [8]. These algorithms perform well for Gaussian signals, but the effect is not as good as the LP method for zero-one signals. This paper presents a novel pre-weighted method for the matching pursuit algorithms, termed the Pre-weighted Matching Pursuit (PwMP) algorithm. Through the pre-weighted process to measurement matrix, PwMP outperforms many existing reconstruction algorithms for both zero-one and Gaussian type signals. 2 The Proposal of Pre-weighted Method Since x is a K-sparse signal in (1), only less than or equal to K columns of Φ participate in the measurement vector y. The main idea behind OMP algorithm is to pick those columns in a greedy fashion. At each iteration, OMP chooses the column of Φ that is most strongly correlated with the remaining part of y (the residual), then removes its contribution to y and calculates the new residual. After limited iterations, OMP will identify the correct set of columns. OMP also gains the advantage of less computational cost. Then the latter algorithms, such as CoSaMP and SP, adopt the idea of backtracking. That is, an index can be added to or removed from the estimated support set at any stage in the recovery process. Afterwards, SAMP adjusts the step length in each stage to gradually achieve the sparsity K for the sparsity is always unknown in practical applications. Unfortunately, since the zero-one type signals represent a particularly challenging case for matching pursuit algorithms, these algorithms performances are not very ideal for this type signals. Matching pursuit algorithms judge the correlativity between the column of Φ and the remaining part of y based on their inner product value. However, all nonzero entries in zeroone signals have the same magnitude. In this case, it is difficult to identify the correct set of columns for matching pursuit algorithms. Thus, considering if it is possible to make a weight to the nonzero entries in the sparse signal x, then we can improve the reconstruction accuracy of matching pursuit algorithms for zero-one signals. However, the vector x, equivalent to the signal f, cannot be weighted directly. It is therefore crucial to solve this problem with a novel pre-weighted method. 3 The PwMP Algorithm 3.1 Algorithm Description The proposed pre-weighted method for the matching pursuit algorithms, illustrated in Fig. 1,
3 J. He et al. / Journal of Information & Computational Science 11:9 (214) f Measurement weight_y=weight_φf weight_φ=φ(ψqψ 1 ) weight_y ~ Φ=ΦΨ Reconstruction min weight_x 1 s.t. ~ Φweight_x=weight_y weight_x f Sparse representation f=ψx x ~ Weighted removal x=q ~ 1 weight_x Fig. 1: Schematic representation of the PwMP algorithm makes a weight to the sparse signal in a disguised form. First, pre-weight the measurement matrix Φ via weight Φ = Φ(ΨQΨ 1 ). (4) Here, Q is an N N diagonal matrix called weighting matrix whose diagonal entries are nonzero with different magnitudes. The spare matrix Ψ should be nonsingular. Then the weighted measurement vector weight y is given by weight y = weight Φf. (5) Afterwards, the weighted sparse signal weight x can be recovered by the weighted measurement vector weight y and unweighted sensing matrix Φ. Finally, we obtain the recovered sparse signal ˆx via weighted removal. 3.2 Definition of the Algorithm Algorithm 1. The pre-weighted matching pursuit algorithm Sparse representation: f = Ψx; Encoding measurement: the weighted measurement matrix weight Φ = Φ(ΨQΨ 1 ), the weighted measurement vector weight y = weight Φf; Reconstruction algorithm: input: weight y, sensing matrix Φ. Initialization: weight x =, residual r = weight y, supporting sets F =, the stopping threshold T, step size s = 1, supporting sets L = s, k = 1. Step-1: P k = {L k 1 indices corresponding to the largest entries in the vector Φ T r k 1 }. Step-2: Candidate sets C k = F k 1 P k, F = {L k 1 indices corresponding to the largest entries in the vector Φ C k weight y}, Φ C k denotes the pseudo-inverse of the matrix Φ Ck. Step-3: r k = weight y Φ F Φ F weight y. Step-4: If r k T (the halting criterion [6, 9]) end iterations and execute step-6, else if r k 2 r k 1 2, L k = L k
4 2936 J. He et al. / Journal of Information & Computational Science 11:9 (214) Step-5: F k = F, k = k + 1 and go to step-1. Step-6: weight x F = Φ F weight y, weight x {1,,N} F =, ˆx = Q 1 weight x. Output: the reconstruction signal ˆf = Ψˆx. 3.3 Theoretical Analysis In PwMP algorithm, the weighted measurement vector weight y can be obtained via (5), f = Ψx is the signal of interest. Using the identities in (4), (5) is equivalent to weight y = Φ(ΨQΨ 1 )Ψx=ΦΨQx. (6) As we know, ΦΨ = Φ is the sensing matrix, Qx = weight x is the weighted sparse signal. Thus, (6) can be cast as a linear system of equations weight y = Φweight x (7) In order to get weight x, we should also solve an l 1 minimization problem min weight x 1 s.t. Φweight x = weight y (8) Based on the main idea of the matching pursuit algorithms, inheriting the sparsity adaptive [8] and the backtracking idea [6, 7], we reconstruct weight x with the weighted measurement vector weight y and unweighted sensing matrix Φ. Then we remove weight to weight x via ˆx = Q 1 weight x = Q 1 Qx. Here, we get the recovered sparse signal ˆx of the sparse signal x. At last, the reconstruction signal f can be obtained via ˆf = Ψˆx. The objective of the present study is to realize making a weight to the nonzero entries in the sparse signal with pre-weighting the measurement matrix. Therefore, when the sparse signal is zero-one signal or in which the nonzero entries have similar magnitudes, after using the preweighted method, the true sparse signal in the reconstruction algorithm has different magnitudes nonzero entries. And this has the advantage of identifying the correct set of columns for matching pursuit algorithms. 4 Empirical Results and Analysis In this section, based on the simulation platform, we compare the simulation results of the proposed PwMP with OMP, SP, CoSaMP, SAMP, and LP method for both zero-one and Gaussian type signals. We also observe the performance of PwMP in different compression ratios (N/M) for these two type signals. 4.1 Experiment 1 In this experiment, the signals of interests are zero-one or Gaussian sparse signals with length of N = 124. Φ is a normally distributed random matrix with the number of measurements
5 J. He et al. / Journal of Information & Computational Science 11:9 (214) M = 128. Setting the signal sparsity K {1, 15, 2, 25, 3, 35, 4, 45, 5}. For each sparsity level, 5 simulations are conducted. The remaining parameters in the experiment are kept at a specification of T = 1 3, Q = diag (1, 2,..., N), and ε = ˆx x / x. ε is the parameter to judge whether the reconstruction is successful or not. We define the reconstruction is successful when ε 1 3. The success rates of each algorithm for zero-one type signals are shown in Fig. 2. The numerical values on the x-axis denote the sparsity level K, while the numerical values on the y-axis represent the success rate of reconstruction. The compression ratio is constant, i.e., M, N value is fixed, with the increase in the sparsity value, the success rate of each algorithm is reduced. As can be seen, OMP, SP, CoSaMP, and SAMP are worse than the LP method for zero-one signals. However, the PwMP algorithm significantly outperforms the LP method. The simulation results reveal that the pre-weighted method can improve the matching pursuit algorithms on the reconstruction for zero-one signals..2 OMP SP CoSaMP SAMP LP PwMP Signal sparsity K Fig. 2: The success rates of each algorithm for zero-one type signals Through pre-weighting the measurement matrix, PwMP algorithm realizes weighting the sparse signal in a disguised form. Consequently, the nonzero entries have different magnitudes and it is beneficial to improve recovery quality for matching pursuit algorithms. PwMP has superiority in reconstruction for not only zero-one type signals, but also the Gaussian type signals. As shown in Fig. 3, the signals of interest are Gaussian sparse signals. And for Gaussian sparse signals, performances of the matching pursuit algorithms far exceed that for zero-one signals. Again, we can see PwMP algorithm has significantly higher success rate than OMP, SP, CoSaMP, SAMP, and LP method. 4.2 Experiment 2 The length of sparse signals of interest is fixed with N = 124 and the number of measurements M {512, 256, 128, 64, 32}. The corresponding compression ratios are 2:1, 4:1, 8:1, 16:1, and 32:1. For each value of M, we set the sparsity K {[.1M], [.2M], [M], [M], [M]}. The other experimental settings are unchanged. Fig. 4 and Fig. 5 demonstrate the results of PwMP
6 2938 J. He et al. / Journal of Information & Computational Science 11:9 (214) OMP SP CoSaMP SAMP.1 LP PwMP Signal sparsity K Fig. 3: The success rates of each algorithm for Gaussian type signals.2.1 N:M=2:1 N:M=4:1 N:M=8:1 N:M=16:1 N:M=32:1.1.2 K/M Fig. 4: The success rates of PwMP for zero-one type signals under different compression ratios algorithm for zero-one sparse signals and Gaussian sparse signals under different compression ratios, respectively. Simulation results show that while sparsity K is constant, with the increase in the compression ratio N/M, the success rate is reduced. Also when the compression ratio is fixed, the higher the sparsity value is, the lower the success rate becomes. For different types of interest sparse signals, the reconstruction effect of PwMP for Gaussian signals is better than that for zero-one signals. 5 Conclusion To overcome the drawbacks of matching pursuit algorithms for zero-one type sparse signals reconstruction, we introduced a new algorithm, called the pre-weighted matching pursuit algorithm,
7 J. He et al. / Journal of Information & Computational Science 11:9 (214) N:M=2:1.2 N:M=4:1 N:M=8:1.1 N:M=16:1 N:M=32:1.1.2 K/M Fig. 5: The success rates of PwMP for Gaussian type signals under different compression ratios for realization of weighting the sparse signal in a disguised form. Through pre-weighting the measurement matrix, PwMP algorithm realizes weighting the sparse signal. Therefore, The nonzero entries in the sparse signal have different magnitudes and it is beneficial to be recovered by matching pursuit algorithm. The simulation results demonstrate that PwMP algorithm has significant advantages in reconstruction for both zero-one and Gaussian type sparse signals. References [1] D. L. Donoho, Compressed sensing, IEEE Trans. on Information Theory, 52(4), 26, [2] E. J. Candés, J. Romberg, T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. on Information Theory, 52(2), 26, [3] D. L. Donoho, For most large underdetermined systems of linear equations the minimal l 1 -norm solution is also the sparsest solution, Communications on Pure and Applied Mathematics, 59(6), 26, [4] S. S. Chen, D. L. Donoho, M. A. Saunders, Atomic decomposition by basis pursuit, SIAM Journal on Scientific Computing, 2(1), 1998, [5] J. A. Tropp, A. C. Gilbert, Signal recovery from random measurements via orthogonal matching pursuit, IEEE Trans. on Information Theory, 53(12), 27, [6] D. Needell, J. A. Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Applied and Computational Harmonic Analysis, 26(3), 29, [7] W. Dai, O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction, IEEE Trans. on Information Theory, 55(5), 29, [8] T. T. Do, L. Gan, N. Nguyen, T. D. Tran, Sparsity adaptive matching pursuit algorithm for practical compressed sensing, in: Conference Record - Asilomar Conference on Signals, Systems and Computers, 28, [9] G. L. Sun, Y. Zhang, L. Q. Lv, W. X. Li, Research on iterative thresholding matching pursuit based on adaptive sparsity, Journal of Computational Information Systems, 7(1), 211, 34-41
Generalized Orthogonal Matching Pursuit- A Review and Some
Generalized Orthogonal Matching Pursuit- A Review and Some New Results Department of Electronics and Electrical Communication Engineering Indian Institute of Technology, Kharagpur, INDIA Table of Contents
More informationGREEDY SIGNAL RECOVERY REVIEW
GREEDY SIGNAL RECOVERY REVIEW DEANNA NEEDELL, JOEL A. TROPP, ROMAN VERSHYNIN Abstract. The two major approaches to sparse recovery are L 1-minimization and greedy methods. Recently, Needell and Vershynin
More informationMultipath Matching Pursuit
Multipath Matching Pursuit Submitted to IEEE trans. on Information theory Authors: S. Kwon, J. Wang, and B. Shim Presenter: Hwanchol Jang Multipath is investigated rather than a single path for a greedy
More informationRandomness-in-Structured Ensembles for Compressed Sensing of Images
Randomness-in-Structured Ensembles for Compressed Sensing of Images Abdolreza Abdolhosseini Moghadam Dep. of Electrical and Computer Engineering Michigan State University Email: abdolhos@msu.edu Hayder
More informationof Orthogonal Matching Pursuit
A Sharp Restricted Isometry Constant Bound of Orthogonal Matching Pursuit Qun Mo arxiv:50.0708v [cs.it] 8 Jan 205 Abstract We shall show that if the restricted isometry constant (RIC) δ s+ (A) of the measurement
More informationCoSaMP: Greedy Signal Recovery and Uniform Uncertainty Principles
CoSaMP: Greedy Signal Recovery and Uniform Uncertainty Principles SIAM Student Research Conference Deanna Needell Joint work with Roman Vershynin and Joel Tropp UC Davis, May 2008 CoSaMP: Greedy Signal
More informationSignal Recovery From Incomplete and Inaccurate Measurements via Regularized Orthogonal Matching Pursuit
Signal Recovery From Incomplete and Inaccurate Measurements via Regularized Orthogonal Matching Pursuit Deanna Needell and Roman Vershynin Abstract We demonstrate a simple greedy algorithm that can reliably
More informationRecovery of Sparse Signals Using Multiple Orthogonal Least Squares
Recovery of Sparse Signals Using Multiple Orthogonal east Squares Jian Wang, Ping i Department of Statistics and Biostatistics arxiv:40.505v [stat.me] 9 Oct 04 Department of Computer Science Rutgers University
More informationGreedy Signal Recovery and Uniform Uncertainty Principles
Greedy Signal Recovery and Uniform Uncertainty Principles SPIE - IE 2008 Deanna Needell Joint work with Roman Vershynin UC Davis, January 2008 Greedy Signal Recovery and Uniform Uncertainty Principles
More informationThresholds for the Recovery of Sparse Solutions via L1 Minimization
Thresholds for the Recovery of Sparse Solutions via L Minimization David L. Donoho Department of Statistics Stanford University 39 Serra Mall, Sequoia Hall Stanford, CA 9435-465 Email: donoho@stanford.edu
More informationUniform Uncertainty Principle and signal recovery via Regularized Orthogonal Matching Pursuit
Uniform Uncertainty Principle and signal recovery via Regularized Orthogonal Matching Pursuit arxiv:0707.4203v2 [math.na] 14 Aug 2007 Deanna Needell Department of Mathematics University of California,
More informationNew Coherence and RIP Analysis for Weak. Orthogonal Matching Pursuit
New Coherence and RIP Analysis for Wea 1 Orthogonal Matching Pursuit Mingrui Yang, Member, IEEE, and Fran de Hoog arxiv:1405.3354v1 [cs.it] 14 May 2014 Abstract In this paper we define a new coherence
More informationA new method on deterministic construction of the measurement matrix in compressed sensing
A new method on deterministic construction of the measurement matrix in compressed sensing Qun Mo 1 arxiv:1503.01250v1 [cs.it] 4 Mar 2015 Abstract Construction on the measurement matrix A is a central
More informationIntroduction to Compressed Sensing
Introduction to Compressed Sensing Alejandro Parada, Gonzalo Arce University of Delaware August 25, 2016 Motivation: Classical Sampling 1 Motivation: Classical Sampling Issues Some applications Radar Spectral
More informationRobust Sparse Recovery via Non-Convex Optimization
Robust Sparse Recovery via Non-Convex Optimization Laming Chen and Yuantao Gu Department of Electronic Engineering, Tsinghua University Homepage: http://gu.ee.tsinghua.edu.cn/ Email: gyt@tsinghua.edu.cn
More informationModel-Based Compressive Sensing for Signal Ensembles. Marco F. Duarte Volkan Cevher Richard G. Baraniuk
Model-Based Compressive Sensing for Signal Ensembles Marco F. Duarte Volkan Cevher Richard G. Baraniuk Concise Signal Structure Sparse signal: only K out of N coordinates nonzero model: union of K-dimensional
More informationSolution-recovery in l 1 -norm for non-square linear systems: deterministic conditions and open questions
Solution-recovery in l 1 -norm for non-square linear systems: deterministic conditions and open questions Yin Zhang Technical Report TR05-06 Department of Computational and Applied Mathematics Rice University,
More informationCoSaMP. Iterative signal recovery from incomplete and inaccurate samples. Joel A. Tropp
CoSaMP Iterative signal recovery from incomplete and inaccurate samples Joel A. Tropp Applied & Computational Mathematics California Institute of Technology jtropp@acm.caltech.edu Joint with D. Needell
More informationGradient Descent with Sparsification: An iterative algorithm for sparse recovery with restricted isometry property
: An iterative algorithm for sparse recovery with restricted isometry property Rahul Garg grahul@us.ibm.com Rohit Khandekar rohitk@us.ibm.com IBM T. J. Watson Research Center, 0 Kitchawan Road, Route 34,
More informationExact Topology Identification of Large-Scale Interconnected Dynamical Systems from Compressive Observations
Exact Topology Identification of arge-scale Interconnected Dynamical Systems from Compressive Observations Borhan M Sanandaji, Tyrone Vincent, and Michael B Wakin Abstract In this paper, we consider the
More informationL-statistics based Modification of Reconstruction Algorithms for Compressive Sensing in the Presence of Impulse Noise
L-statistics based Modification of Reconstruction Algorithms for Compressive Sensing in the Presence of Impulse Noise Srdjan Stanković, Irena Orović and Moeness Amin 1 Abstract- A modification of standard
More informationInverse problems and sparse models (1/2) Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France
Inverse problems and sparse models (1/2) Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France remi.gribonval@inria.fr Structure of the tutorial Session 1: Introduction to inverse problems & sparse
More informationc 2011 International Press Vol. 18, No. 1, pp , March DENNIS TREDE
METHODS AND APPLICATIONS OF ANALYSIS. c 2011 International Press Vol. 18, No. 1, pp. 105 110, March 2011 007 EXACT SUPPORT RECOVERY FOR LINEAR INVERSE PROBLEMS WITH SPARSITY CONSTRAINTS DENNIS TREDE Abstract.
More informationSubspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity
Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity Wei Dai and Olgica Milenkovic Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign
More informationCompressed sensing. Or: the equation Ax = b, revisited. Terence Tao. Mahler Lecture Series. University of California, Los Angeles
Or: the equation Ax = b, revisited University of California, Los Angeles Mahler Lecture Series Acquiring signals Many types of real-world signals (e.g. sound, images, video) can be viewed as an n-dimensional
More informationAn Introduction to Sparse Approximation
An Introduction to Sparse Approximation Anna C. Gilbert Department of Mathematics University of Michigan Basic image/signal/data compression: transform coding Approximate signals sparsely Compress images,
More informationSimultaneous Sparsity
Simultaneous Sparsity Joel A. Tropp Anna C. Gilbert Martin J. Strauss {jtropp annacg martinjs}@umich.edu Department of Mathematics The University of Michigan 1 Simple Sparse Approximation Work in the d-dimensional,
More informationIEEE SIGNAL PROCESSING LETTERS, VOL. 22, NO. 9, SEPTEMBER
IEEE SIGNAL PROCESSING LETTERS, VOL. 22, NO. 9, SEPTEMBER 2015 1239 Preconditioning for Underdetermined Linear Systems with Sparse Solutions Evaggelia Tsiligianni, StudentMember,IEEE, Lisimachos P. Kondi,
More informationCompressive Sensing and Beyond
Compressive Sensing and Beyond Sohail Bahmani Gerorgia Tech. Signal Processing Compressed Sensing Signal Models Classics: bandlimited The Sampling Theorem Any signal with bandwidth B can be recovered
More informationIntroduction How it works Theory behind Compressed Sensing. Compressed Sensing. Huichao Xue. CS3750 Fall 2011
Compressed Sensing Huichao Xue CS3750 Fall 2011 Table of Contents Introduction From News Reports Abstract Definition How it works A review of L 1 norm The Algorithm Backgrounds for underdetermined linear
More informationSparse Vector Distributions and Recovery from Compressed Sensing
Sparse Vector Distributions and Recovery from Compressed Sensing Bob L. Sturm Department of Architecture, Design and Media Technology, Aalborg University Copenhagen, Lautrupvang 5, 275 Ballerup, Denmark
More informationOrthogonal Matching Pursuit for Sparse Signal Recovery With Noise
Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published
More informationUniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Claremont Colleges Scholarship @ Claremont CMC Faculty Publications and Research CMC Faculty Scholarship 6-5-2008 Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
More informationMATCHING PURSUIT WITH STOCHASTIC SELECTION
2th European Signal Processing Conference (EUSIPCO 22) Bucharest, Romania, August 27-3, 22 MATCHING PURSUIT WITH STOCHASTIC SELECTION Thomas Peel, Valentin Emiya, Liva Ralaivola Aix-Marseille Université
More informationSensing systems limited by constraints: physical size, time, cost, energy
Rebecca Willett Sensing systems limited by constraints: physical size, time, cost, energy Reduce the number of measurements needed for reconstruction Higher accuracy data subject to constraints Original
More informationNear Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing
Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas M.Vidyasagar@utdallas.edu www.utdallas.edu/ m.vidyasagar
More informationSPARSE signal representations have gained popularity in recent
6958 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 10, OCTOBER 2011 Blind Compressed Sensing Sivan Gleichman and Yonina C. Eldar, Senior Member, IEEE Abstract The fundamental principle underlying
More informationObservability of a Linear System Under Sparsity Constraints
2372 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 58, NO 9, SEPTEMBER 2013 Observability of a Linear System Under Sparsity Constraints Wei Dai and Serdar Yüksel Abstract Consider an -dimensional linear
More informationCOMPARATIVE ANALYSIS OF ORTHOGONAL MATCHING PURSUIT AND LEAST ANGLE REGRESSION
COMPARATIVE ANALYSIS OF ORTHOGONAL MATCHING PURSUIT AND LEAST ANGLE REGRESSION By Mazin Abdulrasool Hameed A THESIS Submitted to Michigan State University in partial fulfillment of the requirements for
More informationAN OVERVIEW OF ROBUST COMPRESSIVE SENSING OF SPARSE SIGNALS IN IMPULSIVE NOISE
AN OVERVIEW OF ROBUST COMPRESSIVE SENSING OF SPARSE SIGNALS IN IMPULSIVE NOISE Ana B. Ramirez, Rafael E. Carrillo, Gonzalo Arce, Kenneth E. Barner and Brian Sadler Universidad Industrial de Santander,
More informationA Review of Sparsity-Based Methods for Analysing Radar Returns from Helicopter Rotor Blades
A Review of Sparsity-Based Methods for Analysing Radar Returns from Helicopter Rotor Blades Ngoc Hung Nguyen 1, Hai-Tan Tran 2, Kutluyıl Doğançay 1 and Rocco Melino 2 1 University of South Australia 2
More informationNoisy Signal Recovery via Iterative Reweighted L1-Minimization
Noisy Signal Recovery via Iterative Reweighted L1-Minimization Deanna Needell UC Davis / Stanford University Asilomar SSC, November 2009 Problem Background Setup 1 Suppose x is an unknown signal in R d.
More informationImproved algorithm based on modulated wideband converter for multiband signal reconstruction
Jia et al EURASIP Journal on Wireless Communications and Networking (2016) 2016:50 DOI 101186/s13638-016-0547-y RESEARCH Open Access Improved algorithm based on modulated wideband converter for multiband
More informationGreedy Sparsity-Constrained Optimization
Greedy Sparsity-Constrained Optimization Sohail Bahmani, Petros Boufounos, and Bhiksha Raj 3 sbahmani@andrew.cmu.edu petrosb@merl.com 3 bhiksha@cs.cmu.edu Department of Electrical and Computer Engineering,
More informationRecovery of Sparse Signals Using Multiple Orthogonal Least Squares
Recovery of Sparse Signals Using Multiple Orthogonal east Squares Jian Wang and Ping i Department of Statistics and Biostatistics, Department of Computer Science Rutgers, The State University of New Jersey
More informationStochastic geometry and random matrix theory in CS
Stochastic geometry and random matrix theory in CS IPAM: numerical methods for continuous optimization University of Edinburgh Joint with Bah, Blanchard, Cartis, and Donoho Encoder Decoder pair - Encoder/Decoder
More informationSparse Solutions of an Undetermined Linear System
1 Sparse Solutions of an Undetermined Linear System Maddullah Almerdasy New York University Tandon School of Engineering arxiv:1702.07096v1 [math.oc] 23 Feb 2017 Abstract This work proposes a research
More informationORTHOGONAL matching pursuit (OMP) is the canonical
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 9, SEPTEMBER 2010 4395 Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property Mark A. Davenport, Member, IEEE, and Michael
More informationSparsity in Underdetermined Systems
Sparsity in Underdetermined Systems Department of Statistics Stanford University August 19, 2005 Classical Linear Regression Problem X n y p n 1 > Given predictors and response, y Xβ ε = + ε N( 0, σ 2
More informationSparse analysis Lecture V: From Sparse Approximation to Sparse Signal Recovery
Sparse analysis Lecture V: From Sparse Approximation to Sparse Signal Recovery Anna C. Gilbert Department of Mathematics University of Michigan Connection between... Sparse Approximation and Compressed
More informationSparse Solutions of Systems of Equations and Sparse Modelling of Signals and Images
Sparse Solutions of Systems of Equations and Sparse Modelling of Signals and Images Alfredo Nava-Tudela ant@umd.edu John J. Benedetto Department of Mathematics jjb@umd.edu Abstract In this project we are
More informationIterative Hard Thresholding for Compressed Sensing
Iterative Hard Thresholding for Compressed Sensing Thomas lumensath and Mike E. Davies 1 Abstract arxiv:0805.0510v1 [cs.it] 5 May 2008 Compressed sensing is a technique to sample compressible signals below
More informationSignal Recovery from Permuted Observations
EE381V Course Project Signal Recovery from Permuted Observations 1 Problem Shanshan Wu (sw33323) May 8th, 2015 We start with the following problem: let s R n be an unknown n-dimensional real-valued signal,
More informationLarge-Scale L1-Related Minimization in Compressive Sensing and Beyond
Large-Scale L1-Related Minimization in Compressive Sensing and Beyond Yin Zhang Department of Computational and Applied Mathematics Rice University, Houston, Texas, U.S.A. Arizona State University March
More informationBlock-sparse Solutions using Kernel Block RIP and its Application to Group Lasso
Block-sparse Solutions using Kernel Block RIP and its Application to Group Lasso Rahul Garg IBM T.J. Watson research center grahul@us.ibm.com Rohit Khandekar IBM T.J. Watson research center rohitk@us.ibm.com
More informationPHASE TRANSITION OF JOINT-SPARSE RECOVERY FROM MULTIPLE MEASUREMENTS VIA CONVEX OPTIMIZATION
PHASE TRASITIO OF JOIT-SPARSE RECOVERY FROM MUTIPE MEASUREMETS VIA COVEX OPTIMIZATIO Shih-Wei Hu,, Gang-Xuan in, Sung-Hsien Hsieh, and Chun-Shien u Institute of Information Science, Academia Sinica, Taipei,
More informationCompressed Sensing and Linear Codes over Real Numbers
Compressed Sensing and Linear Codes over Real Numbers Henry D. Pfister (joint with Fan Zhang) Texas A&M University College Station Information Theory and Applications Workshop UC San Diego January 31st,
More informationCompressed Sensing and Redundant Dictionaries
Compressed Sensing and Redundant Dictionaries Holger Rauhut, Karin Schnass and Pierre Vandergheynst December 2, 2006 Abstract This article extends the concept of compressed sensing to signals that are
More informationCompressed Sensing and Related Learning Problems
Compressed Sensing and Related Learning Problems Yingzhen Li Dept. of Mathematics, Sun Yat-sen University Advisor: Prof. Haizhang Zhang Advisor: Prof. Haizhang Zhang 1 / Overview Overview Background Compressed
More informationStability and Robustness of Weak Orthogonal Matching Pursuits
Stability and Robustness of Weak Orthogonal Matching Pursuits Simon Foucart, Drexel University Abstract A recent result establishing, under restricted isometry conditions, the success of sparse recovery
More informationOn Sparsity, Redundancy and Quality of Frame Representations
On Sparsity, Redundancy and Quality of Frame Representations Mehmet Açaaya Division of Engineering and Applied Sciences Harvard University Cambridge, MA Email: acaaya@fasharvardedu Vahid Taroh Division
More informationNew Applications of Sparse Methods in Physics. Ra Inta, Centre for Gravitational Physics, The Australian National University
New Applications of Sparse Methods in Physics Ra Inta, Centre for Gravitational Physics, The Australian National University 2 Sparse methods A vector is S-sparse if it has at most S non-zero coefficients.
More informationExponential decay of reconstruction error from binary measurements of sparse signals
Exponential decay of reconstruction error from binary measurements of sparse signals Deanna Needell Joint work with R. Baraniuk, S. Foucart, Y. Plan, and M. Wootters Outline Introduction Mathematical Formulation
More informationReconstruction from Anisotropic Random Measurements
Reconstruction from Anisotropic Random Measurements Mark Rudelson and Shuheng Zhou The University of Michigan, Ann Arbor Coding, Complexity, and Sparsity Workshop, 013 Ann Arbor, Michigan August 7, 013
More informationSparse Solutions of Linear Systems of Equations and Sparse Modeling of Signals and Images: Final Presentation
Sparse Solutions of Linear Systems of Equations and Sparse Modeling of Signals and Images: Final Presentation Alfredo Nava-Tudela John J. Benedetto, advisor 5/10/11 AMSC 663/664 1 Problem Let A be an n
More informationPHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION. A Thesis MELTEM APAYDIN
PHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION A Thesis by MELTEM APAYDIN Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the
More informationAnalysis of Greedy Algorithms
Analysis of Greedy Algorithms Jiahui Shen Florida State University Oct.26th Outline Introduction Regularity condition Analysis on orthogonal matching pursuit Analysis on forward-backward greedy algorithm
More informationCOMPRESSED SENSING IN PYTHON
COMPRESSED SENSING IN PYTHON Sercan Yıldız syildiz@samsi.info February 27, 2017 OUTLINE A BRIEF INTRODUCTION TO COMPRESSED SENSING A BRIEF INTRODUCTION TO CVXOPT EXAMPLES A Brief Introduction to Compressed
More informationError Correction via Linear Programming
Error Correction via Linear Programming Emmanuel Candes and Terence Tao Applied and Computational Mathematics, Caltech, Pasadena, CA 91125 Department of Mathematics, University of California, Los Angeles,
More informationThe Pros and Cons of Compressive Sensing
The Pros and Cons of Compressive Sensing Mark A. Davenport Stanford University Department of Statistics Compressive Sensing Replace samples with general linear measurements measurements sampled signal
More informationRobust multichannel sparse recovery
Robust multichannel sparse recovery Esa Ollila Department of Signal Processing and Acoustics Aalto University, Finland SUPELEC, Feb 4th, 2015 1 Introduction 2 Nonparametric sparse recovery 3 Simulation
More informationStopping Condition for Greedy Block Sparse Signal Recovery
Stopping Condition for Greedy Block Sparse Signal Recovery Yu Luo, Ronggui Xie, Huarui Yin, and Weidong Wang Department of Electronics Engineering and Information Science, University of Science and Technology
More informationThe Sparsest Solution of Underdetermined Linear System by l q minimization for 0 < q 1
The Sparsest Solution of Underdetermined Linear System by l q minimization for 0 < q 1 Simon Foucart Department of Mathematics Vanderbilt University Nashville, TN 3784. Ming-Jun Lai Department of Mathematics,
More informationAbstract This paper is about the efficient solution of large-scale compressed sensing problems.
Noname manuscript No. (will be inserted by the editor) Optimization for Compressed Sensing: New Insights and Alternatives Robert Vanderbei and Han Liu and Lie Wang Received: date / Accepted: date Abstract
More informationElaine T. Hale, Wotao Yin, Yin Zhang
, Wotao Yin, Yin Zhang Department of Computational and Applied Mathematics Rice University McMaster University, ICCOPT II-MOPTA 2007 August 13, 2007 1 with Noise 2 3 4 1 with Noise 2 3 4 1 with Noise 2
More informationCompressed Sensing with Very Sparse Gaussian Random Projections
Compressed Sensing with Very Sparse Gaussian Random Projections arxiv:408.504v stat.me] Aug 04 Ping Li Department of Statistics and Biostatistics Department of Computer Science Rutgers University Piscataway,
More informationComplementary Matching Pursuit Algorithms for Sparse Approximation
Complementary Matching Pursuit Algorithms for Sparse Approximation Gagan Rath and Christine Guillemot IRISA-INRIA, Campus de Beaulieu 35042 Rennes, France phone: +33.2.99.84.75.26 fax: +33.2.99.84.71.71
More informationSparse Solutions of Linear Systems of Equations and Sparse Modeling of Signals and Images!
Sparse Solutions of Linear Systems of Equations and Sparse Modeling of Signals and Images! Alfredo Nava-Tudela John J. Benedetto, advisor 1 Happy birthday Lucía! 2 Outline - Problem: Find sparse solutions
More informationExact Low-rank Matrix Recovery via Nonconvex M p -Minimization
Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization Lingchen Kong and Naihua Xiu Department of Applied Mathematics, Beijing Jiaotong University, Beijing, 100044, People s Republic of China E-mail:
More informationStrengthened Sobolev inequalities for a random subspace of functions
Strengthened Sobolev inequalities for a random subspace of functions Rachel Ward University of Texas at Austin April 2013 2 Discrete Sobolev inequalities Proposition (Sobolev inequality for discrete images)
More informationEquivalence Probability and Sparsity of Two Sparse Solutions in Sparse Representation
IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 19, NO. 12, DECEMBER 2008 2009 Equivalence Probability and Sparsity of Two Sparse Solutions in Sparse Representation Yuanqing Li, Member, IEEE, Andrzej Cichocki,
More informationAN INTRODUCTION TO COMPRESSIVE SENSING
AN INTRODUCTION TO COMPRESSIVE SENSING Rodrigo B. Platte School of Mathematical and Statistical Sciences APM/EEE598 Reverse Engineering of Complex Dynamical Networks OUTLINE 1 INTRODUCTION 2 INCOHERENCE
More informationEfficient Inverse Cholesky Factorization for Alamouti Matrices in G-STBC and Alamouti-like Matrices in OMP
Efficient Inverse Cholesky Factorization for Alamouti Matrices in G-STBC and Alamouti-like Matrices in OMP Hufei Zhu, Ganghua Yang Communications Technology Laboratory Huawei Technologies Co Ltd, P R China
More informationRecent Developments in Compressed Sensing
Recent Developments in Compressed Sensing M. Vidyasagar Distinguished Professor, IIT Hyderabad m.vidyasagar@iith.ac.in, www.iith.ac.in/ m vidyasagar/ ISL Seminar, Stanford University, 19 April 2018 Outline
More informationA Greedy Search Algorithm with Tree Pruning for Sparse Signal Recovery
A Greedy Search Algorithm with Tree Pruning for Sparse Signal Recovery Jaeseok Lee, Suhyuk Kwon, and Byonghyo Shim Information System Laboratory School of Infonnation and Communications, Korea University
More informationSigma Delta Quantization for Compressed Sensing
Sigma Delta Quantization for Compressed Sensing C. Sinan Güntürk, 1 Mark Lammers, 2 Alex Powell, 3 Rayan Saab, 4 Özgür Yılmaz 4 1 Courant Institute of Mathematical Sciences, New York University, NY, USA.
More informationUncertainty principles and sparse approximation
Uncertainty principles and sparse approximation In this lecture, we will consider the special case where the dictionary Ψ is composed of a pair of orthobases. We will see that our ability to find a sparse
More informationMachine Learning for Signal Processing Sparse and Overcomplete Representations. Bhiksha Raj (slides from Sourish Chaudhuri) Oct 22, 2013
Machine Learning for Signal Processing Sparse and Overcomplete Representations Bhiksha Raj (slides from Sourish Chaudhuri) Oct 22, 2013 1 Key Topics in this Lecture Basics Component-based representations
More informationCompressed Sensing with Shannon-Kotel nikov Mapping in the Presence of Noise
19th European Signal Processing Conference (EUSIPCO 011) Barcelona, Spain, August 9 - September, 011 Compressed Sensing with Shannon-Kotel nikov Mapping in the Presence of Noise Ahmad Abou Saleh, Wai-Yip
More informationRecent developments on sparse representation
Recent developments on sparse representation Zeng Tieyong Department of Mathematics, Hong Kong Baptist University Email: zeng@hkbu.edu.hk Hong Kong Baptist University Dec. 8, 2008 First Previous Next Last
More informationA NEW FRAMEWORK FOR DESIGNING INCOHERENT SPARSIFYING DICTIONARIES
A NEW FRAMEWORK FOR DESIGNING INCOERENT SPARSIFYING DICTIONARIES Gang Li, Zhihui Zhu, 2 uang Bai, 3 and Aihua Yu 3 School of Automation & EE, Zhejiang Univ. of Sci. & Tech., angzhou, Zhejiang, P.R. China
More informationA New Estimate of Restricted Isometry Constants for Sparse Solutions
A New Estimate of Restricted Isometry Constants for Sparse Solutions Ming-Jun Lai and Louis Y. Liu January 12, 211 Abstract We show that as long as the restricted isometry constant δ 2k < 1/2, there exist
More informationMachine Learning for Signal Processing Sparse and Overcomplete Representations
Machine Learning for Signal Processing Sparse and Overcomplete Representations Abelino Jimenez (slides from Bhiksha Raj and Sourish Chaudhuri) Oct 1, 217 1 So far Weights Data Basis Data Independent ICA
More informationParticle Filtered Modified-CS (PaFiMoCS) for tracking signal sequences
Particle Filtered Modified-CS (PaFiMoCS) for tracking signal sequences Samarjit Das and Namrata Vaswani Department of Electrical and Computer Engineering Iowa State University http://www.ece.iastate.edu/
More informationColor Scheme. swright/pcmi/ M. Figueiredo and S. Wright () Inference and Optimization PCMI, July / 14
Color Scheme www.cs.wisc.edu/ swright/pcmi/ M. Figueiredo and S. Wright () Inference and Optimization PCMI, July 2016 1 / 14 Statistical Inference via Optimization Many problems in statistical inference
More informationCombining geometry and combinatorics
Combining geometry and combinatorics A unified approach to sparse signal recovery Anna C. Gilbert University of Michigan joint work with R. Berinde (MIT), P. Indyk (MIT), H. Karloff (AT&T), M. Strauss
More informationBhaskar Rao Department of Electrical and Computer Engineering University of California, San Diego
Bhaskar Rao Department of Electrical and Computer Engineering University of California, San Diego 1 Outline Course Outline Motivation for Course Sparse Signal Recovery Problem Applications Computational
More informationGeneralized Orthogonal Matching Pursuit
Generalized Orthogonal Matching Pursuit Jian Wang, Seokbeop Kwon and Byonghyo Shim Information System Laboratory School of Information and Communication arxiv:1111.6664v1 [cs.it] 29 ov 2011 Korea University,
More informationRecovery of Compressible Signals in Unions of Subspaces
1 Recovery of Compressible Signals in Unions of Subspaces Marco F. Duarte, Chinmay Hegde, Volkan Cevher, and Richard G. Baraniuk Department of Electrical and Computer Engineering Rice University Abstract
More informationInterpolation via weighted l 1 minimization
Interpolation via weighted l 1 minimization Rachel Ward University of Texas at Austin December 12, 2014 Joint work with Holger Rauhut (Aachen University) Function interpolation Given a function f : D C
More information