DocumentCode
2178073
Title
Sorted Random Matrix for Orthogonal Matching Pursuit
Author
Wang, Zhenglin ; Lee, Ivan
Author_Institution
Sch. of Comput. & Inf. Sci., Univ. of South Australia, Adelaide, SA, Australia
fYear
2010
fDate
1-3 Dec. 2010
Firstpage
116
Lastpage
120
Abstract
Orthogonal Matching Pursuit (OMP) algorithm is widely applied to compressive sensing (CS) image signal recovery because of its low computation complexity and its ease of implementation. However, OMP usually needs more measurements than some other recovery algorithms in order to achieve equal-quality reconstructions. This article firstly illustrates the fundamental idea of OMP and the specific algorithm steps. And then, two limitations leading to the previous issue are addressed. Finally, a sorted random matrix is proposed to be used as a measurement matrix to improve those two limitations. The experimental results show the proposed measurement matrix is able to help OMP make a great progress on the quality of recovered approximations.
Keywords
image reconstruction; iterative methods; matrix algebra; compressive sensing; computation complexity; equal quality reconstruction; image processing; image signal recovery; orthogonal matching pursuit; random matrix; Compressed sensing; Discrete cosine transforms; Image coding; Image reconstruction; Matching pursuit algorithms; Signal processing; Signal processing algorithms; compressive sensing; image processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Image Computing: Techniques and Applications (DICTA), 2010 International Conference on
Conference_Location
Sydney, NSW
Print_ISBN
978-1-4244-8816-2
Electronic_ISBN
978-0-7695-4271-3
Type
conf
DOI
10.1109/DICTA.2010.29
Filename
5692550
Link To Document