数学科学学院

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

来源:数学科学学院 发布时间:2018-12-12   505

题目: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)

Copyright © 2023 浙江大学数学科学学院    版权所有

    浙ICP备05074421号

技术支持: 寸草心科技     管理登录

    您是第 1000 位访问者