Sparse Representation and Recovery of a Class of Signals Using Information Theoretic Measures

被引:0
|
作者
Meena, V. [1 ]
Abhilash, G. [1 ]
机构
[1] Natl Inst Technol Calicut, Dept Elect & Commun Engn, Calicut 673601, Kerala, India
关键词
Sparse representation; morphological component analysis; sparsity gain; matching pursuit; entropy; wavelet packet decomposition;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we discuss a novel scheme for arriving at a sparse representation and recovery of a class of signals using information theoretic measures. Constituent components containing distinct features of any signal, belonging to a specific class, are separated and represented sparsely in an appropriate fixed basis. The morphological correlation between each of the constituent components and a subset of basis leads to sparse representation of the signal in that basis. The basis is selected using entropy minimization based method which is known to result in coefficient concentration. Simulation studies on speech signals show that in the presence of input noise, the proposed method outperforms conventional methods.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] Information-Theoretic Characterization of Sparse Recovery
    Aksoylar, Cem
    Saligrama, Venkatesh
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 33, 2014, 33 : 38 - 46
  • [2] Information-Theoretic Bounds for Adaptive Sparse Recovery
    Aksoylar, Cem
    Saligrama, Venkatesh
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1311 - 1315
  • [3] Exact recovery of sparse signals with side information
    Xiaohu Luo
    Nianci Feng
    Xuhui Guo
    Zili Zhang
    EURASIP Journal on Advances in Signal Processing, 2022
  • [4] Exact recovery of sparse signals with side information
    Luo, Xiaohu
    Feng, Nianci
    Guo, Xuhui
    Zhang, Zili
    EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2022, 2022 (01)
  • [5] On Support Recovery With Sparse CCA: Information Theoretic and Computational Limits
    Laha, Nilanjana
    Mukherjee, Rajarshi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (03) : 1695 - 1738
  • [6] Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
    Cai, T. Tony
    Zhang, Anru
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (01) : 122 - 132
  • [7] Information-theoretic limits on sparse support recovery: Dense versus sparse measurements
    Wang, Wei
    Wainwright, Martin J.
    Ramchandran, Kannan
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2197 - 2201
  • [8] Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
    Wang, Wei
    Wainwright, Martin J.
    Ramchandran, Kannan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (06) : 2967 - 2979
  • [9] Using information theoretic distance measures for solving the permutation problem of blind source separation of speech signals
    Eugen Hoffmann
    Dorothea Kolossa
    Bert-Uwe Köhler
    Reinhold Orglmeister
    EURASIP Journal on Audio, Speech, and Music Processing, 2012
  • [10] Using information theoretic distance measures for solving the permutation problem of blind source separation of speech signals
    Hoffmann, Eugen
    Kolossa, Dorothea
    Koehler, Bert-Uwe
    Orglmeister, Reinhold
    EURASIP JOURNAL ON AUDIO SPEECH AND MUSIC PROCESSING, 2012,