Noise Level Estimation for Overcomplete Dictionary Learning Based on Tight Asymptotic Bounds

December 09, 2017 Β· Declared Dead Β· πŸ› Chinese Conference on Pattern Recognition and Computer Vision

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rui Chen, Changshui Yang, Huizhu Jia, Xiaodong Xie arXiv ID 1712.03381 Category eess.SP: Signal Processing Cross-listed cs.CV Citations 4 Venue Chinese Conference on Pattern Recognition and Computer Vision Last Checked 4 months ago
Abstract
In this letter, we address the problem of estimating Gaussian noise level from the trained dictionaries in update stage. We first provide rigorous statistical analysis on the eigenvalue distributions of a sample covariance matrix. Then we propose an interval-bounded estimator for noise variance in high dimensional setting. To this end, an effective estimation method for noise level is devised based on the boundness and asymptotic behavior of noise eigenvalue spectrum. The estimation performance of our method has been guaranteed both theoretically and empirically. The analysis and experiment results have demonstrated that the proposed algorithm can reliably infer true noise levels, and outperforms the relevant existing methods.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Signal Processing

Died the same way β€” πŸ‘» Ghosted