请升级浏览器版本

你正在使用旧版本浏览器。请升级浏览器以获得更好的体验。

学术报告

首页 >> 学术报告 >> 正文

【学术报告】Robust Tensor Completion: Equivalent Surrogates, Error Bounds and Algorithms

发布日期:2022-05-12    点击👱🏻‍♀️:

学术报告

2022520星期五  1500-16🥶:30


报告题目: Robust Tensor Completion: Equivalent Surrogates, Error Bounds and Algorithms

报告人: 白敏茹湖南大学)

报告地点: 沙河主楼E404

腾讯会议378-548-350


报告摘要: Robust Low-Rank Tensor Completion (RTC) problems have received considerable attention in recent years such as signal processing and computer vision. In this paper, we focus on the bound constrained RTC problem for third-order tensors which recovers a low-rank tensor from partial observations corrupted by impulse noise. A widely used convex relaxation of this problem is to minimize the tensor nuclear norm for low rank and the $\ell_1$-norm for sparsity. However, it may result in biased solutions. To handle this issue, we propose a nonconvex model with a novel nonconvex tensor rank surrogate function and a novel nonconvex sparsity measure for RTC problems under limited sample constraints and two bound constraints, where these two nonconvex terms have a difference of convex functions structure. Then, a proximal majorization-minimization (PMM) algorithm is developed to solve the proposed model and this algorithm consists of solving a series of convex subproblems with an initial estimator to generate a new estimator which is used for the next subproblem. Theoretically, for this new estimator, we establish a recovery error bound for its recoverability and give the theoretical guarantee that lower error bounds can be obtained when a reasonable initial estimator is available. Then, by using the Kurdyka-Lojasiewicz property exhibited in the resulting problem, we show that the sequence generated by the PMM algorithm globally converges to a critical point of the problem. Extensive numerical experiments including color images and multispectral images show the high efficiency of the proposed model.


报告人简介🐭🗄:

白敏茹,湖南大学数学凯发K8教授,博士生导师👰🏿🛠,担任湖南省运筹学会理事长、湖南省计算数学与应用软件学会副理事长、中国运筹学会数学规划分会理事🧏🏻‍♀️,长期致力于最优化理论☸️🍰、方法及其应用研究,近年来主要从事张量优化💁‍♀️、低秩稀疏优化及其在图像处理中的应用研究,主持国家自然科学基金面上项目和湖南省自然科学基金等项目,取得了系列研究成果☔️🧑‍💼,在SIAM Journal on Imaging SciencesSIAM Journal of Matrix Analysis and Applications👨‍👨‍👦‍👦、Inverse Problems Journal of Optimization Theory and Applications Computational Optimization and ApplicationsJournal of Global Optimization等学术期刊上发表论文近30余篇🧔🏿‍♀️,获得2017年湖南省自然科学二等奖(排名第二)培养博士生中一人获得湖南省优秀博士论文奖👩‍🔬。


邀请人:崔春风


快速链接

版权所有 © 2021  凯发娱乐-凯发-凯发平台-北京凯发K8娱乐平台登录官方网站
地址:北京市昌平区高教园南三街9号   电话🪃💉:61716719

凯发娱乐专业提供🙍🏽‍♂️:凯发娱乐🥩、凯发平台凯发登录等服务,提供最新官网平台、地址、注册、登陆、登录、入口、全站、网站、网页、网址、娱乐、手机版、app、下载、欧洲杯、欧冠、nba、世界杯、英超等,界面美观优质完美,安全稳定,服务一流🧑‍🍼👨‍🌾,凯发娱乐欢迎您。 凯发娱乐官网xml地图
凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐