学术报告通知:Rank Minimization: A Way to 2D Sparsity

应我校信息与通信工程学院模式识别与智能系统实验室郭军教授邀请,微软亚洲研究院主管研究员林宙辰博士将于2010年12月22日来我校作精彩学术报告。欢迎广大师生踊跃参加。

 

报告题目: Rank Minimization: A Way to 2D Sparsity

报告人:林宙辰博士  微软亚洲研究院视觉计算组主管研究员(Lead Researcher)

时间:2010年12月22日 15:00-16:30

地点:教三楼 411

 

报告摘要:Sparse representation has been a hot topic in signal processing and machine learning in recent years. In the past, people usually discussed 1D sparsity, i.e., the number of nonzeros in a vector. For 2D signals, we can actually also define a measure of sparsity, namely the rank of the data matrix. In this talk, I will give a brief history of sparse representation and then introduce some core problems and theories of rank minimization. Finally, I will show some applications of rank minimization that have resulted in improved performance in handling imperfect data that can have noise, outliers and missing values.

 

报告人简介:Dr. Zhouchen Lin is a Lead Researcher at Visual Computing Group, Microsoft Research Asia. He received the Ph.D. degree in applied mathematics from PekingUniversity in 2000. He is now a guest professor to ShanghaiJiaotongUniversity, BeijingJiaotongUniversity and SoutheastUniversity. He is also a guest researcher to Institute of Computing Technology, ChineseAcademy of Sciences. His research interests include computer vision, image processing, computer graphics, machine learning, pattern recognition, and numerical computation and optimization. He is a senior member of the IEEE.

发表评论

电子邮件地址不会被公开。 必填项已用*标注