Rescaled three-mode principal component analysis: An approach to subspace recovery

IF 6.3 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Mingli Wang , Junbin Gao , Xinwei Jiang , Chunlong Hu , Qi Feng , Tianjiang Wang
{"title":"Rescaled three-mode principal component analysis: An approach to subspace recovery","authors":"Mingli Wang ,&nbsp;Junbin Gao ,&nbsp;Xinwei Jiang ,&nbsp;Chunlong Hu ,&nbsp;Qi Feng ,&nbsp;Tianjiang Wang","doi":"10.1016/j.neunet.2025.107670","DOIUrl":null,"url":null,"abstract":"<div><div>Many tasks, such as image denoising, can be framed within the context of subspace recovery. For its algorithm design, robustness is a critical consideration. In this paper, we propose a novel holistic approach to robust subspace recovery. The fundamental work consists of extending Stein’s unbiased risk estimate to elliptical densities, expanding Gaussian scale mixtures, and estimating error density from the dataset. These advancements serve as the foundation for a rescaled three-mode principal component analysis. By leveraging the majorization–minimization (MM) algorithm, we seamlessly integrate total variation into our model. A key feature of this approach is its inherent robustness to outliers, as demonstrated through our experimental results.</div></div>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"190 ","pages":"Article 107670"},"PeriodicalIF":6.3000,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0893608025005507","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Many tasks, such as image denoising, can be framed within the context of subspace recovery. For its algorithm design, robustness is a critical consideration. In this paper, we propose a novel holistic approach to robust subspace recovery. The fundamental work consists of extending Stein’s unbiased risk estimate to elliptical densities, expanding Gaussian scale mixtures, and estimating error density from the dataset. These advancements serve as the foundation for a rescaled three-mode principal component analysis. By leveraging the majorization–minimization (MM) algorithm, we seamlessly integrate total variation into our model. A key feature of this approach is its inherent robustness to outliers, as demonstrated through our experimental results.
重标度三模主成分分析:一种子空间恢复方法
许多任务,如图像去噪,都可以在子空间恢复的背景下进行。在算法设计中,鲁棒性是一个重要的考虑因素。本文提出了一种新的鲁棒子空间恢复的整体方法。基础工作包括将Stein的无偏风险估计扩展到椭圆密度,扩展高斯尺度混合物,以及从数据集估计误差密度。这些进步为重新标度的三模主成分分析奠定了基础。通过利用最大化最小化(MM)算法,我们无缝地将总变化集成到我们的模型中。正如我们的实验结果所证明的那样,这种方法的一个关键特征是其对异常值的固有鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neural Networks
Neural Networks 工程技术-计算机:人工智能
CiteScore
13.90
自引率
7.70%
发文量
425
审稿时长
67 days
期刊介绍: Neural Networks is a platform that aims to foster an international community of scholars and practitioners interested in neural networks, deep learning, and other approaches to artificial intelligence and machine learning. Our journal invites submissions covering various aspects of neural networks research, from computational neuroscience and cognitive modeling to mathematical analyses and engineering applications. By providing a forum for interdisciplinary discussions between biology and technology, we aim to encourage the development of biologically-inspired artificial intelligence.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信