Sparse Signal Recovery via Generalized Entropy Functions Minimization

DOI10.1109/TSP.2018.2889951MaRDI QIDQ4628288zbMATH OpenWikidataFDO

Authors Shuai Huang, Trac D. Tran

Publication date 6 March 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.10556

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26) Measures of information, entropy (94A17)

Abstract: Compressive sensing relies on the sparse prior imposed on the signal of interest to solve the ill-posed recovery problem in an under-determined linear system. The objective function used to enforce the sparse prior information should be both effective and easily optimizable. Motivated by the entropy concept from information theory, in this paper we propose the generalized Shannon entropy function and R'{e}nyi entropy function of the signal as the sparsity promoting regularizers. Both entropy functions are nonconvex, non-separable. Their local minimums only occur on the boundaries of the orthants in the Euclidean space. Compared to other popular objective functions, minimizing the generalized entropy functions adaptively promotes multiple high-energy coefficients while suppressing the rest low-energy coefficients. The corresponding optimization problems can be recasted into a series of reweighted $l_1$-norm minimization problems and then solved efficiently by adapting the FISTA. Sparse signal recovery experiments on both the simulated and real data show the proposed entropy functions minimization approaches perform better than other popular approaches and achieve state-of-the-art performances.

Cited in

(8)

• A parameterized three-operator splitting algorithm for non-convex minimization problems with applications
• A reweighted symmetric smoothed function approximating L₀-norm regularized sparse reconstruction method
• Recovery analysis for the _p/_1 minimization problem
• Block sparse signal recovery via minimizing the block q-ratio sparsity
• Non-negative sparse signal recovery with a feasible based sequential quadratic programming
• Locality regularized reconstruction: structured sparsity and Delaunay triangulations
• Subgradient-based tableau pivot method for sparse signal recovery
• A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration

This page was built for publication: Sparse Signal Recovery via Generalized Entropy Functions Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628288)