Browse > Article
http://dx.doi.org/10.7840/kics.2014.39A.12.756

Sparse Signal Recovery Using A Tree Search  

Lee, Jaeseok (Korea University School of Information and Communication)
Shim, Byonghyo (Seoul National University Department of Electrical Engineering)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.39A, no.12, 2014 , pp. 756-763 More about this Journal
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.
Keywords
Compressed sensing; greedy algorithm; sparse recovery; tree pruning; tree search;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 S. S. Chen, D. L. Donoho, and Michael A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Scientific Computing, vol. 20, no. 1, pp. 33-61, 1998.   DOI   ScienceOn
2 J. Park, I. Kim, H. Song, and S. Han, "Iterative detection and decoding of LDPCCoded multiuser uplink massive-MIMO systems," J. KICS, vol. 39A, no. 9, pp. 528-534, Sept. 2014.   DOI
3 K. Lim, J. Lee, S. Kim, D. Pak, and S. Lee, "Intra prediction algorithm using adaptive modes," J. KICS, vol. 38A, no. 6, pp. 492-503, Jun. 2013.   과학기술학회마을   DOI
4 S. Park and S. Choi, "An MMSE based iterative soft decision interference cancellation scheme for massive MIMO systems," J. KICS, vol. 39A, no. 9, pp. 566-568, Sept. 2014.   과학기술학회마을   DOI
5 E. J. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.   DOI   ScienceOn
6 E. J. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.   DOI   ScienceOn
7 E. Liu and V. N. Temlyakov, "The orthogonal super greedy algorithm and applications in compressed sensing," IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2040-2047, Apr. 2012.   DOI   ScienceOn
8 E. J. Candes, "The restricted isometry property and its implications for compressed sensing," Comptes Rendus Mathematique, vol. 346, no. 9-10, pp. 589-592, May 2008.   DOI   ScienceOn
9 R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Royal Stat. Soc. Series B, vol. 58, no. 1, pp. 267-288, 1996.
10 E. Candes and T. Tao, "The Dantzig selector: statistical estimation when p is much larger than n," The Annal. Stat., vol. 35, no. 6, pp. 2313-2351, Dec. 2007.   DOI   ScienceOn
11 T. Tony Cai and L. Wang, "Orthogonal matching pursuit for sparse signal recovery with noise," IEEE Trans. Inf. Theory, vol. 57, no. 7, pp. 4680-4688, Jul. 2011.   DOI
12 D. Needell and J. A. Tropp, "CoSaMP: iterative signal recovery from incomplete and inaccurate samples," Commun. ACM, vol. 53, no. 12, pp. 93-100, Dec. 2010.
13 J. Wang, S. Kwon, and B. Shim, "Generalized orthogonal matching pursuit," IEEE Trans. Signal Process., vol. 60, no. 12, pp. 6202-6216, Dec. 2012.   DOI