基于TNNR和全行差的鲁棒矩阵补全方法恢复光学图像

Xinrun Tian;Shuisheng Zhou;Tiantian Meng
{"title":"基于TNNR和全行差的鲁棒矩阵补全方法恢复光学图像","authors":"Xinrun Tian;Shuisheng Zhou;Tiantian Meng","doi":"10.1109/JMASS.2023.3236302","DOIUrl":null,"url":null,"abstract":"Matrix completion aims to recover a matrix from an incomplete matrix with many unknown elements and has wide applications in optical image recovery and machine learning, in which the popular method is to formulate it as a general low-rank matrix approximation problem. However, the traditional optimization model for matrix completion is less robust. This article proposes a robust matrix completion method in which the truncated nuclear norm regularization (TNNR) is used as the approximation of the rank function and the sum of absolute values of the row difference, which is called the total row difference, is used to constrain the oscillations of the missing matrix. By minimizing the value of the total row difference in the objective, the proposed model controls the oscillation and reduces the impact of missing parts in the process of matrix completion continuously. Furthermore, we propose a two-step iterative algorithm framework and design an ADMM algorithm for the subproblem model that includes minimizing the total row difference. Experiments show that the proposed algorithm has more stable performance and better recovery effect and obviously reduces the sensitivity of the traditional TNNR models to the truncated rank parameter.","PeriodicalId":100624,"journal":{"name":"IEEE Journal on Miniaturization for Air and Space Systems","volume":"4 2","pages":"105-113"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust Matrix Completion Method Based on TNNR and Total Row Difference for Recovering Optical Image\",\"authors\":\"Xinrun Tian;Shuisheng Zhou;Tiantian Meng\",\"doi\":\"10.1109/JMASS.2023.3236302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Matrix completion aims to recover a matrix from an incomplete matrix with many unknown elements and has wide applications in optical image recovery and machine learning, in which the popular method is to formulate it as a general low-rank matrix approximation problem. However, the traditional optimization model for matrix completion is less robust. This article proposes a robust matrix completion method in which the truncated nuclear norm regularization (TNNR) is used as the approximation of the rank function and the sum of absolute values of the row difference, which is called the total row difference, is used to constrain the oscillations of the missing matrix. By minimizing the value of the total row difference in the objective, the proposed model controls the oscillation and reduces the impact of missing parts in the process of matrix completion continuously. Furthermore, we propose a two-step iterative algorithm framework and design an ADMM algorithm for the subproblem model that includes minimizing the total row difference. Experiments show that the proposed algorithm has more stable performance and better recovery effect and obviously reduces the sensitivity of the traditional TNNR models to the truncated rank parameter.\",\"PeriodicalId\":100624,\"journal\":{\"name\":\"IEEE Journal on Miniaturization for Air and Space Systems\",\"volume\":\"4 2\",\"pages\":\"105-113\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Journal on Miniaturization for Air and Space Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10015722/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Journal on Miniaturization for Air and Space Systems","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10015722/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

矩阵完备旨在从含有许多未知元素的不完备矩阵中恢复矩阵,在光学图像恢复和机器学习中有着广泛的应用,其中流行的方法是将其公式化为一个一般的低阶矩阵逼近问题。然而,传统的矩阵完备优化模型的鲁棒性较差。本文提出了一种鲁棒矩阵完备方法,其中使用截断核范数正则化(TNNR)作为秩函数的近似,并使用行差的绝对值之和(称为总行差)来约束缺失矩阵的振荡。通过最小化目标中总行差的值,该模型控制了振荡,并连续减少了矩阵完成过程中缺失部分的影响。此外,我们提出了一个两步迭代算法框架,并为子问题模型设计了一个ADMM算法,该算法包括最小化总行差。实验表明,该算法具有更稳定的性能和更好的恢复效果,显著降低了传统TNNR模型对截断秩参数的敏感性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust Matrix Completion Method Based on TNNR and Total Row Difference for Recovering Optical Image
Matrix completion aims to recover a matrix from an incomplete matrix with many unknown elements and has wide applications in optical image recovery and machine learning, in which the popular method is to formulate it as a general low-rank matrix approximation problem. However, the traditional optimization model for matrix completion is less robust. This article proposes a robust matrix completion method in which the truncated nuclear norm regularization (TNNR) is used as the approximation of the rank function and the sum of absolute values of the row difference, which is called the total row difference, is used to constrain the oscillations of the missing matrix. By minimizing the value of the total row difference in the objective, the proposed model controls the oscillation and reduces the impact of missing parts in the process of matrix completion continuously. Furthermore, we propose a two-step iterative algorithm framework and design an ADMM algorithm for the subproblem model that includes minimizing the total row difference. Experiments show that the proposed algorithm has more stable performance and better recovery effect and obviously reduces the sensitivity of the traditional TNNR models to the truncated rank parameter.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.40
自引率
0.00%
发文量
0
×
引用
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学术官方微信