title   
  

Sıkıştırmalı algılama işaret geri kazanma probleminde A* aramasının karmaşıklık ve doğruluk analizi (Analysis of accuracy and complexity of A* search for compressed sensing signal recovery)

Karahanoğlu, Nazım Burak and Erdoğan, Hakan (2012) Sıkıştırmalı algılama işaret geri kazanma probleminde A* aramasının karmaşıklık ve doğruluk analizi (Analysis of accuracy and complexity of A* search for compressed sensing signal recovery). In: 20th Signal Processing and Communications Applications Conference (SIU 2012), Muğla, Türkiye

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1109/SIU.2012.6204567

Abstract

A* Orthogonal Matching Pursuit (A*OMP) utilizes best-first search for recovery of sparse signals from reduced dimensions. It applies A* search on a tree whose branches are extended similar to Orthogonal Matching Pursuit (OMP). A*OMP makes a tractable tree search possible via effective complexity-accuracy trade-off parameters. Here, we concentrate on the effects of these parameters on the recovery performance. Via empirical comparison of complexity and performance, we demonstrate the effects of the search parameters on search size and recovery. We also compare A*OMP with well-known compressed sensing (CS) recovery techniques to reveal the improvement in the reconstruction.

Item Type:Papers in Conference Proceedings
Subjects:UNSPECIFIED
ID Code:20566
Deposited By:Hakan Erdoğan
Deposited On:06 Dec 2012 15:04
Last Modified:01 Mar 2014 21:24

Repository Staff Only: item control page