A comparison of termination criteria for A*OMP

Karahanoğlu, Nazım Burak and Erdoğan, Hakan (2012) A comparison of termination criteria for A*OMP. In: 20th European Signal Processing Conference (EUSIPCO 2012), Bucharest, Romania

Full text not available from this repository. (Request a copy)


Heuristic search has recently been utilized for compressed sensing signal recovery problem by the A* Orthogonal Matching Pursuit (A*OMP) algorithm. A*OMP employs A* search on a tree with an OMP-based evaluation of the branches, where the search is terminated when the desired path length is achieved. The algorithm employs effective pruning techniques and cost models which make the tree search practical. Here, we propose two important extensions of A*OMP: We first introduce a novel dynamic cost model that reduces the search time. Second, we modify the termination criterion by stopping the search when ℓ2 norm of the residue is small enough. Following the restricted isometry property, this termination criterion is more appropriate for our purposes. We demonstrate the improvements in terms of both reconstruction accuracy and computation times via a wide range of simulations.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: A∗ auxiliary functions , A∗ termination criterion , A∗OMP , Compressed sensing
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Electronics
Faculty of Engineering and Natural Sciences
Depositing User: Hakan Erdoğan
Date Deposited: 06 Dec 2012 15:36
Last Modified: 26 Apr 2022 09:08
URI: https://research.sabanciuniv.edu/id/eprint/20563

Actions (login required)

View Item
View Item