Efficient image and video processing via symmetric inertial proximal ADMM with RPCA model

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zhi-Bin Zhu , Ying Liu , Jia-Qi Huang , Yue-Hong Ding
{"title":"Efficient image and video processing via symmetric inertial proximal ADMM with RPCA model","authors":"Zhi-Bin Zhu ,&nbsp;Ying Liu ,&nbsp;Jia-Qi Huang ,&nbsp;Yue-Hong Ding","doi":"10.1016/j.neucom.2025.130054","DOIUrl":null,"url":null,"abstract":"<div><div>This study proposes a novel symmetric inertial approximation alternating direction method of multiplier (SIPADMM) to address the significant challenges in solving separable two-block nonconvex nonsmooth optimization problems with linear constraints. The primary contribution of this work lies in the development of a unique algorithmic framework that successfully integrates the strengths of proximal and inertial methods while introducing a symmetric treatment of the Lagrange multiplier. A distinctive feature of our approach is the innovative utilization of numerical information from the previous three iteration steps in the proximal method, which significantly enhances the algorithm’s performance in handling nonconvex nonsmooth optimization problems. Furthermore, for the robust principal component analysis model, leveraging the properties of the hyperbolic tangent function, we have introduced a fresh nonconvex approximation function for the rank function, leading to the proposal of a new variant of the nonconvex model. Under carefully established assumptions, we obtain the convergence of the proposed algorithm through the construction of a specially designed auxiliary function <span><math><mi>H</mi></math></span>. Our theoretical analysis demonstrates that if the auxiliary function <span><math><mi>H</mi></math></span> satisfies the Kurdyka–Łojasiewicz inequality, every bounded sequence generated by the algorithm converges to a critical point of the minimization problem. In order to enhance the credibility of our approach and model in real-world scenarios, the proposed algorithm is utilized across various practical problems, especially in dealing with shadow and highlight removal in face images, and front–background separation tasks in videos. Experimental results consistently demonstrate the effectiveness of our algorithm in handling nonconvex approximation models based on rank functions.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"637 ","pages":"Article 130054"},"PeriodicalIF":5.5000,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S092523122500726X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

This study proposes a novel symmetric inertial approximation alternating direction method of multiplier (SIPADMM) to address the significant challenges in solving separable two-block nonconvex nonsmooth optimization problems with linear constraints. The primary contribution of this work lies in the development of a unique algorithmic framework that successfully integrates the strengths of proximal and inertial methods while introducing a symmetric treatment of the Lagrange multiplier. A distinctive feature of our approach is the innovative utilization of numerical information from the previous three iteration steps in the proximal method, which significantly enhances the algorithm’s performance in handling nonconvex nonsmooth optimization problems. Furthermore, for the robust principal component analysis model, leveraging the properties of the hyperbolic tangent function, we have introduced a fresh nonconvex approximation function for the rank function, leading to the proposal of a new variant of the nonconvex model. Under carefully established assumptions, we obtain the convergence of the proposed algorithm through the construction of a specially designed auxiliary function H. Our theoretical analysis demonstrates that if the auxiliary function H satisfies the Kurdyka–Łojasiewicz inequality, every bounded sequence generated by the algorithm converges to a critical point of the minimization problem. In order to enhance the credibility of our approach and model in real-world scenarios, the proposed algorithm is utilized across various practical problems, especially in dealing with shadow and highlight removal in face images, and front–background separation tasks in videos. Experimental results consistently demonstrate the effectiveness of our algorithm in handling nonconvex approximation models based on rank functions.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信