Partially Knowing of Least Support Orthogonal Matching Pursuit (PKLS-OMP) for Recovering Signal

Given a large sparse signal, great wishes are to
reconstruct the signal precisely and accurately from lease number of
measurements as possible as it could. Although this seems possible
by theory, the difficulty is in built an algorithm to perform the
accuracy and efficiency of reconstructing. This paper proposes a new
proved method to reconstruct sparse signal depend on using new
method called Least Support Matching Pursuit (LS-OMP) merge it
with the theory of Partial Knowing Support (PSK) given new method
called Partially Knowing of Least Support Orthogonal Matching
Pursuit (PKLS-OMP).
The new methods depend on the greedy algorithm to compute the
support which depends on the number of iterations. So to make it
faster, the PKLS-OMP adds the idea of partial knowing support of its
algorithm. It shows the efficiency, simplicity, and accuracy to get
back the original signal if the sampling matrix satisfies the Restricted
Isometry Property (RIP).
Simulation results also show that it outperforms many algorithms
especially for compressible signals.

• Israa Sh. Tawfic
• Sema Koc Kayhan

• Compressed sensing
• Lest Support Orthogonal Matching Pursuit
• Partial Knowing Support
• Restricted isometry property
• signal reconstruction.

[1] Wei Dai and Olgica Milenkovic, “Subspace Pursuit for Compressive
Sensing: Closing the Gap Between Performance and Complexity”,
International Journal of Electronics and Computer Science Engineering
2010.
[2] Entao Liu and V.N. “Orthogonal Super Greedy Algorithm and
Applications in Compressed Sensing”, IEEE Trans. Inform. Theory 58
(4), 2040-2047,2011
[3] D. Needel and J. A. Tropp“COSAMP: Iterative Signal Recovery from
Incomplete and Inaccurate Samples”, Elsevier applied and
Computational Harmonic. Anal. 26 (2009) 301–321 Volume 26, Issue 3,
[4] Wei Dai, and Olgica Milenkovic , “Subspace Pursuit for Compressive
Sensing Signal Reconstruction”, IEEE, 5, May (2009).
[5] Parichat Sermwuthisarn, Duangrat Gansawat, “Impulsive noise rejection
method for compressed measurement signal in compressed sensing”,
EURASIP Journal on advances in signal processing 2012.
[6] Tony TonyCai, Lie Wang, and GuangwuXu, “ Stable Recovery of
Sparse Signals and an Oracle Inequality “, IEEE Transactions On
Information Theory, Vol. 56, No. 7, July 2010.
[7] Jian Wang and ByonghyoShim , “A Simple Proof of the Mutual
Incoherence Condition for Orthogonal Matching Pursuit”, arXiv
1105.4408v1 (cs.It), 23 May (2011).
[8] Richard Baraniuk, “Compressive sensing”, IEEE Signal Processing
Magazine, 24(4), pp. 118-121, July 2007.
[9] Joel A. Tropp, and Anna C. Gilber, “Signal Recovery From Random
Measurements Via Orthogonal Matching Pursuit”, IEEE Transactions on
Theory, vol. 53, NO. 12, DECEMBER 2007
[10] Parichat Sermwuthisarn, Supatana Auethavekiat, ”Robust reconstruction
algorithm for compressed sensing in Gaussian noise environment using
orthogonal matching pursuit with partially known support and random
sub sampling”, EURASIP Journal on Advances in Signal Processing
2012/1/3
[11] Parichat Sermwuthisarn, Supatana Auethavekiat, “Impulsive noise
rejection method for compressed measurement signal in compressed
sensing ”,EURASIP Journal on Advances in Signal Processing , 2012:68
[12] Jian Wang and Byonghyo Shim , “A Simple Proof of the Mutual
Incoherence Condition for Orthogonal Matching Pursuit”, arXiv
1105.4408v1 (cs.It), 23 May (2011).