• DocumentCode
    617547
  • Title

    Performance analysis of denoising with low-rank and sparsity constraints

  • Author

    Fan Lam ; Chao Ma ; Zhi-Pei Liang

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
  • fYear
    2013
  • fDate
    7-11 April 2013
  • Firstpage
    1223
  • Lastpage
    1226
  • Abstract
    Recent denoising methods that exploit the low-rank property and sparsity of the underlying signals have produced impressive empirical results in various imaging applications. However, the fundamental limits of their denoising capability have not been systematically analyzed. This paper presents an analysis of the denoising effects of imposing low-rank and sparsity constraints. Specifically, we use the constrained Cramér-Rao lower bound to derive upper bounds on the maximum noise reduction when applying these two constraints, individually or simultaneously. We also perform numerical simulations to compare the theoretical bounds with noise reductions from practical denoising methods. These results should provide useful insights into the utility of low-rank and sparsity constraints for denoising.
  • Keywords
    biodiffusion; biomedical MRI; image denoising; medical image processing; numerical analysis; constrained Cramer-Rao lower bound; denoising capability; diffusion weighted magnetic resonance imaging; imaging applications; low-rank constraints; maximum noise reduction; numerical simulations; performance analysis; practical denoising methods; sparsity constraints; theoretical bounds; Maximum likelihood estimation; Noise measurement; Noise reduction; Signal to noise ratio; Upper bound; Vectors; Cramér-Rao lower bound; Denoising; low-rank model; singular value decomposition; sparse representation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Biomedical Imaging (ISBI), 2013 IEEE 10th International Symposium on
  • Conference_Location
    San Francisco, CA
  • ISSN
    1945-7928
  • Print_ISBN
    978-1-4673-6456-0
  • Type

    conf

  • DOI
    10.1109/ISBI.2013.6556701
  • Filename
    6556701