Multiplicative and Additive Perturbation Effects on the Recovery of Sparse Signals on the Sphere using Compressed Sensing
|
|
- Sheryl Harper
- 5 years ago
- Views:
Transcription
1 Multiplicative and Additive Perturbation Effects on the Recovery of Sparse Signals on the Sphere using Compressed Sensing ibeltal F. Alem, Daniel H. Chae, and Rodney A. Kennedy The Australian National University, Canberra, AUSTRALIA s: Abstract In this paper, we show how perturbation can affect the reconstruction of sparse spherical harmonic (SH) signals, whose domain is the sphere, with compressed sensing (CS) techniques. Our results show that the multiplicative perturbation, which can be generated by the jitter of the sampling locations (co-latitude and longitude) of the signal, can cause significant error in the SH-signal recovery with compressed sensing. To apply compressed sensing practically to the reconstruction of SHsignal, the method of calibration to minimize the multiplicative perturbation is suggested. Furthermore, we showed that the possibility of noise reduction in SH-signal reconstruction with a diversity technique which combines multiple sparse recoveries. I. INTRODUCTION Spherical harmonics (SH) [1 3] are the solution of spherical Laplace s equation, and their linear combination can represent any square integrable complex-valued signal (function) whose domain is the sphere. The SH coefficients (the Fourier coefficients corresponding to the spherical harmonics), however, generally need to be computed from sampled measurements on the sphere, and this computation requires a quite sizeable number of measurement points even for signals with a modest band-limit. The most common way of computing the coefficients is the least squares (LS) method [4, 5] which generally requires the number of measurements to be larger than that of the harmonics of the signal at hand. When the signal of interest is sparse in some domain, compressed sensing (CS) [6 10] can often be employed to determine efficiently the components of the signal. That is, when a relatively few coefficients are non-zero, there is a potential to significantly reduce the number of measurements required to calculate the coefficients, and correspondingly the computational requirements are reduced. In summary, CS can recover the coefficients even when the nominal linear system is quite under-determined because it exploits the sparsity in the signal. Focussing back on our specific applications, since it is possible to represent a spherical signal using SH, we can apply CS to the reconstruction of SH-signals as long as the signal is sufficiently sparse in the SH domain. However, CS is known to be sensitive to perturbations. The presence of additive perturbation [10], which is very common in most systems, will cause CS recovery noise. Furthermore, if there exists a multiplicative perturbation [11] in the sampled measurements, more detrimental problems may occur in the CS recovery. In sampling a SH-signal on the sphere, the noise on the measurements and the jitter on the sphere sampling points will behave as additive and multiplicative perturbations, respectively. In this paper, we are interested in applying CS to the reconstruction of SH-signals. There is already an attempt to apply CS to the reconstruction of SH-signals with preconditioning the sensing matrix method for improvement of stability during reconstruction [1]. However, we focus on the problems in reconstructing SH-signals with CS when there exist both additive and multiplicative perturbations. These perturbations can be incurred during sampling process and can cause severe noise in the CS-recovery. To reduce the noise from additive perturbation, we apply a diversity method [13, 14] to the CS reconstruction of a SH-signal. Furthermore, to reduce the effects from the multiplicative perturbation, we introduce a SH calibration technique. In general, the contributions of this paper are: 1. We raise the problem of perturbations in applying CS to reconstruct SH-signals. This includes the types of perturbations and the reasons for their occurrence.. We reveal the effect of each perturbation in reconstructing SH-signals using the CS scheme. We have undertaken a simulation study to show the adverse effects of both additive and multiplicative perturbations in recovering a sparse SH coefficient vector. 3. We finally suggest a couple of methods, calibration and segmentation, to mitigate the effects of multiplicative and additive perturbations in reconstructing SH-signals using CS. The remainder of this paper is organized as follows. Section II introduces CS into the reconstruction of SH-signals. In Section III, we show how additive and multiplicative perturbations are generated in sampling SH-signals and how these adversely affect the CS recovery of signals on sphere. To remove the adverse effects of these perturbations, SH calibration and SH diversity methods are suggested in Section IV. The adverse effects of these perturbations and their mitigation are presented in Section V. Finally, Section VI finalizes our paper with conclusions and some suggestions for future work /1/$ IEEE
2 A. Spherical Harmonics II. PRELIMINARIES Any square-integrable function f(, ) as a function of colatitude and longitude, can be expressed as 1X `X f(, )= x m` ` m (, ), (1) `=0 m= ` where ` and m denote the degree and order, respectively, of the SH basis functions represented by ` m (, ) and defined as s ` m ` +1(` m)! (, )= 4 (` + m)! P m` (cos )e im, () and P m` ( ) is the associated Legendre function. The xm` in (1) is the SH coefficient. If the scalar function f(, ) is known, the coefficient of the SH x m` can be calculated by x m` = Z Z 0 0 f(, ) m ` (, ) sin( )d d, (3) where denotes a complex conjugate. However, in this paper, we want to determine x m` with a limited number of signal measurements on the sphere without complete information about the signal f(, ). This is regarded as SH-signal reconstruction, since we have to recover the SH coefficients from samples of the signal corresponding to the measurements. If we choose M measurements on sphere f i = f( i, i) for i =1,...,M, where ( i, i) is the i-th measurement on sphere, the sampled measurement equation can be written f = x. (4) where f R M 1 is the vector of sampled signal f = [f 1...f M ] T, R M N is the matrix of SH, N is the total number of harmonics, and x R N 1 is the coefficient vector corresponding to. If the SH-signal is band-limited in degree to L, the total number of harmonics will be N =(L + 1). The matrix is defined as = y n=1 y n=n where y n is a column vector expressed as y n = mn `n ( 1, 1) mn `n ( M, M ) T, and `n and m n are the degree and order of the harmonic corresponding to the n-th column of, respectively. As we have mentioned briefly in the introduction, the most common way of finding x is the Least squares (LS) method as x? = arg min k fk = f, (5) where x? is the estimation of x, is the pseudo-inverse matrix of defined as =( T ) 1 T. In using the LS method, the number of measurements, M, should as large as or bigger than the number of total harmonics, N (depending on the noise and possible degeneracies). Fig. 1: Perturbations on the sampling of SH-signal : one is deviation from the intended point due to jitter and the other is additive noise. B. Applying CS to SH If the signal is sparse in the basis domain, i.e., most entries of the vector x are zero, it is possible to estimate x even though M is much smaller than N by using compressed sensing (CS) techniques [6 10]. The vector x can be estimated as x? = arg min kk 1 s.t. = f, (6) where kk 1 := P N n=1 n. For successful recovery, there is a requirement on the matrix called the restricted isometry property (RIP) as (1 K) apple kx Kk kx K k apple (1 + K ), (7) where K is the sparsity of x defined as K = {j : x j 6=0}. If K, known as the restricted isometry constant (RIC), is quite smaller than one for any K-sparse vector x K, the recovery of (6) is possible with high probability. For the satisfaction of the RIP, we need the minimum number of measurement, M min given by M C K log N, (8) where C is some positive constant. III. CS SENSITIVIT PROBLEM Sensitivity problems occur when there are perturbations in the compressively sampled measurements. In sampling a SHsignal, there can be two kinds of perturbations. As shown in Fig. 1, one is deviation from intended point due to jitter on the spherical sampling point, and the other is additive noise on the sampled measurements.
3 A. Perturbations of SH-signal If there is any jitter on the spherical sampling, the i-th sampling position at ( i, i) is given by ( p i, p i )=( i + i, i + i), (9) where the superscript p notes perturbation, i and i are the deviations from i and i, respectively. Furthermore, with additive noise, the i-th measurement will be expressed as f p i = f( p i, p i )+e i, (10) where e i is the additive noise on the i-th sample. Then, the perturbed measurements can be expressed in matrix form as f p = p x + e, (11) where p is the SH matrix with jitter, and e =[e 1...e M ] T. Since p can be decomposed into two terms as p = +, (1) where is a deviation matrix from, the sampled signal is re-expressed as where f = x+ e. B. Perturbation Effect f p = x+ f, (13) Since we have no information about the perturbations, blind CS reconstruction should be performed as x? = arg min kk 1, s.t. k f p k apple ", (14) where " is the bound of total noise bound due to the sampling jitter and the additive noise. In CS, the measurement noise e and the deviation matrix are modelled as additive [10] and multiplicative [11] perturbations, respectively. With quantitative modelling method [11], the magnitudes of these perturbations are bounded as kek kfk apple " f, k k (K) k k (K) apple " (K), (15) where " f and " (K) are relative upper bounds on additive and multiplicative perturbation, respectively. k k (K) denotes the spectral norm of all K-column sub-matrices of a matrix. If the K-RIC satisfies p K < 1+" (K) the reconstruction error is known to obey [11] where C is a constant given by C = 1, (16) k xk apple C", (17) 4 p 1+ K (1 + " (K) ) 1 (1 + p ) (1 + K )(1 + " (K) ) 1, (18) and " is the bound of total noise calculated as p 1+ K " = p " (K) 1 + " f kfk. (19) K The noise of CS-recovered signal gets larger as the magnitudes of perturbation increase. Furthermore, the multiplicative perturbation due to sampling jitter is more detrimental to the recovery of the SH-signal since the error constant C is increasing highly even with small value of " (K). IV. MINIMIZING PERTURBATION EFFECTS A. Calibration For Multiplicative Perturbation If we have the information on the perturbations of ( i, i) for i =1,...,M, we can minimize the adverse effect of multiplicative perturbation. We can use a reference signal to perform a calibration or to estimate the multiplicative perturbation by transmitting and receiving the reference signal before transmitting actual signal. The calibration method can be varying depending on applications. With the assumption of the calibration, the recovery can be performed with the calibrated SH matrix of p, Ỹ p as x? = arg min kk 1, s.t. kỹ p f p k apple " add, (0) instead of (14), where " add = " f kfk. The noise bound is reduced from " to " add since the basis mismatch term is removed by calibration. Then, the recovery noise can be reduced as k xk apple C add " add, (1) where C add is a constant given by In (), 4 p 1+ p K C add = 1 (1 + p ) p. () K p K is the RIC of p. B. Segmentation for Additive Perturbation If the total measurements can be segmented with D multiple sets of M min measurements, we can extract diversity gain by performing and combining of multiple CS recoveries. We can have multiple CS recoveries as x? d = arg min kk 1 s.t. kỹ p d f p d k apple " d, (3) for d =1,,...,D, where " d is the upper bound on k f d k. Then, we can combine multiple versions of x? d to achieve diversity as DX x? = w d x? d, (4) where w d is the combining weight for x? d. If we set the weights of parallel branches w d =1/D for d =1,,...,D, the noise vector of the combined recovery is given by x = 1 D DX x d, (5)
4 Fig. : Signal on sphere consists of spherical harmonics whose coefficients are sparse. Fig. 3: Sampling points for CS reconstruction. Only M = 100 points are selected for CS. where x d R N 1 is the noise vector of the d-th CS recovery. Since the multiplicative perturbation is removed by the calibration, x d,d = 1,,...,D can be regarded as uncorrelated as long as the additive noise is not correlated. If the noise of multiple recoveries are at the same level, the noise bound of the combined CS recovery is inversely proportional to p D as k xk / C add" p add, (6) D shown in Section VII. A. Simulation Set-ups V. NUMERICAL RESULTS We want to reconstruct a spherical signal with CS which is sparse in basis domain as shown in Fig.. The signal is assumed to be band-limited to L = 50 and for simplicity, only positive order spherical harmonics are computed. As a result, we will have N = 136 harmonics for a maximum bandlimit of L = 50. The sparsity of the coefficients is assumed as K = 10 out of N = 136. However, these parameters can be extended in case of more complex signal. Furthermore, Gaussian noise whose variance is is intentionally added to the signal for the generation of the additive perturbation. Fig. 3 shows the intended sampling points on the sphere for CS. Only M = 100 measurements are selected on the sphere for CS reconstruction. For the emulation of multiplicative perturbation, the variances of the deviations on (, ) of the intended points are set to 0.01 rad. B. CS Reconstruction 1) Under Both Perturbations: Fig. 4(a) is the CS-recovered signal under both additive and multiplicative perturbations, and Fig. 4(b) compares the pure coefficients and the CS-recovered coefficients of the SH. These results show that there is severe noise in the recovered signal. It indicates that we cannot reconstruct the original SH-signal with CS if there are both perturbations. ) Removing Multiplicative Perturbation: Fig. 5(a) and Fig. 5(b) show the CS recovered SH-signal with the assumption that the multiplicative perturbation is removed. The recovery is tolerable if there are only additive perturbations, even though there is still noise. This result implies that the multiplicative perturbation is more detrimental to the recovery than the additive perturbation. This, therefore, suggests minimizing the multiplicative perturbation is important in the reconstruction of SH-signal with CS. 3) Reducing Additive Perturbation: CS diversity technique is applied to reduce the additive noise further. Even though the recovery noise is reduced significantly by removing the multiplicative perturbation, the recovery still suffers from the noise due to the additive perturbation. To extract the diversity gain by combining multiple recoveries, we selected 4 sets of M = 100 CS samples on the sphere. Fig. 6 is the combined SH coefficients with the multiple recoveries. Comparing Fig. 5(b), the additive noise is reduced significantly with the application of diversity gain technique. VI. CONCLUSIONS In this paper, we showed the perturbation effects and problems in reconstructing SH-signals with CS. Our results show that the multiplicative perturbation, which is generated by the jitter of sampling position on SH-signal, can cause serious error on the SH-signal recovery with CS. To apply CS practically to the reconstruction of SH-signal, the method of calibration to minimize the multiplicative perturbation is suggested. Furthermore, we showed that the possibility of noise reduction in SH-signal reconstruction with the diversity technique of combining multiple recoveries.
5 (a) CS-reconstructed SH-signal. (a) CS-reconstructed SH-signal. (b) Comparison of harmonic coefficients between the pure and the CS-reconstructed. Fig. 4: CS Recovering of SH-signal under both additive and multiplicative perturbations. For the emulation of the multiplicative perturbation, the jitter whose variance amounts to 0.01 rad is added on the sampling point (, ). Furthermore, Gaussian noise whose variance is is added to the signal for the generation of the additive perturbation. The CSrecovered SH-signal is totally different with the original under both perturbations. (b) Comparison of harmonic coefficients between the pure and the CS-reconstructed. Fig. 5: CS-reconstructed signal with the assumption of removing multiplicative perturbation. Without the multiplicative perturbation, the CS-recovered SH-signal is tolerable except some noise. where d is the variance of the elements on the noise vector, the noise variance of the d-th recovery can be bounded as Interesting problems for future work include the practical method of minimizing the multiplicative perturbation in SHsignal processing with CS. VII. APPENDIX Since the magnitude of the CS recovery noise with the d-th measurement set can be expressed as k x d k ' p N d, (7) d / C d" d N, (8) where C d is the error bound constant of the d-th CS recovery. If x d,d = 1,,...,D are uncorrelated each other, as a result, the variance of the elements of x is bounded as / 1 D X C d " d D N. (9)
6 Fig. 6: Comparison of harmonic coefficients between the original and the CS-reconstructed with additive noise reduction. The residual noise is further reduced. Finally, the magnitude of the noise bound of the combined vector can be expressed as v k xk / 1 ux t D C d " d. (30) D For intuitive understanding of this noise bound, let us assume that C d C add and " d " add for d =1,,...,D. Then, the noise bound of the combined CS recovery is inversely proportional to p D as [7] E. J. Candès, Compressive sampling, in Proc. of Int. Congress of Mathematicians, vol. 3, Madrid, Spain, Aug. 006, pp [8] E. J. Candès and M. Wakin, An introduction to compressive sampling, IEEE Signal Process. Mag., vol. 5, pp. 1 30, Mar [9] R. G. Baraniuk, Compressive sensing, IEEE Signal Process. Mag., vol. 4, pp , Jul [10] E. J. Candès, J. K. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Communications on Pure and Applied Mathematics, vol. 59, pp , 006. [11] M. A. Herman and T. Strohmer, General deviants : An analysis of perturbations in compressed sensing, IEEE J. Select. Topics Signal Processing, vol. 4, pp , 010. [1] H. Rauhut and R. Ward, Sparse recovery for spherical harmonic expansions, ArXiv, 011. [13] D. G. Brennan, Linear diversity combining techniques, in Proc. IRE, vol. 47, no. 6, 1959, pp [14] A. Goldsmith, Wireless Communication. Cambridge University Press, 005. k xk / C add" add p D. (31) Therefore, we can reduce recovery noise by increasing the number of branches, D. ACKNOWLEDGMENT This work was supported by the Australian Research Council Discovery Grant DP REFERENCES [1] R. A. Kennedy and P. Sadeghi, Hilbert Space Methods in Signal Processing. New ork, N: Cambridge University Press, 01. [] G. Arfken, Mathematical Methods for Physicists. Academic Press, [3] H. Groemer, Geometric Applications of Fourier Series and Spherical Harmonics. Cambridge University Press, [4] Å. Björck, Numerical Methods for Least Squares Problems. SIAM, [5] G. H. Golub and C. F. V. Loan, Matrix Computations. The Johns Hopkins University Press, [6] D. L. Donoho, Compressed sensing, IEEE Trans. Information Theory, vol. 5, pp , Apr. 006.
GREEDY 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 informationCompressed Sensing and Robust Recovery of Low Rank Matrices
Compressed Sensing and Robust Recovery of Low Rank Matrices M. Fazel, E. Candès, B. Recht, P. Parrilo Electrical Engineering, University of Washington Applied and Computational Mathematics Dept., Caltech
More informationGeneralized 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 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 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 informationSparse recovery for spherical harmonic expansions
Rachel Ward 1 1 Courant Institute, New York University Workshop Sparsity and Cosmology, Nice May 31, 2011 Cosmic Microwave Background Radiation (CMB) map Temperature is measured as T (θ, ϕ) = k k=0 l=
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 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 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 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 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 informationSpatio-Spectral Analysis on the Sphere Using Spatially Localized Spherical Harmonics Transform
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 3, MARCH 2012 1487 Spatio-Spectral Analysis on the Sphere Using Spatially Localized Spherical Harmonics Transform Zubair Khalid, Salman Durrani, Parastoo
More informationExact Signal Recovery from Sparsely Corrupted Measurements through the Pursuit of Justice
Exact Signal Recovery from Sparsely Corrupted Measurements through the Pursuit of Justice Jason N. Laska, Mark A. Davenport, Richard G. Baraniuk Department of Electrical and Computer Engineering Rice University
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Instructor: Moritz Hardt Email: hardt+ee227c@berkeley.edu Graduate Instructor: Max Simchowitz Email: msimchow+ee227c@berkeley.edu
More informationCompressibility of Infinite Sequences and its Interplay with Compressed Sensing Recovery
Compressibility of Infinite Sequences and its Interplay with Compressed Sensing Recovery Jorge F. Silva and Eduardo Pavez Department of Electrical Engineering Information and Decision Systems Group Universidad
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 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 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 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 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 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 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 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 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 informationJoint Direction-of-Arrival and Order Estimation in Compressed Sensing using Angles between Subspaces
Aalborg Universitet Joint Direction-of-Arrival and Order Estimation in Compressed Sensing using Angles between Subspaces Christensen, Mads Græsbøll; Nielsen, Jesper Kjær Published in: I E E E / S P Workshop
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 informationSIGNALS with sparse representations can be recovered
IEEE SIGNAL PROCESSING LETTERS, VOL. 22, NO. 9, SEPTEMBER 2015 1497 Cramér Rao Bound for Sparse Signals Fitting the Low-Rank Model with Small Number of Parameters Mahdi Shaghaghi, Student Member, IEEE,
More informationROBUST BLIND CALIBRATION VIA TOTAL LEAST SQUARES
ROBUST BLIND CALIBRATION VIA TOTAL LEAST SQUARES John Lipor Laura Balzano University of Michigan, Ann Arbor Department of Electrical and Computer Engineering {lipor,girasole}@umich.edu ABSTRACT This paper
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 informationA Power Efficient Sensing/Communication Scheme: Joint Source-Channel-Network Coding by Using Compressive Sensing
Forty-Ninth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 28-30, 20 A Power Efficient Sensing/Communication Scheme: Joint Source-Channel-Network Coding by Using Compressive Sensing
More informationAn iterative hard thresholding estimator for low rank matrix recovery
An iterative hard thresholding estimator for low rank matrix recovery Alexandra Carpentier - based on a joint work with Arlene K.Y. Kim Statistical Laboratory, Department of Pure Mathematics and Mathematical
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 informationPerformance Regions in Compressed Sensing from Noisy Measurements
Performance egions in Compressed Sensing from Noisy Measurements Junan Zhu and Dror Baron Department of Electrical and Computer Engineering North Carolina State University; aleigh, NC 27695, USA Email:
More informationRui ZHANG Song LI. Department of Mathematics, Zhejiang University, Hangzhou , P. R. China
Acta Mathematica Sinica, English Series May, 015, Vol. 31, No. 5, pp. 755 766 Published online: April 15, 015 DOI: 10.1007/s10114-015-434-4 Http://www.ActaMath.com Acta Mathematica Sinica, English Series
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 informationCo-Prime Arrays and Difference Set Analysis
7 5th European Signal Processing Conference (EUSIPCO Co-Prime Arrays and Difference Set Analysis Usham V. Dias and Seshan Srirangarajan Department of Electrical Engineering Bharti School of Telecommunication
More informationRobustly Stable Signal Recovery in Compressed Sensing with Structured Matrix Perturbation
Robustly Stable Signal Recovery in Compressed Sensing with Structured Matri Perturbation Zai Yang, Cishen Zhang, and Lihua Xie, Fellow, IEEE arxiv:.7v [cs.it] Dec Abstract The sparse signal recovery in
More informationSparse Legendre expansions via l 1 minimization
Sparse Legendre expansions via l 1 minimization Rachel Ward, Courant Institute, NYU Joint work with Holger Rauhut, Hausdorff Center for Mathematics, Bonn, Germany. June 8, 2010 Outline Sparse recovery
More informationA fast randomized algorithm for overdetermined linear least-squares regression
A fast randomized algorithm for overdetermined linear least-squares regression Vladimir Rokhlin and Mark Tygert Technical Report YALEU/DCS/TR-1403 April 28, 2008 Abstract We introduce a randomized algorithm
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 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 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 informationInterpolation via weighted l 1 -minimization
Interpolation via weighted l 1 -minimization Holger Rauhut RWTH Aachen University Lehrstuhl C für Mathematik (Analysis) Matheon Workshop Compressive Sensing and Its Applications TU Berlin, December 11,
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 informationFast Angular Synchronization for Phase Retrieval via Incomplete Information
Fast Angular Synchronization for Phase Retrieval via Incomplete Information Aditya Viswanathan a and Mark Iwen b a Department of Mathematics, Michigan State University; b Department of Mathematics & Department
More informationCompressed Sensing and Sparse Recovery
ELE 538B: Sparsity, Structure and Inference Compressed Sensing and Sparse Recovery Yuxin Chen Princeton University, Spring 217 Outline Restricted isometry property (RIP) A RIPless theory Compressed sensing
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 informationFast 2-D Direction of Arrival Estimation using Two-Stage Gridless Compressive Sensing
Fast 2-D Direction of Arrival Estimation using Two-Stage Gridless Compressive Sensing Mert Kalfa ASELSAN Research Center ASELSAN Inc. Ankara, TR-06370, Turkey Email: mkalfa@aselsan.com.tr H. Emre Güven
More informationCompressed Sensing: Lecture I. Ronald DeVore
Compressed Sensing: Lecture I Ronald DeVore Motivation Compressed Sensing is a new paradigm for signal/image/function acquisition Motivation Compressed Sensing is a new paradigm for signal/image/function
More informationPre-weighted Matching Pursuit Algorithms for Sparse Recovery
Journal of Information & Computational Science 11:9 (214) 2933 2939 June 1, 214 Available at http://www.joics.com Pre-weighted Matching Pursuit Algorithms for Sparse Recovery Jingfei He, Guiling Sun, Jie
More informationCompressive sensing of low-complexity signals: theory, algorithms and extensions
Compressive sensing of low-complexity signals: theory, algorithms and extensions Laurent Jacques March 7, 9, 1, 14, 16 and 18, 216 9h3-12h3 (incl. 3 ) Graduate School in Systems, Optimization, Control
More informationInterpolation via weighted l 1 -minimization
Interpolation via weighted l 1 -minimization Holger Rauhut RWTH Aachen University Lehrstuhl C für Mathematik (Analysis) Mathematical Analysis and Applications Workshop in honor of Rupert Lasser Helmholtz
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 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 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 informationImproving Approximate Message Passing Recovery of Sparse Binary Vectors by Post Processing
10th International ITG Conference on Systems, Communications and Coding (SCC 2015) Improving Approximate Message Passing Recovery of Sparse Binary Vectors by Post Processing Martin Mayer and Norbert Goertz
More informationCOMPRESSIVE SAMPLING USING EM ALGORITHM. Technical Report No: ASU/2014/4
COMPRESSIVE SAMPLING USING EM ALGORITHM ATANU KUMAR GHOSH, ARNAB CHAKRABORTY Technical Report No: ASU/2014/4 Date: 29 th April, 2014 Applied Statistics Unit Indian Statistical Institute Kolkata- 700018
More informationRandom projections. 1 Introduction. 2 Dimensionality reduction. Lecture notes 5 February 29, 2016
Lecture notes 5 February 9, 016 1 Introduction Random projections Random projections are a useful tool in the analysis and processing of high-dimensional data. We will analyze two applications that use
More informationCompressed sensing techniques for hyperspectral image recovery
Compressed sensing techniques for hyperspectral image recovery A. Abrardo, M. Barni, C. M. Carretti, E. Magli, S. Kuiteing Kamdem, R. Vitulli ABSTRACT Compressed Sensing (CS) theory is progressively gaining
More informationA Generalized Restricted Isometry Property
1 A Generalized Restricted Isometry Property Jarvis Haupt and Robert Nowak Department of Electrical and Computer Engineering, University of Wisconsin Madison University of Wisconsin Technical Report ECE-07-1
More informationLecture Notes 9: Constrained Optimization
Optimization-based data analysis Fall 017 Lecture Notes 9: Constrained Optimization 1 Compressed sensing 1.1 Underdetermined linear inverse problems Linear inverse problems model measurements of the form
More informationFast Hard Thresholding with Nesterov s Gradient Method
Fast Hard Thresholding with Nesterov s Gradient Method Volkan Cevher Idiap Research Institute Ecole Polytechnique Federale de ausanne volkan.cevher@epfl.ch Sina Jafarpour Department of Computer Science
More informationRecovering overcomplete sparse representations from structured sensing
Recovering overcomplete sparse representations from structured sensing Deanna Needell Claremont McKenna College Feb. 2015 Support: Alfred P. Sloan Foundation and NSF CAREER #1348721. Joint work with Felix
More informationNumerical Methods. Rafał Zdunek Underdetermined problems (2h.) Applications) (FOCUSS, M-FOCUSS,
Numerical Methods Rafał Zdunek Underdetermined problems (h.) (FOCUSS, M-FOCUSS, M Applications) Introduction Solutions to underdetermined linear systems, Morphological constraints, FOCUSS algorithm, M-FOCUSS
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 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 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 informationCompressive Sensing under Matrix Uncertainties: An Approximate Message Passing Approach
Compressive Sensing under Matrix Uncertainties: An Approximate Message Passing Approach Asilomar 2011 Jason T. Parker (AFRL/RYAP) Philip Schniter (OSU) Volkan Cevher (EPFL) Problem Statement Traditional
More informationCompressed Sensing and Affine Rank Minimization Under Restricted Isometry
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 13, JULY 1, 2013 3279 Compressed Sensing Affine Rank Minimization Under Restricted Isometry T. Tony Cai Anru Zhang Abstract This paper establishes new
More informationThe uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008
The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008 Emmanuel Candés (Caltech), Terence Tao (UCLA) 1 Uncertainty principles A basic principle
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 informationarxiv: v1 [math.na] 26 Nov 2009
Non-convexly constrained linear inverse problems arxiv:0911.5098v1 [math.na] 26 Nov 2009 Thomas Blumensath Applied Mathematics, School of Mathematics, University of Southampton, University Road, Southampton,
More informationCompressed Sensing - Near Optimal Recovery of Signals from Highly Incomplete Measurements
Compressed Sensing - Near Optimal Recovery of Signals from Highly Incomplete Measurements Wolfgang Dahmen Institut für Geometrie und Praktische Mathematik RWTH Aachen and IMI, University of Columbia, SC
More informationConstructing Explicit RIP Matrices and the Square-Root Bottleneck
Constructing Explicit RIP Matrices and the Square-Root Bottleneck Ryan Cinoman July 18, 2018 Ryan Cinoman Constructing Explicit RIP Matrices July 18, 2018 1 / 36 Outline 1 Introduction 2 Restricted Isometry
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 informationStable Signal Recovery from Incomplete and Inaccurate Measurements
Stable Signal Recovery from Incomplete and Inaccurate Measurements EMMANUEL J. CANDÈS California Institute of Technology JUSTIN K. ROMBERG California Institute of Technology AND TERENCE TAO University
More informationINDUSTRIAL MATHEMATICS INSTITUTE. B.S. Kashin and V.N. Temlyakov. IMI Preprint Series. Department of Mathematics University of South Carolina
INDUSTRIAL MATHEMATICS INSTITUTE 2007:08 A remark on compressed sensing B.S. Kashin and V.N. Temlyakov IMI Preprint Series Department of Mathematics University of South Carolina A remark on compressed
More informationANGLE OF ARRIVAL DETECTION USING COMPRESSIVE SENSING
18th European Signal Processing Conference (EUSIPCO-2010) Aalborg, Denmark, August 23-27, 2010 ANGLE OF ARRIVAL DETECTION USING COMPRESSIVE SENSING T. Justin Shaw and George C. Valley The Aerospace Corporation,
More informationDesign of Spectrally Shaped Binary Sequences via Randomized Convex Relaxations
Design of Spectrally Shaped Binary Sequences via Randomized Convex Relaxations Dian Mo Department of Electrical and Computer Engineering University of Massachusetts Amherst, MA 3 mo@umass.edu Marco F.
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 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 informationLecture 22: More On Compressed Sensing
Lecture 22: More On Compressed Sensing Scribed by Eric Lee, Chengrun Yang, and Sebastian Ament Nov. 2, 207 Recap and Introduction Basis pursuit was the method of recovering the sparsest solution to an
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 informationOn the Observability of Linear Systems from Random, Compressive Measurements
On the Observability of Linear Systems from Random, Compressive Measurements Michael B Wakin, Borhan M Sanandaji, and Tyrone L Vincent Abstract Recovering or estimating the initial state of a highdimensional
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 informationMeasurements vs. Bits: Compressed Sensing meets Information Theory
Measurements vs. Bits: Compressed Sensing meets Information Theory Shriram Sarvotham, Dror Baron, and Richard G. Baraniuk Department of Electrical and Computer Engineering Rice University, Houston, TX
More informationDoes Compressed Sensing have applications in Robust Statistics?
Does Compressed Sensing have applications in Robust Statistics? Salvador Flores December 1, 2014 Abstract The connections between robust linear regression and sparse reconstruction are brought to light.
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 informationGuaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Forty-Fifth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 26-28, 27 WeA3.2 Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization Benjamin
More informationSampling Signals from a Union of Subspaces
1 Sampling Signals from a Union of Subspaces Yue M. Lu and Minh N. Do I. INTRODUCTION Our entire digital revolution depends on the sampling process, which converts continuousdomain real-life signals to
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 informationOn the Projection Matrices Influence in the Classification of Compressed Sensed ECG Signals
On the Projection Matrices Influence in the Classification of Compressed Sensed ECG Signals Monica Fira, Liviu Goras Institute of Computer Science Romanian Academy Iasi, Romania Liviu Goras, Nicolae Cleju,
More informationSparseness Constraints on Nonnegative Tensor Decomposition
Sparseness Constraints on Nonnegative Tensor Decomposition Na Li nali@clarksonedu Carmeliza Navasca cnavasca@clarksonedu Department of Mathematics Clarkson University Potsdam, New York 3699, USA Department
More informationOn the coherence barrier and analogue problems in compressed sensing
On the coherence barrier and analogue problems in compressed sensing Clarice Poon University of Cambridge June 1, 2017 Joint work with: Ben Adcock Anders Hansen Bogdan Roman (Simon Fraser) (Cambridge)
More informationSPECTRAL COMPRESSIVE SENSING WITH POLAR INTERPOLATION. Karsten Fyhn, Hamid Dadkhahi, Marco F. Duarte
SPECTRAL COMPRESSIVE SENSING WITH POLAR INTERPOLATION Karsten Fyhn, Hamid Dadkhahi, Marco F. Duarte Dept. of Electronic Systems, Aalborg University, Denmark. Dept. of Electrical and Computer Engineering,
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 informationCompressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes
Compressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes Item Type text; Proceedings Authors Jagiello, Kristin M. Publisher International Foundation for Telemetering Journal International Telemetering
More informationSolving Underdetermined Linear Equations and Overdetermined Quadratic Equations (using Convex Programming)
Solving Underdetermined Linear Equations and Overdetermined Quadratic Equations (using Convex Programming) Justin Romberg Georgia Tech, ECE Caltech ROM-GR Workshop June 7, 2013 Pasadena, California Linear
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 informationFast Algorithms for Sparse Recovery with Perturbed Dictionary
Fast Algorithms for Sparse Recovery with Perturbed Dictionary Xuebing Han, Hao Zhang, Gang Li arxiv:.637v3 cs.it May Abstract In this paper, we account for approaches of sparse recovery from large underdetermined
More information