메뉴 건너뛰기




Volumn 17, Issue 1, 2007, Pages 32-49

Family of iterative LS-based dictionary learning algorithms, ILS-DLA, for sparse signal representation

Author keywords

Compression; Dictionary design; Dictionary learning; Frame design; Least squares; Matching pursuit; Overcomplete dictionary; Signal representation; Sparse approximation

Indexed keywords

DATA STRUCTURES; DIGITAL FILTERS; ITERATIVE METHODS; LEARNING SYSTEMS; MATHEMATICAL TRANSFORMATIONS; SIGNAL SYSTEMS;

EID: 37849188832     PISSN: 10512004     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dsp.2006.02.002     Document Type: Article
Times cited : (148)

References (52)
  • 1
    • 37949002797 scopus 로고    scopus 로고
    • G. Davis, Adaptive nonlinear approximations, Ph.D. thesis, New York University, September 1994
  • 2
    • 37949019112 scopus 로고    scopus 로고
    • S.S. Chen, Basis pursuit, Ph.D. thesis, Stanford University, November 1995
  • 3
    • 0027842081 scopus 로고
    • Matching pursuits with time-frequency dictionaries
    • Mallat S.G., and Zhang Z. Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41 (1993) 3397-3415
    • (1993) IEEE Trans. Signal Process. , vol.41 , pp. 3397-3415
    • Mallat, S.G.1    Zhang, Z.2
  • 4
    • 0031647539 scopus 로고    scopus 로고
    • Quantized overcomplete expansions in RN: Analysis, synthesis, and algorithms
    • Goyal V.K., Vetterli M., and Thao N.T. Quantized overcomplete expansions in RN: Analysis, synthesis, and algorithms. IEEE Trans. Inform. Theory 44 (1998) 16-31
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 16-31
    • Goyal, V.K.1    Vetterli, M.2    Thao, N.T.3
  • 5
    • 23844477225 scopus 로고    scopus 로고
    • Sparse solutions to linear inverse problems with multiple measurement vectors
    • Cotter S., Rao B.D., Engan K., and Kreutz-Delgado K. Sparse solutions to linear inverse problems with multiple measurement vectors. IEEE Trans. Signal Process. 53 (2005) 2477-2488
    • (2005) IEEE Trans. Signal Process. , vol.53 , pp. 2477-2488
    • Cotter, S.1    Rao, B.D.2    Engan, K.3    Kreutz-Delgado, K.4
  • 6
    • 0032712352 scopus 로고    scopus 로고
    • An affine scaling methodology for best basis selection
    • Rao B.D., and Kreutz-Delgado K. An affine scaling methodology for best basis selection. IEEE Trans. Signal Process. 47 (1999) 187-200
    • (1999) IEEE Trans. Signal Process. , vol.47 , pp. 187-200
    • Rao, B.D.1    Kreutz-Delgado, K.2
  • 7
    • 37949005206 scopus 로고    scopus 로고
    • B.D. Rao, K. Engan, K. Kreutz-Delgado, Diversity measure minimization based basis selection methods from noisy observations, IEEE Trans. Signal Process. (2000), submitted for publication
  • 8
    • 37949052308 scopus 로고    scopus 로고
    • K. Skretting, J.H. Husøy, Partial search vector selection for sparse signal representation, in: NORSIG-03, Bergen, Norway, October 2003, available at: http://www.ux.his.no/~karlsk/
  • 9
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed in V1
    • Olshausen B.A., and Field D.J. Sparse coding with an overcomplete basis set: A strategy employed in V1. Vision Res. 37 (1997) 3311-3325
    • (1997) Vision Res. , vol.37 , pp. 3311-3325
    • Olshausen, B.A.1    Field, D.J.2
  • 10
    • 0032606945 scopus 로고    scopus 로고
    • Probabilistic framework for the adaption and comparison of image codes
    • Lewicki M.S., and Olshausen B.A. Probabilistic framework for the adaption and comparison of image codes. J. Opt. Soc. Amer. A Opt. Image Sci. Vision 16 7 (1999) 1587-1601
    • (1999) J. Opt. Soc. Amer. A Opt. Image Sci. Vision , vol.16 , Issue.7 , pp. 1587-1601
    • Lewicki, M.S.1    Olshausen, B.A.2
  • 11
    • 0034133184 scopus 로고    scopus 로고
    • Learning overcomplete representations
    • Lewicki M.S., and Sejnowski T.J. Learning overcomplete representations. Neural Comput. 12 (2000) 337-365
    • (2000) Neural Comput. , vol.12 , pp. 337-365
    • Lewicki, M.S.1    Sejnowski, T.J.2
  • 12
    • 0032624821 scopus 로고    scopus 로고
    • Blind source separation of more sources than mixtures using overcomplete representations
    • Lee T.W., Lewicki M.S., Girolami M., and Sejnowski T.J. Blind source separation of more sources than mixtures using overcomplete representations. IEEE Signal Process. Lett. 6 (1999) 87-90
    • (1999) IEEE Signal Process. Lett. , vol.6 , pp. 87-90
    • Lee, T.W.1    Lewicki, M.S.2    Girolami, M.3    Sejnowski, T.J.4
  • 14
    • 0043130730 scopus 로고    scopus 로고
    • Gain-shape optimized dictionary for matching pursuit video coding
    • Chou Y.-T., Hwang W.-L., and Huang C.-L. Gain-shape optimized dictionary for matching pursuit video coding. Signal Process. 83 9 (2003) 1937-1943
    • (2003) Signal Process. , vol.83 , Issue.9 , pp. 1937-1943
    • Chou, Y.-T.1    Hwang, W.-L.2    Huang, C.-L.3
  • 15
    • 2942694091 scopus 로고    scopus 로고
    • Dictionary design for matching pursuit and application to motion-compensated video coding
    • Schmid-Saugeon P., and Zakhor A. Dictionary design for matching pursuit and application to motion-compensated video coding. IEEE Trans. Circuits Syst. Video Tech. 14 (2004) 880-886
    • (2004) IEEE Trans. Circuits Syst. Video Tech. , vol.14 , pp. 880-886
    • Schmid-Saugeon, P.1    Zakhor, A.2
  • 16
    • 33750383209 scopus 로고    scopus 로고
    • M. Aharon, M. Elad, A. Bruckstein, The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation, IEEE Trans. Signal Process. (2005), in press
  • 17
    • 37949037513 scopus 로고    scopus 로고
    • M. Aharon, M. Elad, A. Bruckstein, K-SVD: Design of dictionaries for sparse representations, in: Proceedings of SPARS '05, Rennes, France, November 2005
  • 18
    • 33646802991 scopus 로고    scopus 로고
    • S. Lesage, R. Gribonval, F. Bimbot, L. Benaroya, Learning unions of orthonormal bases with thresholded singular value decomposition, in: International Conference on Acoustics Speech and Signal Processing, Philadelphia, USA, March 2005
  • 19
    • 37949045948 scopus 로고    scopus 로고
    • P. Jost, P. Vandergheynst, S. Lesage, R. Gribonval, Learning redundant dictionaries with translation invariance property: The motif algorithm, in: Proceedings of SPARS '05, Rennes, France, November 2005
  • 20
    • 0032627073 scopus 로고    scopus 로고
    • K. Engan, S.O. Aase, J.H. Husøy, Method of optimal directions for frame design, in: Proceedings of ICASSP '99, Phoenix, USA, March 1999, pp. 2443-2446
  • 21
    • 0034299822 scopus 로고    scopus 로고
    • Multi-frame compression: Theory and design
    • Engan K., Aase S.O., and Husøy J.H. Multi-frame compression: Theory and design. Signal Process. 80 (2000) 2121-2140
    • (2000) Signal Process. , vol.80 , pp. 2121-2140
    • Engan, K.1    Aase, S.O.2    Husøy, J.H.3
  • 23
    • 37948998726 scopus 로고    scopus 로고
    • K. Skretting, K. Engan, J.H. Husøy, S.O. Aase, Sparse representation of images using overlapping frames, in: Proceedings of SCIA '01, Bergen, Norway, June 2001
  • 24
    • 77949354879 scopus 로고    scopus 로고
    • K. Skretting, J.H. Husøy, S.O. Aase, A simple design of sparse signal representations using overlapping frames, in: Proceedings of ISPA '01, 2001, pp. 424-428
  • 28
    • 0029291966 scopus 로고
    • Sparse approximate solutions to linear systems
    • Natarajan B.K. Sparse approximate solutions to linear systems. SIAM J. Comput. 24 (1995) 227-234
    • (1995) SIAM J. Comput. , vol.24 , pp. 227-234
    • Natarajan, B.K.1
  • 29
    • 0029184945 scopus 로고
    • Efficient computational schemes for the orthogonal least squares algorithm
    • Chng E.S., Chen S., and Mulgrew B. Efficient computational schemes for the orthogonal least squares algorithm. IEEE Trans. Signal Process. 43 (1995) 373-376
    • (1995) IEEE Trans. Signal Process. , vol.43 , pp. 373-376
    • Chng, E.S.1    Chen, S.2    Mulgrew, B.3
  • 30
    • 0031625503 scopus 로고    scopus 로고
    • M. Gharavi-Alkhansari, T.S. Huang, A fast orthogonal matching pursuit algorithm, in: International Conference on Acoustics Speech and Signal Processing, Seattle, USA, May 1998, pp. 1389-1392
  • 33
    • 0031102203 scopus 로고    scopus 로고
    • Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm
    • Gorodnitsky I.F., and Rao B.D. Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm. IEEE Trans. Signal Process. 45 (1997) 600-616
    • (1997) IEEE Trans. Signal Process. , vol.45 , pp. 600-616
    • Gorodnitsky, I.F.1    Rao, B.D.2
  • 35
    • 0037418225 scopus 로고    scopus 로고
    • D.L. Donoho, M. Elad, Maximal sparsity representation via l1 minimization, in: Proceedings of National Academy of Science, vol. 100, March 2003, pp. 2197-2202
  • 36
    • 0347968052 scopus 로고    scopus 로고
    • Sparse representations in unions of bases
    • Gribonval R., and Nielsen M. Sparse representations in unions of bases. IEEE Trans. Inform. Theory 49 (2003) 3320-3325
    • (2003) IEEE Trans. Inform. Theory , vol.49 , pp. 3320-3325
    • Gribonval, R.1    Nielsen, M.2
  • 37
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • Tropp J.A. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50 (2004) 2231-2242
    • (2004) IEEE Trans. Inform. Theory , vol.50 , pp. 2231-2242
    • Tropp, J.A.1
  • 38
    • 26844461512 scopus 로고    scopus 로고
    • Recovery of exact sparse representations in the presence of bounded noise
    • Fuchs J.J. Recovery of exact sparse representations in the presence of bounded noise. IEEE Trans. Inform. Theory 51 (2005) 3601-3608
    • (2005) IEEE Trans. Inform. Theory , vol.51 , pp. 3601-3608
    • Fuchs, J.J.1
  • 39
    • 37949019536 scopus 로고    scopus 로고
    • K. Engan, Frame based signal representation and compression, Ph.D. thesis, University of Stavanger/NTNU, Stavanger, Norway, September 2000, available at: http://www.ux.uis.no/~kjersti/
  • 40
    • 37949027969 scopus 로고    scopus 로고
    • K. Engan, J.R. Akselsen, Comparison of frame based coding (FBC) with multi stage vector quantization (MSVQ), in: Proceedings NORSIG '01, Trondheim, Norway, October 2001, pp. 123-128
  • 42
    • 37949011979 scopus 로고    scopus 로고
    • M. Aharon, M. Elad, A. Bruckstein, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, J. Linear Algebra Appl. (2005), in press
  • 43
    • 30844440076 scopus 로고    scopus 로고
    • M. Aharon, M. Elad, A. Bruckstein, K-SVD and its non-negative variant for dictionary design, in: Proceedings of the SPIE Conference Wavelets, vol. 5914, July 2005
  • 44
    • 37949003394 scopus 로고    scopus 로고
    • K. Skretting, Sparse signal representation using overlapping frames, Ph.D. thesis, Stavanger University College/NTNU, Stavanger, Norway, 2002, available at: http://www.ux.his.no/~karlsk/
  • 46
    • 37949033781 scopus 로고    scopus 로고
    • K. Skretting, J.H. Husøy, Texture classification using sparse frame based representation, J. Appl. Signal Process., in press
  • 47
    • 37949048096 scopus 로고    scopus 로고
    • J. Herredsvela, K. Engan, T.O. Gulsrud, K. Skretting, Texture classification using sparse representations by learned compound dictionaries, in: Proceedings of SPARS '05, Rennes, France, November 2005
  • 49
    • 0033943019 scopus 로고    scopus 로고
    • Wavelet compression of ECG signals by the set partitioning in hierarchical trees algorithm
    • Lu Z., Kim D.Y., and Pearlman W.A. Wavelet compression of ECG signals by the set partitioning in hierarchical trees algorithm. IEEE Trans. Biomed. Eng. 47 (2000) 849-856
    • (2000) IEEE Trans. Biomed. Eng. , vol.47 , pp. 849-856
    • Lu, Z.1    Kim, D.Y.2    Pearlman, W.A.3
  • 50
    • 0034306386 scopus 로고    scopus 로고
    • ECG signal compression using analysis by synthesis coding
    • Zigel Y., Cohen A., and Katz A. ECG signal compression using analysis by synthesis coding. IEEE Trans. Biomed. Eng. 47 (2000) 1308-1316
    • (2000) IEEE Trans. Biomed. Eng. , vol.47 , pp. 1308-1316
    • Zigel, Y.1    Cohen, A.2    Katz, A.3
  • 52
    • 37949043758 scopus 로고    scopus 로고
    • The MIT-BIH Arrhythmia Database CD-ROM, second ed., MIT Press, Cambridge, 1992


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.