<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>3</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>S.D. Babacan</AUTHOR>
		<AUTHOR>R. Molina</AUTHOR>
		<AUTHOR>A.K. Katsaggelos</AUTHOR>
	</AUTHORS>
	<YEAR>2009</YEAR>
	<TITLE>Fast Bayesian Compressive Sensing using Laplace Priors</TITLE>
	<SECONDARY_TITLE>IEEE International Conf. on Acoustics, Speech, and Signal Processing (ICASSP’09)</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Taipei, Taiwan</PLACE_PUBLISHED>
	<DATE>19/04/2009</DATE>
	<ABSTRACT>In this paper we model the components of the compressive sensing (CS) problem using the Bayesian framework by utilizing a hierarchical form of the Laplace prior to model sparsity of the unknown signal. This signal prior includes some of the existing models as special cases and achieves a high degree of sparsity. We develop a constructive (greedy) algorithm resulting from this formulation where necessary parameters are estimated solely from the observation and therefore no user-intervention is needed. We provide experimental results with synthetic 1D signals and images, and compare with the state-of-the-art CS reconstruction algorithms demonstrating the superior performance of the proposed approach.</ABSTRACT>
</RECORD>
</RECORDS></XML>