Optimal forward-backward pursuit for the sparse signal recovery problem (Seyrek işaret geri çatma problemi için optimal ileri-geri arayışı)

Karahanoğlu, Nazım Burak and Erdoğan, Hakan (2013) Optimal forward-backward pursuit for the sparse signal recovery problem (Seyrek işaret geri çatma problemi için optimal ileri-geri arayışı). In: 21st Signal Processing and Communications Applications Conference (SIU 2013), Haspolat, Cyprus

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

Abstract

Forward-backward pursuit (FBP) is an iterative two stage thresholding method (TST) for sparse signal recovery. Due to the selection of more indices during the forward step than the ones pruned by the backward step, FBP iteratively enlarges the support estimate. With this structure, FBP does not necessitate the sparsity level to be known a priori in contrast to other TST algorithms such as subspace pursuit (SP) or compressive sampling matching pursuit. In this work, we address optimal selection of forward and backward step sizes for FBP. We analyse the empirical recovery performance of FBP with different step sizes via phase transitions. Moreover, we compare phase transitions of FBP with those of basis pursuit, SP and orthogonal matching pursuit.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: compressed sensing; sparse signal recovery; greedy pursuits; forward-backward search
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: 21 Jan 2014 11:36
Last Modified: 26 Apr 2022 09:12
URI: https://research.sabanciuniv.edu/id/eprint/22986

Actions (login required)

View Item
View Item