Sparse Signal Recovery Using A Tree Search
Lists
Only you see this
Abstract
In this paper, we introduce a new sparse signal recovery algorithm referred to as the matching pursuit with greedy tree search (GTMP). The tree search in our proposed method is implemented to minimize the cost function to improve the recovery performance of sparse signals. In addition, a pruning strategy is employed to each node of the tree for efficient implementation. In our performance guarantee analysis, we provide the condition that ensures the exact identification of the nonzero locations. Through empirical simulations, we show that GTMP is effective for sparse signal reconstruction and outperforms conventional sparse recovery algorithms.
BibTeX
@article{lee2014sparse,
author = {Jaeseok Lee and Byonghyo Shim},
title = {{Sparse Signal Recovery Using A Tree Search}},
journal = {The Journal of Korean Institute of Communications and Information Sciences},
year = {2014},
doi = {10.7840/kics.2014.39a.12.756},
}Loading related content...