A new framework for designing incoherent sparsifying dictionaries

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2017, Pages 4416-4420

  Li, Gang ^a   Zhu, Zhihui ^b   Bai, Huang ^c   Yu, Aihua ^c  

^a ZHEJIANG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b Department of Geology and Geological Engineering   (United States)

^c ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Dictionary learning; equiangular tight frame; incoherent dictionary; sparse representation

Indexed keywords

EID: 85023754713     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2017.7952991     Document Type: Conference Paper

References (20)

1. M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing, Springer New York Dordrecht Heidelberg London, 2010.
2. 1 minimization," Proc. Nat. Acad. Sci., Vol. 100, no. 5, pp. 2197-2202, Mar. 2003.
3. I. Tošić and P. Frossard, "Dictionary learning: What is the right representation for my signal?," IEEE Signal Process. Mag., pp. 27-38, Mar. 2011.
4. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, Vol. 52, no. 4, pp. 1289-1306, Sept. 2006.
5. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, Vol. 52, no. 2, pp. 489-509, Feb. 2006.
6. E. J. Candès and M. B. Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., Vol. 25, no. 2, pp. 21-30, Mar. 2008.
7. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, Vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
8. J. A. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, Vol. 53, no. 12, pp. 4655-4666, Dec. 2007.
9. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Inf. Theory, Vol. 55, no. 5, pp. 2230-2249, 2009.
10. J. Mairal, F. Bach, J. Ponce, and G. Sapiro, "Online learning for matrix factorization and sparse coding," J. Mach. Learn. Res., Vol. 11, pp. 19-60, Jan. 2010.
11. 1-minimization," IEEE Trans. Inf. Theory, Vol. 56, no. 7, pp. 3523-3539, 2010.
12. K. Schnass, "On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD", Appl. Comput. Harmon. Anal, Vol. 37, pp. 464-491, 2014.
13. J. A. Tropp, I. S. Dhillon, R. W. Heath Jr., and T. Strohmer, "Designing structured tight frame via alternating projection," IEEE Trans. Inf. Theory, Vol. 51, no. 1, pp. 188-209, 2005.
14. K. Engan, S. O. Aase, and J. H. Hakon-Housoy, "Method of optimal direction for frame design," in IEEE Int. Conf. Acoust., Speech, Signal Process., Vol. 5, pp. 2443-2446, 1999.
15. M. Aharon, M. Elad, and A. Bruckstein, "K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Signal Process., Vol. 54, no. 11, pp. 4311-4322, 2006.
16. M. Yaghoobi, L. Daudet, and M. E. Davies, "Parametric dictionary design for sparse coding," IEEE Trans. Signal Process., Vol. 57, no. 12, pp. 4800-4810, 2009.
17. S. K. Sahoo and A. Makur, "Dictionary training for sparse representation as generalization of K-means clustering," IEEE Signal Process. Lett., Vol. 20, no. 6, pp. 587-590, 2013.
18. J. A. Tropp, "On the conditioning of random subdictionaries," Appl. Computat. Harmon. Anal., Vol. 25, no. 1, pp. 1-24, Jul. 2008.
19. D. Barchiesi and M.D. Plumbey, "Learning incoherent dictionaries for sparse approximation using iterative projections and rotations," IEEE Trans. Signal Process., Vol. 61, no. 8, pp. 2055-2065, Apr. 2013.
20. T. Strohmer and R. W. Heath, "Grassmannian frames with applications to coding and communication," Appl. Comp. Harmonic Anal., Vol. 14, no. 3, pp. 257-275, May 2003.