logo

SCIENCE CHINA Information Sciences, Volume 60, Issue 2: 028102(2017) https://doi.org/10.1007/s11432-015-0960-8

Principal basis analysis in sparse representation

More info
  • ReceivedMar 14, 2016
  • AcceptedJul 27, 2016
  • PublishedDec 20, 2016

Abstract


Funded by

National Natural Science Foundation of China(60872131)


Acknowledgment

Acknowledgments

This work was supported by National Natural Science Foundation of China (Grant No. 60872131). The idea of the principal basis analysis presented here arises through a lot of deep discussions with Professor Henri Ma$\hat{\rm i}$tre at Telecom-ParisTech in France. We are also grateful to Prof. Didier Le Ruyet at CNAM in France for many fruitful discussions.


References

[1] Pearson K. On lines and planes of closest fit to systems of points in space. Philos Mag, 1901, 2: 559-572 CrossRef Google Scholar

[2] Elad M, Aharon M. Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans Image Process, 2006, 15: 3736-3745 CrossRef Google Scholar

[3] Aharon M, Elad M, Bruckstein A. K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans Signal Process, 2006, 54: 4311-4322 CrossRef Google Scholar

[4] Zhao Q, Meng D Y, Xu Z B. Robust sparse principal component analysis. Sci China Inf Sci, 2014, 57: 092115-4322 Google Scholar

[5] Deledalle C A, Denis L, Tupin F. Iterative weighted maximum likelihood denoising with probabilistic patch-based weights. IEEE Trans Image Process, 2009, 18: 2661-2672 CrossRef Google Scholar

[6] Zhang Z, Li F, Zhao M, et al. Joint low-rank and sparse principal feature coding for enhanced robust representation and visual classification. IEEE Trans Image Process, 2016, 25: 2429-2443 CrossRef Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1