A one-bit reweighted iterative algorithm for sparse signal recovery
Lists
Only you see this
Abstract
This paper considers the problem of reconstructing sparse or compressible signals from one-bit quantized measurements. We study a new method that uses a log-sum penalty function, also referred to as the Gaussian entropy, for sparse signal recovery. Additionally, in the proposed method, the sigmoid function is introduced to quantify the consistency between the measured one-bit quantized data and the reconstructed signal. A fast iterative algorithm is developed by iteratively minimizing a convex surrogate function that bounds the original objective function. This leads to an iterative reweighted process that alternates between estimating the sparse signal and refining the weights of the surrogate function. Connections between the proposed algorithm and other existing methods are discussed. Numerical results are provided to illustrate the effectiveness of the proposed algorithm.
BibTeX
@inproceedings{shen2013one,
author = {Yanning Shen and Jun Fang and Hongbin Li and Zhi Chen},
title = {{A one-bit reweighted iterative algorithm for sparse signal recovery}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2013},
url = {https://openreview.net/forum?id=_ollyUDDJo4},
}Loading related content...