Creating and sharing knowledge for telecommunications

Binary fused compressive sensing: 1-Bit compressive sensing meets group sparsity

Zeng, X. ; Figueiredo, M. A. T.

Binary fused compressive sensing: 1-Bit compressive sensing meets group sparsity, Proc Conf. on Telecommunications - ConfTele, Castelo Branco, Portugal, Vol. 1, pp. 65 - 68, May, 2013.

Digital Object Identifier: 0

Download Full text PDF ( 668 KBs)

Abstract
We propose a new method, {\it binary fused compressive sensing} (BFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements.
The proposed algorithm is a modification of the previous {\it binary iterative hard thresholding} (BIHT) algorithm, where, in addition to the sparsity constraint, the total-variation of the recovered signal is upper constrained. As in BIHT, the data term of the objective function is an one-sided $\ell_1$ (or $\ell_2$) norm.
Experiments on the recovery of sparse piece-wise smooth signals show that the proposed algorithm is able to take advantage of the piece-wise smoothness of the original signal, achieving more accurate recovery than BIHT.