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

[thumbnail of xplore_05947162.pdf] PDF
xplore_05947162.pdf
Restricted to Registered users only

Download (708kB) | Request a copy

Abstract

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
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Electronics
Faculty of Engineering and Natural Sciences
Depositing User: Hakan Erdoğan
Date Deposited: 25 Dec 2011 16:03
Last Modified: 26 Apr 2022 09:05
URI: https://research.sabanciuniv.edu/id/eprint/18476

Actions (login required)

View Item
View Item