Abstract

The covariance matrix estimation problem is posed in both the Bayesian and frequentist settings as the solution of a maximum a posteriori (MAP) or maximum likelihood (ML) optimization, respectively, when the true covariance consists of a known (or bounded) noise floor and a low-rank component. Persymmetric structure may also be assumed. The MAP and ML solutions with the non-convex rank constraint are shown to be a simple scalar thresholding of eigenvalues of a suitably translated and projected sample covariance matrix. No iterative optimization is required; therefore, the computation is suited to real-time applications. Our proof is short and elementary without resorting to the duality theory. Numerical results are presented to illustrate the improved estimation performance obtained by incorporating the structural constraints on the unknown covariance.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.