Image reconstruction using Orthogonal Matching Pursuit (OMP) algorithm

Proceedings on 2014 2nd International Conference on "Emerging Technology Trends in Electronics, Communication and Networking", ET2ECN 2014

Volumn , Issue , 2015, Pages

  Goklani, Hemant S ^a   Sarvaiya, Jignesh N ^a   Fahad, A M ^a  

^a SARDAR VALLABHBHAI NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Compressed sensing; Nyquist rate; OMP; Sampling

Indexed keywords

COMPRESSED SENSING; DIGITAL STORAGE; SAMPLING;

LOW DIMENSIONAL STRUCTURE; NYQUIST RATE; NYQUIST SAMPLING; ORTHOGONAL MATCHING PURSUIT; RECEIVED SIGNALS; SAMPLING RATES; SIGNAL AND IMAGE PROCESSING; SIGNAL BANDWIDTH;

IMAGE RECONSTRUCTION;

EID: 84925847060     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ET2ECN.2014.7044960     Document Type: Conference Paper

References (19)

1. V. Kotelnikov, "On the carrying capacity of the ether and wire in telecommunications". In Izd. Red. Upr. Svyazi RKKA, Moscow, Russia, 1933.
2. H. Nyquist, "Certain topics in telegraph transmission theory", Trans. AIEE, 47:617-644, 1928.
3. C. Shannon, "Communication in the presence of noise", Proc. Institute of Radio Engineers, 37 (1): 1021, 1949.
4. E. Whittaker, " On the functions which are represented by the expansions of the interpolation theory", Proc. Royal Soc. Edinburgh, Sec. A, 35:181-194, 1915.
5. J. Claerbout and F. Muir, "Robust modeling with erratic data: Geo-physics", v. 38, CrossRef [Web of Science], pp. 826-844, 1973.
6. M. Unser, "Sampling-50 years after Shannon", Proceedings of the IEEE, vol. 88, no. 4, pp. 569-587, 2000.
7. E. Candes, "Compressive sampling", In Proc. Int. Congress of Math., Madrid, Spain, Aug. 2006.
8. D. Donoho, "Compressed sensing", IEEE Trans. Inform. Theory, 52(4):1289-1306, 2006.
9. Qaisar, S, Bilal, R. M, Iqbal W, Naureen M, Sungyoung Lee, "Compresseive sensing: From theory to applications, a survery, ", Communications and Networks, Journal of, vol. 15, no. 5, pp. 443-456, Oct. 2013.
10. E. Candes and B. Recht, "Exact matrix completion via convex optimization", Foundations of Computational Mathematics, vol. 9, no. 6, pp. 717-772, 2009.
11. Tropp, J. A, "Greed is good: algorithmic results for sparse approximation, " Information Theory, IEEE Transactions on, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
12. T. Blumensath and M. Davies, "Iterative hard thresholding for compressed sensing", Applied and Computational Harmonic Analysis, vol. 27, no. 3, pp. 265-274, 2009.
13. D. Donoho, "De-noising by soft-thresholding, Information Theory", IEEE Transactions on, vol. 41, no. 3, pp. 613-627, 2002.
14. D. Du and F. Hwang, "Combinatorial group testing and its applications", World Scientific Pub Co Inc, 2000.
15. Ling Ma, "On algorithms for non convex optimization", Carnegie Melton University, Noel Walkington, 1993.
16. W. Yin, S. Osher, D. Goldfarb, and J. Darbon, "Brgman iterative algorithms for l1-minimization with applications to compressed sensing", SIAM J. Imaging Sci, vol. 1, no. 1, pp. 143-168, 2008.
17. E. Candes, "The restricted isometry property and its implications for compressed sensing", Comptes Rendus Mathematique, vol. 346, no. 9-10, pp. 589-592, 2008.
18. S. Mallat and Z. Zhang, "Matching Pursuits with time frequency dictionaries", IEEE Transactions on signal processing, vol. 41, no. 12, pp. 3397-3415, 1993.
19. J. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit", IEEE Transactions on Information Theory, vol. 53, no. 12, p. 4655, 2007.