基于噪声位置先验和自适应环秩的两步增强张量去噪框架

IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Boyuan Li , Yali Fan , Weidong Zhang , Yan Song
{"title":"基于噪声位置先验和自适应环秩的两步增强张量去噪框架","authors":"Boyuan Li ,&nbsp;Yali Fan ,&nbsp;Weidong Zhang ,&nbsp;Yan Song","doi":"10.1016/j.jvcir.2025.104406","DOIUrl":null,"url":null,"abstract":"<div><div>Recently, low-rank tensor recovery has garnered significant attention. Its objective is to recover a clean tensor from an observation tensor that has been corrupted. However, existing methods typically do not exploit the prior information of the noise’s position, and methods based on tensor ring decomposition also require a preset rank. In this paper, we propose a framework that leverages this prior information to transform the denoising problem into a complementary one, ultimately achieving effective tensor denoising. This framework consists of two steps: first, we apply an efficient denoising method to obtain the noise prior and identify the noise’s positions; second, we treat these positions as missing values and perform tensor ring completion. In the completion problem, we propose a tensor ring completion model with an adaptive rank incremental strategy, effectively addressing the preset rank problem. Our framework is implemented using the alternating direction method of multipliers (ADMM). Our method has been demonstrated to be superior through extensive experiments conducted on both synthetic and real data.</div></div>","PeriodicalId":54755,"journal":{"name":"Journal of Visual Communication and Image Representation","volume":"107 ","pages":"Article 104406"},"PeriodicalIF":2.6000,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A two-step enhanced tensor denoising framework based on noise position prior and adaptive ring rank\",\"authors\":\"Boyuan Li ,&nbsp;Yali Fan ,&nbsp;Weidong Zhang ,&nbsp;Yan Song\",\"doi\":\"10.1016/j.jvcir.2025.104406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Recently, low-rank tensor recovery has garnered significant attention. Its objective is to recover a clean tensor from an observation tensor that has been corrupted. However, existing methods typically do not exploit the prior information of the noise’s position, and methods based on tensor ring decomposition also require a preset rank. In this paper, we propose a framework that leverages this prior information to transform the denoising problem into a complementary one, ultimately achieving effective tensor denoising. This framework consists of two steps: first, we apply an efficient denoising method to obtain the noise prior and identify the noise’s positions; second, we treat these positions as missing values and perform tensor ring completion. In the completion problem, we propose a tensor ring completion model with an adaptive rank incremental strategy, effectively addressing the preset rank problem. Our framework is implemented using the alternating direction method of multipliers (ADMM). Our method has been demonstrated to be superior through extensive experiments conducted on both synthetic and real data.</div></div>\",\"PeriodicalId\":54755,\"journal\":{\"name\":\"Journal of Visual Communication and Image Representation\",\"volume\":\"107 \",\"pages\":\"Article 104406\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2025-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Visual Communication and Image Representation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1047320325000203\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Visual Communication and Image Representation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1047320325000203","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

近年来,低秩张量恢复引起了人们的广泛关注。它的目标是从损坏的观测张量中恢复一个干净的张量。然而,现有的方法通常没有利用噪声位置的先验信息,并且基于张量环分解的方法也需要预设秩。在本文中,我们提出了一个框架,利用这些先验信息将去噪问题转换为互补问题,最终实现有效的张量去噪。该框架包括两个步骤:首先,我们采用一种有效的去噪方法获得噪声先验并识别噪声的位置;其次,我们将这些位置视为缺失值并执行张量环补全。在补全问题中,提出了一种具有自适应秩增量策略的张量环补全模型,有效地解决了预设秩问题。我们的框架是使用乘法器的交替方向方法(ADMM)实现的。我们的方法已被证明是优越的,通过广泛的实验进行了合成和实际数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A two-step enhanced tensor denoising framework based on noise position prior and adaptive ring rank

A two-step enhanced tensor denoising framework based on noise position prior and adaptive ring rank
Recently, low-rank tensor recovery has garnered significant attention. Its objective is to recover a clean tensor from an observation tensor that has been corrupted. However, existing methods typically do not exploit the prior information of the noise’s position, and methods based on tensor ring decomposition also require a preset rank. In this paper, we propose a framework that leverages this prior information to transform the denoising problem into a complementary one, ultimately achieving effective tensor denoising. This framework consists of two steps: first, we apply an efficient denoising method to obtain the noise prior and identify the noise’s positions; second, we treat these positions as missing values and perform tensor ring completion. In the completion problem, we propose a tensor ring completion model with an adaptive rank incremental strategy, effectively addressing the preset rank problem. Our framework is implemented using the alternating direction method of multipliers (ADMM). Our method has been demonstrated to be superior through extensive experiments conducted on both synthetic and real data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Visual Communication and Image Representation
Journal of Visual Communication and Image Representation 工程技术-计算机:软件工程
CiteScore
5.40
自引率
11.50%
发文量
188
审稿时长
9.9 months
期刊介绍: The Journal of Visual Communication and Image Representation publishes papers on state-of-the-art visual communication and image representation, with emphasis on novel technologies and theoretical work in this multidisciplinary area of pure and applied research. The field of visual communication and image representation is considered in its broadest sense and covers both digital and analog aspects as well as processing and communication in biological visual systems.
×
引用
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学术官方微信