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 条
  • [31] Generalized Orthogonal Matching Pursuit
    Wang, Jian
    Kwon, Seokbeop
    Shim, Byonghyo
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (12) : 6202 - 6216
  • [32] Federated Gradient Matching Pursuit
    Jeong, Halyun
    Needell, Deanna
    Qin, Jing
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (06) : 4512 - 4537
  • [33] Statistics of polarisation matching
    Naus, H. W. L.
    Zwamborn, A. P. M.
    IET SCIENCE MEASUREMENT & TECHNOLOGY, 2014, 8 (04) : 196 - 202
  • [34] MATCHING, STATISTICS, AND COMMONSENSE
    BAUM, WM
    JOURNAL OF THE EXPERIMENTAL ANALYSIS OF BEHAVIOR, 1983, 39 (03) : 499 - 501
  • [35] Orthogonal Matching Pursuit Algorithm Via Improved Matching Criterion
    Jianhong-Xiang
    Huihui-Yue
    Xiangjun-Yin
    2018 2ND INTERNATIONAL CONFERENCE ON DIGITAL SIGNAL PROCESSING (ICDSP 2018), 2018, : 27 - 31
  • [36] Orthogonal Matching Pursuit on Faulty Circuits
    Li, Yao
    Chi, Yuejie
    Huang, Chu-Hsiang
    Dolecek, Lara
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (07) : 2541 - 2554
  • [37] Matching pursuit parametrization of sleep spindles
    Durka, PJ
    Blinowska, KJ
    PROCEEDINGS OF THE 18TH ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY, VOL 18, PTS 1-5, 1997, 18 : 1011 - 1012
  • [38] Matching pursuit with unbounded parameter domains
    Wei Qu
    Yanbo Wang
    Xiaoyun Sun
    Advances in Computational Mathematics, 2024, 50
  • [39] Fractal video coding by matching pursuit
    GharaviAlkhansari, M
    Huang, TS
    INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, PROCEEDINGS - VOL I, 1996, : 157 - 160
  • [40] Dictionary Learning with Equiprobable Matching Pursuit
    Sandin, Fredrik
    Martin-del-Campo, Sergio
    2017 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2017, : 557 - 564