Compressed sensing signal recovery via A* orthogonal matching pursuit

Warning The system is temporarily closed to updates for reporting purpose.

Karahanoğlu, Nazım Burak and Erdoğan, Hakan (2011) Compressed sensing signal recovery via A* orthogonal matching pursuit. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2011), Prague, Czech Republic

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1109/ICASSP.2011.5947162


Reconstruction of sparse signals acquired in reduced dimensions requires the solution with minimum ℓ0 norm. As solving the ℓ0 minimization directly is unpractical, a number of algorithms have appeared for finding an indirect solution. A semi-greedy approach, A* Orthogonal Matching Pursuit (A*OMP), is proposed in [1] where the solution is searched on several paths of a search tree. Paths of the tree are evaluated and extended according to some cost function, for which novel dynamic auxiliary cost functions are suggested. This paper describes the A*OMP algorithm and the proposed cost functions briefly. The novel dynamic auxiliary cost functions are shown to provide improved results as compared to a conventional choice. Reconstruction performance is illustrated on both synthetically generated data and real images, which show that the proposed scheme outperforms well-known CS reconstruction methods.

Item Type:Papers in Conference Proceedings
Uncontrolled Keywords:A* search , auxiliary functions for A* search , best-first search , compressed sensing , orthogonal matching pursuit
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering
ID Code:18476
Deposited By:Hakan Erdoğan
Deposited On:25 Dec 2011 16:03
Last Modified:31 Jul 2019 09:41

Repository Staff Only: item control page