Results 151 to 160 of about 3,975 (201)

Online search Orthogonal Matching Pursuit

2012 IEEE Statistical Signal Processing Workshop (SSP), 2012
The recovery of a sparse signal x from y= Φx, where Φ is a matrix with more columns than rows, is a task central to many signal processing problems. In this paper we present a new greedy algorithm to solve this type of problem. Our approach leverages ideas from the field of online search on state spaces.
Alejandro J. Weinstein, Michael B. Wakin
openaire   +1 more source

Randomized simultaneous orthogonal matching pursuit

2015 23rd European Signal Processing Conference (EUSIPCO), 2015
In this paper, we develop randomized simultaneous orthogonal matching pursuit (RandSOMP) algorithm which computes an approximation of the Bayesian minimum mean-squared error (MMSE) estimate of an unknown rowsparse signal matrix. The approximation is based on greedy iterations, as in SOMP, and it elegantly incorporates the prior knowledge of the ...
Aqib Ejaz, Esa Ollila, Visa Koivunen
openaire   +1 more source

Home - About - Disclaimer - Privacy