INFORMATION CHANGE THE WORLD

International Journal of Image, Graphics and Signal Processing(IJIGSP)

ISSN: 2074-9074 (Print), ISSN: 2074-9082 (Online)

Published By: MECS Press

IJIGSP Vol.8, No.10, Oct. 2016

Compressive Sensing based Image Reconstruction Using Generalized Adaptive OMP with Forward-Backward Movement

Full Text (PDF, 787KB), PP.19-28


Views:69   Downloads:1

Author(s)

Meenakshi, Sumit Budhiraja

Index Terms

Compressed Sensing;Sparse representation;Image reconstruction; orthogonal matching pursuit;Generalized orthogonal matching pursuit; Forward-backward movement

Abstract

Reconstruction of a sparse signal from fewer observations require compressive sensing based recovery algorithm for saving memory storage. Various sparse recovery techniques including l_1 minimization, greedy pursuit approaches and non-convex optimization requires sparsity to be known in advance. This article presents the generalized adaptive orthogonal matching pursuit with forward-backward movement under the cumulative coherence property; which removes the need of knowledge of sparsity prior to implementation. In this technique, the forward step increases the size of support set and backward step eliminates the misidentified elements. It selects multiple indices on the basis of maximum correlation by forward-backward movement. The size of backward step is kept smaller than the forward one. These forward-backward steps then iterate and increment through the algorithm adaptively and terminate with stopping condition to ensure the identification of significant components. Recovery performance of proposed algorithm is demonstrated via simulation results including reconstruction of sparse signals in noisy and noise free environment. The algorithm has major advantage that it does not require the knowledge of sparsity in advance in contrast to the earlier reconstruction techniques. The evaluation and comparative analysis of result shows that algorithm leads to the increment in recovery performance and efficiency considerably. 

Cite This Paper

Meenakshi, Sumit Budhiraja,"Compressive Sensing based Image Reconstruction Using Generalized Adaptive OMP with Forward-Backward Movement", International Journal of Image, Graphics and Signal Processing(IJIGSP), Vol.8, No.10, pp.19-28, 2016.DOI: 10.5815/ijigsp.2016.10.03

Reference

[1]D. Donoho, "Compressed sensing", IEEE Transactions on Information Theory, vol. 52, pp. 1289-1306, 2006.

[2]E. Candes, T. Tao, "Near optimal Signal recovery from random projections: universal encoding strategies", IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5406 5425, 2006.

[3]Guoxian Huang, Lei Wang, "High-speed Signal Reconstruction for Compressive Sensing Applications", J Sign Process Syst, 2014.

[4]E. Candes, T. Tao, "Decoding by linear programming", IEEE Transactions on Information Theory, vol. 51 no. 12, pp 4203-4215, 2005.

[5]S. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries", IEEE Transactions on signal Processing, vol. 41, pp. 3397-3415, 1993.

[6]J. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit", IEEE Transactions on Information Theory, vol. 55, pp. 2230-229, 2009.

[7]W. Dai and O. Milenkovic,"Subspace pursuit for compressive sensing signal reconstruction", IEEE Transactions on Information Theory, vol. 55, pp. 2230-229, 2014.

[8]S. S. Chen, D. L. Donoho, Michael, and A. Saunders, et al. (1993) "Atomic decomposition by basis pursuit', SIAM Journal on scientific Computing, 20, 33-61.

[9]S. Ji. , Y. Xue, and L. Carin, et al. (2008) "Bayesian compressive sensing", Signal processing, IEEE Transactions on, 56, 2346-2356.

[10]D. Wipf and B. Rao, et al. (2004) "Sparse bayesian learning for basis selection", Signal Processing, IEEE Transactions on, 52, 2153-216.

[11]D. Needell, J. A. Tropp, et al. (2008) "CoSaMP: Iterative signal recovery from incomplete and accurate samples", Appl. Comput. Harmon. Anal, 301-321.

[12]Y. C. Pati, R. Rezaiifar, P. S. Krishna prasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition", in: Proc. 27th Asilomar Conference on Signals, Systems and Computers, vol.1, Los Alamitos, CA, pp. 40–44, 1993.

[13]T. Blumensath, M. Davies, et al. (2008), "Iterative thresholding for sparse approximations", J. Fourier Anal. Appl., vol. 14, pp. 629–654, 2008.

[14]T. Blumensath, M. Davies, "Iterative hard thresholding for compressed sensing", Applied Computing Harmon. Analysis, vol. 27, pp. 265–274, 2009.

[15]B. Shim, J. Wang, S. Kwon, "Generalised orthogonal matching pursuit", IEEE Transactions on Signal Process. vol. 60, no. 4, pp. 6202-6216, 2012.

[16]W. Dai, O. Milen kovic, "Subspace pursuit for compressive sensing signal reconstruction", IEEE Transactions on Information Theory, vol. 55, pp. 2230–2249, 2009.

[17]Nazim Burak Karahanolu, Haken Erdogan, "Compressed Sensing signal recovery via forward-backward pursuit", Digital Signal Processing, vol. 23, pp. 1539-1548, 2013.

[18]Meenakshi, S. Budhiraja, "A Survey of compressive sensing based Greedy pursuit reconstruction algorithms", Int. J. of Image Graphics and Signal Processing, vol. 7, no. 10, pp. 1–10, 2015.

[19]Meenakshi, S. Budhiraja, "Image Reconstruction Using Modified Orthogonal Matching Pursuit And Compressive Sensing", International IEEE Conference on Computing, Communication and Automation (ICCCA2015), pp. 1073 – 1078, 2015.

[20]Joel A. Tropp, Anna C. Gilbert, et al. (2007), "Signal Recovery from Random Measurements via orthogonal matching pursuit", IEEE Transactions on information theory, vol. 53, no. 12, pp. 4655- 4666.

[21]M. A. Davenport, M. B. Wakin, "Analysis of orthogonal matching pursuit using the restricted isometry property", IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4395–4401, 2010.

[22]J. Wang, S. Kwon, B. Shim, "Near optimal bound of orthogonal matching pursuit using restricted isometric constant", EURASIP J. Adv. Signal Process, vol. 8, 2012.

[23]E. Liu, V. N. Temlyakov, "Orthogonal super greedy algorithm and applications in compressed sensing", IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2040–2047, 2011.

[24]J. Wang, B. Shim, "On recovery limit of sparse signals using orthogonal matching pursuit", IEEE Transactions on Signal Process, vol. 60, no. 9, pp. 4973–4976,2012.

[25]Q. Mo, Y. Shen, et al. (2012), "Remarks on the restricted isometry property in orthogonal matching pursuit algorithm", IEEE Trans. Inf. Theory 58 (6), 3654–3656.

[26]J. A. Tropp, "Greed is good: algorithmic results for sparse approximation", IEEE Transactions on Inormation. Theory, vol. 50, no. 10, pp. 2231–2242, 2004.

[27]Hui Sun, Lin Ni, "Compressed Sensing Data Reconstruction Using Adaptive Generalized Orthogonal Matching Pursuit Algorithm", International Conference on Computer Science and Network Technology, pp. 1102-1106, 2013.

[28]Nazim Burak Karahanolu, Haken Erdogan, "Forward-Backward search for compressed sensing signal recovery", 20th European Signal Processing Conference (EUSIPCO), pp. 1429-1433, 2012.