科研之友
微信
新浪微博
Facebook
分享链接
摘要
In the past decade, there has been a great interest in the sparse synthesis model for signal. The researchers have obtained a series of achievements about the sparse representation. The cosparse analysis model as the corresponding version of the sparse synthesis model has drawn much attention in recent years. Many approaches have been proposed to solve this model. In some conventional general, these methods usually relaxed l(0)-norm to l(1)-norm or l(2)-norm to represent the cospasity of signal, from which some reasonable algorithms have been developed. Furthermore, this work will present a new alternative way to replace the l(0)-norm based on the cosparsity inducing function, which is closer to l(0)-norm than l(1)-norm and l(2)-norm. Based on this function, we firstly construct the objective function and give a constrained optimal model of the cosparse recovery problem. Then we propose a subgradient algorithm cosparsity inducing CIF) algorithm, which belongs to a two-layer optimization algorithm. Specifically, through converting the constrained optimal problem into the unconstrained case, we firstly obtain a temporary optimal variable, in which the cosparsity inducing function is approximated using its local linear approximation in order to avoid its nonconvex property. Secondly, a new cosupport is given by projecting the temporary optimal variable into the cosparse subspace and then keeping the l smallest elements. Besides, the desired signal is estimated using a conjugate gradient algorithm on the new cosupport. Moreover, we study the relative theoretical analysis about CIF algorithm. Simulations on the recovering of the unknown signal in the cosparse analysis model indicate its better performance at last.
- 出版日期2016-9-1
- 单位上海大学
