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 条
  • [1] Signal and Noise Statistics Oblivious Orthogonal Matching Pursuit
    Kallummil, Sreejith
    Kalyani, Sheetal
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80, 2018, 80
  • [2] Blended Matching Pursuit
    Combettes, Cyrille W.
    Pokutta, Sebastian
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [3] Kernel Matching Pursuit
    Pascal Vincent
    Yoshua Bengio
    Machine Learning, 2002, 48 : 165 - 187
  • [4] Multipath Matching Pursuit
    Kwon, Suhyuk
    Wang, Jian
    Shim, Byonghyo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (05) : 2986 - 3001
  • [5] Multiplivative matching pursuit
    Serir, A
    Pesquet, JC
    2000 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS, VOLS I-VI, 2000, : 1935 - 1938
  • [6] Kernel matching pursuit
    Vincent, P
    Bengio, Y
    MACHINE LEARNING, 2002, 48 (1-3) : 165 - 187
  • [7] Oblique matching pursuit
    Rebollo-Neira, Laura
    IEEE SIGNAL PROCESSING LETTERS, 2007, 14 (10) : 703 - 706
  • [8] Subspace Pursuit Embedded in Orthogonal Matching Pursuit
    Ambat, Sooraj K.
    Chatterjee, Saikat
    Hari, K. V. S.
    TENCON 2012 - 2012 IEEE REGION 10 CONFERENCE: SUSTAINABLE DEVELOPMENT THROUGH HUMANITARIAN TECHNOLOGY, 2012,
  • [9] Batch Algorithms of Matching Pursuit and Orthogonal Matching Pursuit with Applications to Compressed Sensing
    Wang, Huiyuan
    Vieira, Jose
    Ferreira, Paulo
    Jesus, Bruno
    Duarte, Isabel
    ICIA: 2009 INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, VOLS 1-3, 2009, : 809 - 814
  • [10] Optimization of matching pursuit encoder based on analytical approximation of matching pursuit distortion
    Shoa, Alireza
    Shirani, Shahram
    2006 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO - ICME 2006, VOLS 1-5, PROCEEDINGS, 2006, : 749 - +