A Greedy Multistage Convex Relaxation Algorithm Applied to Structured Group Sparse Reconstruction Problems Based on Iterative Support Detection

Liangtian He and Yilun Wang

Mathematical Problems in Engineering, 2014, vol. 2014, 1-23

Abstract:

We propose a new effective algorithm for recovering a group sparse signal from very limited observations or measured data. As we know that a better reconstruction quality can be achieved when encoding more structural information besides sparsity, the commonly employed -regularization incorporating the prior grouping information has a better performance than the plain -regularized models as expected. In this paper we make a further use of the prior grouping information as well as possibly other prior information by considering a weighted model. Specifically, we propose a multistage convex relaxation procedure to alternatively estimate weights and solve the resulted weighted problem. The procedure of estimating weights makes better use of the prior grouping information and is implemented based on the iterative support detection (Wang and Yin, 2010). Comprehensive numerical experiments show that our approach brings significant recovery enhancements compared with the plain model, solved via the alternating direction method (ADM) (Deng et al., 2013), either in noiseless or in noisy environments.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/358742.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/358742.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:358742

DOI: 10.1155/2014/358742

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().