Compressed sensing to short duration voltage variation signal sparse in redundant dictionary

Compressed sensing (CS) is a novel data acquisition method that makes full use of the sparsity of signal. This paper presents a number of results regarding the construction of redundant dictionary for short duration voltage variation (SDVV) signal compressed sensing. The redundant dictionary was the union of three orthonormal bases: Discrete Fourier Transform (DFT), db1 wavelet transform (WT) and db4 WT bases. To getting a small number of measurements, the Gaussian random matrix was chosen for linear non-adaptive measurements of SDVV signals, due to its small restricted isometry constants. The orthogonal matching pursuit, a kind of greedy algorithms, was used for reconstruction finally. Numerical experiments showed that the compression results obtained using the CS concept based on redundant dictionary are better than that those using the orthonormal bases such as DFT and WT bases. The SNR of recovered signals were higher than 25dB in the redundant dictionary, while fewer iterations were used with respected to the orthonormal bases.

[1]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[2]  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.

[3]  S. Santoso,et al.  Power quality disturbance data compression using wavelet transform methods , 1997 .

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

[5]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

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

[7]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

[8]  David L. Donoho,et al.  Sparse Solution Of Underdetermined Linear Equations By Stagewise Orthogonal Matching Pursuit , 2006 .

[9]  Zhao Yong An Approach for Compressive Sampling and Reconstruction of Transient and Short-Time Power Quality Disturbance Signals , 2012 .

[10]  Pierre Vandergheynst,et al.  Compressed Sensing and Redundant Dictionaries , 2007, IEEE Transactions on Information Theory.

[11]  R. DeVore,et al.  Compressed sensing and best k-term approximation , 2008 .

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

[13]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[14]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .