旧版    ENGLISH

其他

当前位置 : 首页 > 其他 > 学术活动

The characterization of $\ell_1$ minimizer in one-bit compressed sensing

编辑:wfy 时间:2018年12月12日 访问次数:379

题目:The characterization of $\ell_1$ minimizer in one-bit compressed sensing

时间:12.14下午2:30-3:30 学术报告,3:30-5:00自由讨论

地点:教十一417

报告人:毕宁(中山大学)

摘要:One-bit compressed sensing (one-bit CS) has been studied in many fields such as sparse signal recovery, imaging processing and matrix completion. Due to the amplitude information of sparse signal in one-bit CS is not available, it is often the support or the sign of a signal that can be exactly recovered with a decoding method. In this talk, we focus on one-bit CS theory with the model \(\min\{\|x\|_1 : YAx\geq 0, \|Ax\|_1=q\}\) and presented a necessary and sufficient condition such that a signal \(\bar x\) to be the unique \(\ell_1\) minimizer in noiseless one-bit CS. By the improved separation theorem of convex sets, a completed characterization of \(\ell_1\) minimizer in one-bit CS is given.


联系人:郭正初(guozhengchu@zju.edu.cn)