期刊文献+

Recoverability analysis of block-sparse representation

Recoverability analysis of block-sparse representation
在线阅读 下载PDF
导出
摘要 Recoverability of block-sparse signals by convex relaxation methods is considered for the underdetermined linear model. In previous works, some explicit but pessimistic recoverability results which were associated with the dictionary were presented. This paper shows the recoverability of block-sparse signals are associated with the block structure when a random dictionary is given. Several probability inequalities are obtained to show how the recoverability changes along with the block structure parameters, such as the number of nonzero blocks, the block length, the dimension of the measurements and the dimension of the block-sparse representation signal. Also, this paper concludes that if the block-sparse structure can be considered, the recoverability of the signals wil be improved. Numerical examples are given to il ustrate the availability of the presented theoretical results. Recoverability of block-sparse signals by convex relaxation methods is considered for the underdetermined linear model. In previous works, some explicit but pessimistic recoverability results which were associated with the dictionary were presented. This paper shows the recoverability of block-sparse signals are associated with the block structure when a random dictionary is given. Several probability inequalities are obtained to show how the recoverability changes along with the block structure parameters, such as the number of nonzero blocks, the block length, the dimension of the measurements and the dimension of the block-sparse representation signal. Also, this paper concludes that if the block-sparse structure can be considered, the recoverability of the signals wil be improved. Numerical examples are given to il ustrate the availability of the presented theoretical results.
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第3期373-379,共7页 系统工程与电子技术(英文版)
基金 supported by the International Cooperation Project of Guangdong Natural Science Fund(2009B050700020) the Natural Science Foundation of China-Guangdong Natural Science Foundation Union Project(U0835003)
关键词 block-sparsity RECOVERABILITY mixed l2/l1-optimization program. block-sparsity, recoverability, mixed l2/l1-optimization program.
作者简介 Corresponding author.Yuli Fu was born in 1959, He received his Ph.D. degree in control theory and engineering from the Huazhong University of Science and Technology, in 2000. From 2000 to 2002, he was a postdoctoral researcher in the School of Electronic and Information Engineering at the South China University of Technology. Now, he is a professor in the same university. His research interests are focused on adaptive signal processing and artificial intelligent. E-mail: fuyuli@scut.edu.cn,lian Zou was born in 1983. He received his Ph.D. degree in signal and information processing from the South China University of Technology in 2013. No,,v. he is an assistant professor in Yangtze University. His research interests are focused on adaptive signal processing and numerical optimization. E-mail: zoujianjz@gmail.comQiheng Zhang was born ill 1986. He received his B.S. degree in electrical engineering from the Information Engineering University, in 2008. He is currently working toward the Ph.D. degree in the School of Electronic and Information Engineering, South China University of Technology. His research interests include compressed sensing and image fusion. E-mail: qiheng.zhang@gmail.comHaifeng Li was born in 1984. He received his M.S. degree in the School of Mathematics and Information Science, Henan Normal University, in 2011. He is currently purst, ing his Ph.D. degree in the School of Electronic and Information Engineering, South China University of Technology. His research interests include compressed sensing and convex programming. E-mail: lihaifengxx@126.com
  • 相关文献

参考文献29

  • 1A. M. Bruckstein, D. L. Donoho, M. Elad. From sparse solu- tions of systems of equations to sparse modeling of signals and images. SIAM Review, 2011,51 (1): 34-81.
  • 2Z. S. He, S. L. Xie, S. X. Ding, et al. Convolutive blind source separation in frequency domain based on sparse representa- tion. IEEE Trans. on Audio, Speech, and Language Proces- sing, 2007, 15(5): 1551-1563.
  • 3Z. S. He, A. Cichocki, S. L. Xie, et al. Detecting the number of clusters in n-way probabilistic clustering. IEEE Trans. on Pat- tern Analysis and Machine Intelligence, 2010, 32(11): 2006- 2021.
  • 4Z. S. He, A. Cichocki, R. Zdunek, et al. Improved FOC-USS method with conjugate gradient (CG) iterations. IEEE Trans. on Signal Processing, 2009, 57(1):399-404.
  • 5D. L. Donoho. Compressed sensing. IEEE Trans. on Informa- tion Theoo,, 2006, 52(4): 1289-1306.
  • 6B. K. Natarajan. Sparse approximate solutions to linear sys- tems. SIAM Journal on Computing, 1995, 24(2): 227-234.
  • 7S. S. Chen, D. L. Donoho, M. A. Saunders. Atomic decom- position by basis pursuit. SIAM Journal on Scientific Compu- ting, 1998, 20( 1 ): 33-61.
  • 8D. L. Donoho, M. Elad. Optimally sparse representation in general (nonorthogonal) dictionaries via e1 minimization. Pro- ceedings of the National Academy of Sciences, 2003, 100(5): 2197-2202.
  • 9E. J. Candes, J. Romberg, T. Tao. Robust uncertainty prin- ciples: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. on Information Theory, 2006, 52(2): 489-509.
  • 10E. J. Candes. The restricted isometry property and its implica- tions for compressed sensing. Comptes Rendus Mathematique, 2008, 346(9110): 589-592.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部