Seminar第2660讲 彩色图像的低秩逼近新模型和快速算法

创建时间:  2024/05/28  谭福平   浏览次数:   返回

报告题目 (Title):Low-Rank Approximation of Color Image: New Models and Fast Algorithms (彩色图像的低秩逼近新模型和快速算法)

报告人 (Speaker):贾志刚 教授(江苏师范大学数学与统计学院、数学研究院)

报告时间 (Time):2024年6月4日(周二) 9:30

报告地点 (Place):校本部E408

邀请人(Inviter):王卿文 教授


报告摘要:The color video inpainting problem is one of the most challenging problem in the modern imaging science. It aims to recover a color video from a small part of pixels that may contain noise. However, there are less of robust models that can simultaneously preserve the coupling of color channels and the evolution of color video frames. In this talk, we present a new robust quaternion tensor completion model to solve this challenging problem and derive the exact recovery theory. To solve the case without low-rank property, we introduce a new low-rank learning RQTC model, which rearranges similar patches classified by a quaternion learning method into smaller tensors satisfying the prior low-rank assumption.

上一条:Seminar第2661讲 数学文化漫谈

下一条:Seminar第2659讲 带有临界奇异系数的随机微分方程

  版权所有 © 上海大学   沪ICP备09014157   沪公网安备31009102000049号  地址:上海市宝山区上大路99号    邮编:200444   电话查询
 技术支持:上海大学信息化工作办公室   联系我们