A novel signal sparse decomposition based on modulation correlation partition

The prohibitive computational complexity caused by redundant dictionary which is used in signal sparse decomposition has always been perplexing researchers of signal processing all the time. However, large over-complete dictionaries are essential to approximate the signal. In this paper, a decomposition algorithm based on modulation correlation partition (PBMC) is introduced, which improves the process of searching matched atoms in the redundant dictionary of functions. Through analyzing the structure of signals, we unite the frequency factor and phase factor to obtain the 2D modulation factor. The over-complete dictionary is partitioned into several sub-dictionaries according to the modulation correlation of atoms. Each sub-dictionary is represented by a single selected atom which is used in the greedy algorithm. At the end of this paper, experimental results show that the computational complexity of signal sparse decomposition can be adequately reduced by partitioning over-complete dictionary without impacting the decomposition result. HighlightsAn algorithm that raises efficiency of matching pursuit is proposed.Partition strategy is introduced to improve structure of redundant dictionary.The proposed approach is more effective than the traditional ones and has robustness.

[1]  Xiao Ma,et al.  State Estimation over a Semi-Markov Model Based Cognitive Radio System , 2012, IEEE Transactions on Wireless Communications.

[2]  P. Frossard,et al.  Tree-Based Pursuit: Algorithm and Properties , 2006, IEEE Transactions on Signal Processing.

[3]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[4]  H. Vincent Poor,et al.  Wideband Spectrum Sensing With Sub-Nyquist Sampling in Cognitive Radios , 2012, IEEE Transactions on Signal Processing.

[5]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[6]  Xiao Ma,et al.  Stochastic modeling of short-term power consumption for smart grid: A state space approach and real measurement demonstration , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[7]  Michael Elad,et al.  Dictionaries for Sparse Representation Modeling , 2010, Proceedings of the IEEE.

[8]  Kenneth E. Barner,et al.  Locality Constrained Dictionary Learning for Nonlinear Dimensionality Reduction , 2013, IEEE Signal Processing Letters.

[9]  Heather Bourbeau.  Greed Is Good , 2004 .

[10]  Laurent Daudet,et al.  Sparse and structured decompositions of signals with the molecular matching pursuit , 2006, IEEE Transactions on Audio, Speech, and Language Processing.

[11]  Christine Guillemot,et al.  Image compression using the Iteration-Tuned and Aligned Dictionary , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[12]  John S. Thompson,et al.  A Singular-Value-Based Adaptive Modulation and Cooperation Scheme for Virtual-MIMO Systems , 2011, IEEE Transactions on Vehicular Technology.

[13]  Minh N. Do,et al.  Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction , 2006, 2006 International Conference on Image Processing.

[14]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[16]  Stéphane Mallat,et al.  Matching pursuit of images , 1995, Proceedings., International Conference on Image Processing.

[17]  Tareq Y. Al-Naffouri,et al.  Sparse Reconstruction Using Distribution Agnostic Bayesian Matching Pursuit , 2013, IEEE Transactions on Signal Processing.

[18]  Pascal Frossard,et al.  Tree-Based Pursuit , 2004 .

[19]  Rémi Gribonval,et al.  Fast matching pursuit with a multiscale dictionary of Gaussian chirps , 2001, IEEE Trans. Signal Process..

[20]  Christine Guillemot,et al.  Sparse approximation with an orthogonal complementary matching pursuit algorithm , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[21]  G. MallatS..  A Theory for Multiresolution Signal Decomposition , 1989 .

[22]  Sun Lin-hui.  A Survey on Orthogonal Matching Pursuit Type Algorithms for Signal Compression and Reconstruction , 2013 .

[23]  Zhilu Wu,et al.  Cognitive Radio Engine Design Based on Ant Colony Optimization , 2012, Wirel. Pers. Commun..

[24]  Philipos C. Loizou,et al.  Voiced/unvoiced speech discrimination in noise using Gabor atomic decomposition , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[25]  Yihong Gong,et al.  Nonlinear Learning using Local Coordinate Coding , 2009, NIPS.

[26]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[27]  M. Elad,et al.  Improving the k-svd facial image compression using a linear deblocking method , 2008, 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel.

[28]  Zhang Yue-fei.  Set Partitioning of the Over-complete Dictionary in Signal Sparse Decomposition , 2006 .

[29]  Michael Elad,et al.  Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries , 2006, IEEE Transactions on Image Processing.

[30]  Avideh Zakhor,et al.  Very low bit-rate video coding based on matching pursuits , 1997, IEEE Trans. Circuits Syst. Video Technol..

[31]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[32]  Yihong Gong,et al.  Locality-constrained Linear Coding for image classification , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.