Bayesian Pursuit Algorithms
Bayesian Pursuit Algorithms
This paper addresses the sparse representation (SR) problem within a general Bayesian framework. We show that the Lagrangian formulation of the standard SR problem, i.e., x∗ = argmin x {||y — Dx||2 2 +λ||X|| 0 }, can be regarded as a limit case of a general maximum a posteriori (MAP) …