On the statistics of matching pursuit angles

被引:8
|
作者
Lovisolo, Lisandro [1 ]
da Silva, Eduardo A. B. [2 ]
Diniz, Paulo S. R. [2 ]
机构
[1] Univ Estado Rio De Janeiro, DETEL, PROSAICO, PEL, Rio De Janeiro, Brazil
[2] Univ Fed Rio de Janeiro, LPS, COPPE, Rio de Janeiro, Brazil
关键词
Source coding; Overcomplete representations; Matching pursuits; Lloyd-Max quantization; MODULUS QUANTIZATION; REPRESENTATIONS; COMPRESSION; SIGNALS;
D O I
10.1016/j.sigpro.2010.05.021
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Matching pursuit decompositions have been employed for signal coding. For this purpose, matching pursuit coefficients need to be quantized. However, their behavior has been shown to be chaotic in some cases; posing difficulties to their modeling and quantizer design. In this work, a different approach is presented. Instead of trying to model the statistics of matching pursuit coefficients, the statistics of the angle between the residue signal and the element selected in each iteration of the matching pursuit are studied, what allows to model matching pursuits coefficients indirectly. This approach results in a simple statistical model. This is so because one observes that the statistics of such angles do not vary substantially after the first matching pursuit iteration, and can be approximately modeled as independent and identically distributed. Moreover, it is also observed that the probability density functions of matching pursuit angles are reasonably modeled by a single probability density function. This function depends only on the dictionary employed and not on the signal source. The derived statistical model is validated by employing it to design Lloyd-Max quantizers for matching pursuit coefficients. The Lloyd-Max quantizers obtained show good rate x distortion performance when compared to the state-of-the-art methods. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:3164 / 3184
页数:21
相关论文
共 50 条
  • [21] The design of matching pursuit filters
    Phillips, PJ
    NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1998, 9 (01) : 1 - 17
  • [22] Fast Bayesian Matching Pursuit
    Schniter, Philip
    Potter, Lee C.
    Ziniel, Justin
    2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2008, : 368 - 375
  • [23] A posteriori quantized matching pursuit
    Frossard, P
    Vandergheynst, P
    DCC 2001: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2001, : 495 - 495
  • [24] Oblique Projection Matching Pursuit
    Jian Wang
    Feng Wang
    Yunquan Dong
    Byonghyo Shim
    Mobile Networks and Applications, 2017, 22 : 377 - 382
  • [25] Refining Kernel Matching Pursuit
    Li, Jianwu
    Lu, Yao
    ADVANCES IN NEURAL NETWORKS - ISNN 2010, PT 2, PROCEEDINGS, 2010, 6064 : 25 - 32
  • [26] Oblique Projection Matching Pursuit
    Wang, Jian
    Wang, Feng
    Dong, Yunquan
    Shim, Byonghyo
    MOBILE NETWORKS & APPLICATIONS, 2017, 22 (03): : 377 - 382
  • [27] Perturbed Orthogonal Matching Pursuit
    Teke, Oguzhan
    Gurbuz, Ali Cafer
    Arikan, Orhan
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (24) : 6220 - 6231
  • [28] Matching pursuit with damped sinusoids
    Goodwin, M
    1997 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I - V: VOL I: PLENARY, EXPERT SUMMARIES, SPECIAL, AUDIO, UNDERWATER ACOUSTICS, VLSI; VOL II: SPEECH PROCESSING; VOL III: SPEECH PROCESSING, DIGITAL SIGNAL PROCESSING; VOL IV: MULTIDIMENSIONAL SIGNAL PROCESSING, NEURAL NETWORKS - VOL V: STATISTICAL SIGNAL AND ARRAY PROCESSING, APPLICATIONS, 1997, : 2037 - 2040
  • [29] Adaptive quantization for matching pursuit
    Shoa, Alireza
    Shirani, Shahram
    2006 IEEE WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING, 2006, : 71 - +
  • [30] MATCHING PURSUIT WITH STOCHASTIC SELECTION
    Peel, Thomas
    Emiya, Valentin
    Ralaivola, Liva
    Anthoine, Sandrine
    2012 PROCEEDINGS OF THE 20TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2012, : 879 - 883