Efficient Computation of MSE Lower Bounds via Matching Pursuit

The classes of large-error bounds that are based on the covariance inequality, in both Bayesian and non-Bayesian approaches, are characterized as projection-based bounds. Tightening of bounds in these classes involves high computational complexity due to multidimensional optimization procedure. Consequently, projection-based large-error bounds have little popularity, while small-error bounds are frequently preferred, although they are not necessarily tight. In this letter, we first introduce a unified formulation for Bayesian and non-Bayesian projection-based lower bounds and set a general framework, which allows for their approximation via a greedy-based method. This framework is then used to propose the use of optimized orthogonal matching pursuit approach for computing projection-based large-error bounds. We analyze the complexity of the proposed algorithm and show that it is significantly lower than the complexity of the conventional approach. Finally, we apply the algorithm for the problem of multitone estimation and show that for fixed computational resources, the Weiss-Weinstein bound implemented with the proposed algorithm, provides a tighter bound compared to conventional approaches.

[1]  H. Cramér.  A contribution to the theory of statistical estimation , 1946 .

[2]  Shang-Liang Chen,et al.  Orthogonal least squares learning algorithm for radial basis function networks , 1991, IEEE Trans. Neural Networks.

[3]  Ehud Weinstein,et al.  A lower bound on the mean-square error in random parameter estimation , 1985, IEEE Trans. Inf. Theory.

[4]  Lawrence P. Seidman,et al.  A useful form of the Barankin lower bound and its application to PPM threshold analysis , 1969, IEEE Trans. Inf. Theory.

[5]  Umberto Mengali,et al.  The modified Cramer-Rao bound and its application to synchronization problems , 1994, IEEE Trans. Commun..

[6]  Jonathan S. Abel,et al.  A bound on mean-square-estimate error , 1993, IEEE Trans. Inf. Theory.

[7]  Joseph Tabrikian,et al.  General Classes of Performance Lower Bounds for Parameter Estimation—Part II: Bayesian Bounds , 2010, IEEE Transactions on Information Theory.

[8]  Ehud Weinstein,et al.  A general class of lower bounds in parameter estimation , 1988, IEEE Trans. Inf. Theory.

[9]  Alexandre Renaux.  Weiss–Weinstein Bound for Data-Aided Carrier Estimation , 2007, IEEE Signal Processing Letters.

[10]  L. Rebollo-Neira,et al.  Optimized orthogonal matching pursuit approach , 2002, IEEE Signal Processing Letters.

[11]  Eric Chaumette,et al.  A New Barankin Bound Approximation for the Prediction of the Threshold Region Performance of Maximum Likelihood Estimators , 2008, IEEE Transactions on Signal Processing.

[12]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[13]  Christ D. Richmond,et al.  Mean-squared error and threshold SNR prediction of maximum-likelihood signal parameter estimation with estimated colored noise covariances , 2006, IEEE Transactions on Information Theory.

[14]  Philippe Forster,et al.  The Bayesian ABEL Bound on the Mean Square Error , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[15]  Petre Stoica,et al.  Performance study of conditional and unconditional direction-of-arrival estimation , 1990, IEEE Trans. Acoust. Speech Signal Process..

[16]  Bob L. Sturm,et al.  Comparison of orthogonal matching pursuit implementations , 2012, 2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO).

[17]  Hagit Messer,et al.  A Barankin-type lower bound on the estimation error of a hybrid parameter vector , 1997, IEEE Trans. Inf. Theory.

[18]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[19]  Sacha Krstulovic,et al.  Mptk: Matching Pursuit Made Tractable , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[20]  Li Bo,et al.  Fast OOMP algorithm and its application in compressed sensing , 2011, 2011 IEEE International Instrumentation and Measurement Technology Conference.

[21]  Mike E. Davies,et al.  Gradient Pursuits , 2008, IEEE Transactions on Signal Processing.

[22]  C. R. Rao,et al.  Information and the Accuracy Attainable in the Estimation of Statistical Parameters , 1992 .

[23]  D. G. Chapman,et al.  Minimum Variance Estimation Without Regularity Assumptions , 1951 .

[24]  E. Barankin.  Locally Best Unbiased Estimates , 1949 .

[25]  Peyman Milanfar,et al.  Fundamental performance limits in image registration , 2004, IEEE Trans. Image Process..

[26]  Philippe Forster,et al.  On lower bounds for deterministic parameter estimation , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[27]  A. Weiss,et al.  Fundamental limitations in passive time delay estimation--Part I: Narrow-band systems , 1983 .

[28]  Philippe Forster,et al.  A Useful Form of the Abel Bound and Its Application to Estimator Threshold Prediction , 2007, IEEE Transactions on Signal Processing.

[29]  Joseph Tabrikian,et al.  General Classes of Performance Lower Bounds for Parameter Estimation—Part I: Non-Bayesian Bounds for Unbiased Estimators , 2010, IEEE Transactions on Information Theory.

[30]  P. Billingsley,et al.  Probability and Measure , 1980 .

[31]  Carlos H. Muravchik,et al.  Posterior Cramer-Rao bounds for discrete-time nonlinear filtering , 1998, IEEE Trans. Signal Process..