메뉴 건너뛰기




Volumn , Issue , 2009, Pages 3445-3448

A low complexity orthogonal matching pursuit for sparse signal approximationwith shift-invariant dictionaries

Author keywords

Greedy algorithms; Orthogonal matching pursuit; Shift invariance; Sparse approximation

Indexed keywords

APPROXIMATION ERRORS; APPROXIMATION PERFORMANCE; AUDIO SIGNAL; COMPUTATIONAL COSTS; GREEDY ALGORITHMS; LOW COMPLEXITY; MATCHING PURSUIT; NUMERICAL EXPERIMENTS; ORTHOGONAL MATCHING PURSUIT; SHIFT INVARIANT; SHIFT-INVARIANCE; SPARSE APPROXIMATION; SPARSE SIGNALS; TIME FREQUENCY;

EID: 70349226893     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2009.4960366     Document Type: Conference Paper
Times cited : (48)

References (6)
  • 1
    • 0027842081 scopus 로고
    • Matching pursuit with time-frequency dictionaries
    • Dec
    • S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries," IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3397-3415, Dec 1993.
    • (1993) IEEE Transactions on Signal Processing , vol.41 , Issue.12 , pp. 3397-3415
    • Mallat, S.1    Zhang, Z.2
  • 2
    • 0027814133 scopus 로고    scopus 로고
    • th Annual Asilomar Conf. on Signals, Systems and Computers, Nov. 1993.
    • th Annual Asilomar Conf. on Signals, Systems and Computers, Nov. 1993.
  • 3
    • 70349198536 scopus 로고    scopus 로고
    • In greedy pursuit of new directions: (nearly) orthogonal matching pursuit by directional optimisation
    • Lausanne, August
    • T. Blumensath and M.E. Davies, "In greedy pursuit of new directions: (nearly) orthogonal matching pursuit by directional optimisation," in Proc. EUropean SIgnal Processing COnference (EUSIPCO'08), Lausanne, August 2008.
    • (2008) Proc. EUropean SIgnal Processing COnference (EUSIPCO'08)
    • Blumensath, T.1    Davies, M.E.2
  • 4
    • 50649107089 scopus 로고    scopus 로고
    • Approximation and learning by greedy algorithms
    • Andrew R. Barron, Albert Cohen, Wolfgang Dahmen, and Ronald A. DeVore, "Approximation and learning by greedy algorithms," Annals of statistics, vol. 36, no. 1, pp. 64-94, 2008.
    • (2008) Annals of statistics , vol.36 , Issue.1 , pp. 64-94
    • Barron, A.R.1    Cohen, A.2    Dahmen, W.3    DeVore, R.A.4


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