Threshold Effects in Parameter Estimation From Compressed Data

In this paper, we investigate threshold effects associated with the swapping of signal and noise subspaces in estimating signal parameters from compressed noisy data. The term threshold effect refers to a sharp departure of mean-squared error from the Cramér-Rao bound when the signal-to-noise ratio falls below a threshold SNR. In many cases, the threshold effect is caused by a subspace swap event, when the measured data (or its sample covariance) is better approximated by a subset of components of an orthogonal subspace than by the components of a signal subspace. We derive analytical lower bounds on the probability of a subspace swap in compressively measured noisy data in two canonical models: a first-order model and a second-order model. In the first-order model, the parameters to be estimated modulate the mean of a complex multivariate normal set of measurements. In the second-order model, the parameters modulate the covariance of complex multivariate measurements. In both cases, the probability bounds are tail probabilities of F-distributions, and they apply to any linear compression scheme. These lower bounds guide our understanding of threshold effects and performance breakdowns for parameter estimation using compression. In particular, they can be used to quantify the increase in threshold SNR as a function of a compression ratio C. We demonstrate numerically that this increase in threshold SNR is roughly 10log10 C dB, which is consistent with the performance loss that one would expect when measurements in Gaussian noise are compressed by a factor C.

[1]  Xiaoli Ma,et al.  First-Order Perturbation Analysis of Singular Vectors in Singular Value Decomposition , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[2]  Arthur Jay Barabell,et al.  Improving the resolution performance of eigenstructure-based direction-finding algorithms , 1983, ICASSP.

[3]  C. Dunkl,et al.  Computation of the Generalized F Distribution , 1999, math/9906095.

[4]  Sergiy A. Vorobyov,et al.  Subspace Leakage Analysis and Improved DOA Estimation With Small Sample Size , 2015, IEEE Transactions on Signal Processing.

[5]  Y. Chikuse Statistics on special manifolds , 2003 .

[6]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[7]  Teodoro Collin RANDOM MATRIX THEORY , 2016 .

[8]  Ronald W. Butler,et al.  Exact distributional computations for Roy’s statistic and the largest eigenvalue of a Wishart distribution , 2011, Stat. Comput..

[9]  Xavier Mestre,et al.  MUSIC, G-MUSIC, and Maximum-Likelihood Performance Breakdown , 2008, IEEE Transactions on Signal Processing.

[10]  P. P. Vaidyanathan,et al.  Sparse Sensing With Co-Prime Samplers and Arrays , 2011, IEEE Transactions on Signal Processing.

[11]  Robert Boorstyn,et al.  Single tone parameter estimation from discrete-time observations , 1974, IEEE Trans. Inf. Theory.

[12]  Yuejie Chi,et al.  Analysis of fisher information and the Cramer-Rao bound for nonlinear parameter estimation after compressed sensing , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[13]  I. Johnstone High Dimensional Statistical Inference and Random Matrices , 2006, math/0611589.

[14]  John K. Thomas,et al.  The probability of a subspace swap in the SVD , 1995, IEEE Trans. Signal Process..

[15]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[16]  P. P. Vaidyanathan,et al.  Theory of Sparse Coprime Sensing in Multiple Dimensions , 2011, IEEE Transactions on Signal Processing.

[17]  P. P. Vaidyanathan,et al.  Direct-MUSIC on sparse arrays , 2012, 2012 International Conference on Signal Processing and Communications (SPCOM).

[18]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[19]  Raj Rao Nadakuditi,et al.  The breakdown point of signal subspace estimation , 2010, 2010 IEEE Sensor Array and Multichannel Signal Processing Workshop.

[20]  Allan Steinhardt,et al.  Thresholds in frequency estimation , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[21]  Richard J. Vaccaro,et al.  A Second-Order Perturbation Expansion for the SVD , 1994 .

[22]  Petre Stoica,et al.  Performance breakdown of subspace-based methods: prediction and cure , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[23]  Raj Rao Nadakuditi,et al.  The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices , 2009, 0910.2120.

[24]  Brian D. O. Anderson,et al.  Characterization of threshold for single tone maximum likelihood frequency estimation , 1995, IEEE Trans. Signal Process..

[25]  Florian Roemer,et al.  R-dimensional esprit-type algorithms for strictly second-order non-circular sources and their performance analysis , 2014, IEEE Transactions on Signal Processing.

[26]  F. Li,et al.  Performance analysis for DOA estimation algorithms: unification, simplification, and observations , 1993 .

[27]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

[28]  Harry L. Van Trees,et al.  Detection, Estimation, and Modulation Theory: Radar-Sonar Signal Processing and Gaussian Signals in Noise , 1992 .

[29]  Peter J. Kootsookos,et al.  Threshold behavior of the maximum likelihood estimator of frequency , 1994, IEEE Trans. Signal Process..

[30]  P. P. Vaidyanathan,et al.  Why does direct-MUSIC on sparse-arrays work? , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[31]  Zhengyuan Xu,et al.  Perturbation analysis for subspace decomposition with applications in subspace-based algorithms , 2002, IEEE Trans. Signal Process..

[32]  Hao Wang,et al.  On The Performance Characterization Of Signal-subspace Processing , 1985, Nineteeth Asilomar Conference on Circuits, Systems and Computers, 1985..

[33]  E.J. Candes Compressive Sampling , 2022 .

[34]  Upamanyu Madhow,et al.  Compressive estimation in AWGN: General observations and a case study , 2012, 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[35]  Stephen D. Howard,et al.  Analysis of Fisher Information and the Cramér–Rao Bound for Nonlinear Parameter Estimation After Random Compression , 2015, IEEE Transactions on Signal Processing.

[36]  Richard J. Vaccaro,et al.  A perturbation theory for the analysis of SVD-based algorithms , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[37]  Massimo Fornasier,et al.  Compressive Sensing , 2015, Handbook of Mathematical Methods in Imaging.

[38]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

[39]  Louis L. Scharf,et al.  Modal Analysis Using Co-Prime Arrays , 2016, IEEE Transactions on Signal Processing.

[40]  P. Vaidyanathan,et al.  Coprime sampling and the music algorithm , 2011, 2011 Digital Signal Processing and Signal Processing Education Meeting (DSP/SPE).