Exploiting the convex-concave penalty for tracking: A novel dynamic reweighted sparse Bayesian learning algorithm
Lists
Only you see this
Abstract
We propose a novel dynamic reweighted ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> (DRℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> ) algorithm in the regime of dynamic compressive sensing. Our analysis shows that aiming to solve a Type II optimization problem, DRℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> is effectively minimizing a `convex-concave' penalty in the coefficients that transitions from a convex region to a concave function using knowledge of past estimations. DRℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> thus provides superior reconstruction performance compared with state-of-the-art dynamic CS algorithms.
BibTeX
@inproceedings{wang2014exploiting,
author = {Yu Wang and David P. Wipf and Wei Chen and Ian J. Wassell},
title = {{Exploiting the convex-concave penalty for tracking: A novel dynamic reweighted sparse Bayesian learning algorithm}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2014},
url = {https://openreview.net/forum?id=KWuhD8220n},
}Loading related content...