Learning incoherent dictionaries for sparse approximation using iterative projections and rotations

IEEE Transactions on Signal Processing

Volumn 61, Issue 8, 2013, Pages 2055-2065

  Barchiesi, Daniele ^a   Plumbley, Mark D ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Dictionary learning; iterative projections; mutual coherence; sparse approximation

Indexed keywords

DICTIONARY LEARNING; INCOHERENT DICTIONARIES; ITERATIVE PROJECTION METHODS; ITERATIVE PROJECTIONS; MUSICAL AUDIO DATA; MUTUAL COHERENCE; SIGNALTONOISE RATIO (SNR); SPARSE APPROXIMATIONS;

APPROXIMATION ALGORITHMS; AUDIO ACOUSTICS;

ITERATIVE METHODS;

EID: 84875655001     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2013.2245663     Document Type: Article

References (35)

1. 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, Nov. 2006. (Pubitemid 44637761)
2. M. Aharon, M. Elad, and A. M. Bruckstein, "On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them," Linear Algebra Appl., vol. 416, no. 1, pp. 48-67, Jul. 2006. (Pubitemid 43737210)
3. D. Barchiesi, Dictionary Learning for the Sparse Approximation of Audio Signals Research Open Day, School of Electron. Eng. Comput. Sci., Queen Mary Univ. London, U.K., Apr. 2012.
4. T. Blumensath and M. E. Davies, "Iterative thresholding for sparse approximations," J. Fourier Anal. Appl., vol. 14, no. 5, pp. 629-654, 2008.
5. J. Bobin, Y. Moudden, and J.-L. Starck, "Enhanced source separation by morphological component analysis," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), 2006, vol. 5, pp. 833-866.
6. J. Bobin, J.-L. Starck, J. M. Fadili, Y. Moudden, and D. L. Donoho, "Morphological component analysis: An adaptive thresholding strategy," IEEE Trans. Image Process., vol. 16, no. 11, pp. 2675-2681, Nov. 2007. (Pubitemid 350147649)
7. E. Candès and M. B. Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 21-30, Mar. 2008.
8. S. S. Chen, D. L. Donoho, and M. A. Sauders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, no. 1, pp. 129-159, Mar. 2001. (Pubitemid 32406896)
9. W. Dai, T. Xu, and W. Wang, "Dictionary learning and update based on simultaneous codeword optimization (SIMCO)," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), 2012, pp. 2037-2040.
10. I. Damnjanovic, M. E. P. Davies, and M. D. Plumbley, "SMALLbox-An evaluation framework for sparse representations and dictionary learning algorithms," in Proc. Int. Conf. Latent Variable Anal. Signal Separation (LVA/ICA), 2010, pp. 418-425.
11. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approxima tions," Construct. Approx., vol. 13, no. 1, pp. 57-98, 1997.
12. R. A. DeVore, "Nonlinear approximation," Acta Numerica, vol. 7, pp. 51-150, 1998.
13. K. Engan, S. O. Aase, and J. H. Husøy, "Method of optimal directions for frame design," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), 1999, vol. 5, pp. 2443-2446.
14. Q. Geng, H. Wang, and S. J. Wright, "On the local correctness of-minimization for dictionary learning," [Online]. Available: http://arxiv.org/pdf/1101.5672.pdf Feb. 2011
15. R. Gribonval and K. Schnass, "Dictionary identification: Sparse matrix-factorisation via-minimisation," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3523-3539, Jul. 2010.
16. R. Gribonval and P. Vandergheynst, "On the exponential convergence of matching pursuit in quasi-incoherent dictionaries," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 255-261, Jan. 2006. (Pubitemid 43263134)
17. B. K. Horn, H. M. Hilden, and S. Negahdaripour, "Closed-form solution of absolute orientation using orthonormal matrices," J. Opt. Soc. Amer. A, vol. 5, pp. 1127-1135, July 1988.
18. M. Lewicki and T. Sejnowski, "Learning overcomplete representations," Neural Computat., vol. 12, no. 2, pp. 337-365, Feb. 2000.
19. B. Mailhé, D. Barchiesi, and M. D. Plumbley, "INK-SVD: Learning incoherent dictionaries for sparse representations," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), 2012, pp. 3573-3576.
20. B. Mailhé and M. D. Plumbley, "Local optimality of dictionary learning algorithms," in Proc. Workshop on Signal Process. Adapt. Sparse Structured Represent. (SPARS), 2011, vol. 67.
21. 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.
22. S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
23. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Computat. Harmon. Anal., vol. 26, pp. 301-321, 2008.
24. D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit," Found. Computat. Math., vol. 9, no. 3, pp. 317-334, 2009.
25. Y. Pati, R. Rezaiifar, and P. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Asilomar Conf. Signals, Syst. Comput., Nov. 1993, vol. 1, pp. 40-44.
26. I. Ramírez, F. Lecumberry, and G. Sapiro, Sparse modeling with universal priors and learned incoherent dictionaries Inst. Math. and its Appl.s, Unvi. Minnesota, Tech. Rep. 2279, Sep. 2009.
27. R. Rubinstein, A. Bruckstein, and M. Elad, "Dictionaries for sparse representation modeling," in Proc. IEEE, Jun. 2010, vol. 98, no. 6, pp. 1045-1057.
28. K. Schnass and P. Vandergheynst, "Dictionary preconditioning for greedy algorithms," IEEE Trans. Signal Process., vol. 56, no. 5, pp. 1994-2002, May 2008.
29. K. Skretting and K. Engan, "Recursive least squares dictionary learning algorithm," IEEE Trans. Signal Process., vol. 58, no. 4, pp. 2121-2130, Apr. 2010.
30. E. C. Smith and M. Lewicki, "Efficient auditory coding," Nature, vol. 439, no. 23, pp. 978-982, Feb. 2006. (Pubitemid 43292416)
31. T. Strohmer and R. W. J. Heath, "Grassmannian frames with applications to coding and communication," Appl. Computat. Harmon. Anal., vol. 14, no. 3, pp. 257-275, 2003.
32. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
33. J. A. Tropp, "On the conditioning of random subdictionaries," Appl. Computat. Harmon. Anal., vol. 25, no. 1, pp. 1-24, Jul. 2008. (Pubitemid 351721018)
34. J. A. Tropp, I. S. Dhillon, R. W. J. Heath, and T. Strohmer, "Designing structured tight frames via an alternating projection method," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 188-209, Jan. 2005. (Pubitemid 40145995)
35. 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, Dec. 2009.