鲁棒张量分解的两阶段方法

Seyyid Emre Sofuoglu, Selin Aviyente
{"title":"鲁棒张量分解的两阶段方法","authors":"Seyyid Emre Sofuoglu, Selin Aviyente","doi":"10.1109/SSP.2018.8450832","DOIUrl":null,"url":null,"abstract":"The rapid advance in sensor technology and computing systems has lead to the increase in the availability of multidimensional (tensor) data. Tensor data analysis have witnessed increasing applications in machine learning, data mining and computer vision. Traditional tensor decomposition methods such as Tucker decomposition and PARAFAC/CP decomposition aim to factorize the input tensor into a number of low-rank factors. However, they are prone to gross error that may occur due to illumination, occlusion or salt and pepper noise encountered in practical applications. For this purpose, higher order robust PCA (HoRPCA) and other robust tensor decomposition (RTD) methods have been proposed. These methods still have some limitations including sensitivity to non-sparse noise and high computational complexity. In this paper, we introduce a two-stage approach that combines HoRPCA with Higher Order SVD (HoSVD) to address these challenges.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Two-Stage Approach to Robust Tensor Decomposition\",\"authors\":\"Seyyid Emre Sofuoglu, Selin Aviyente\",\"doi\":\"10.1109/SSP.2018.8450832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid advance in sensor technology and computing systems has lead to the increase in the availability of multidimensional (tensor) data. Tensor data analysis have witnessed increasing applications in machine learning, data mining and computer vision. Traditional tensor decomposition methods such as Tucker decomposition and PARAFAC/CP decomposition aim to factorize the input tensor into a number of low-rank factors. However, they are prone to gross error that may occur due to illumination, occlusion or salt and pepper noise encountered in practical applications. For this purpose, higher order robust PCA (HoRPCA) and other robust tensor decomposition (RTD) methods have been proposed. These methods still have some limitations including sensitivity to non-sparse noise and high computational complexity. In this paper, we introduce a two-stage approach that combines HoRPCA with Higher Order SVD (HoSVD) to address these challenges.\",\"PeriodicalId\":330528,\"journal\":{\"name\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSP.2018.8450832\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Statistical Signal Processing Workshop (SSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSP.2018.8450832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

传感器技术和计算系统的快速发展导致了多维(张量)数据可用性的增加。张量数据分析在机器学习、数据挖掘和计算机视觉方面的应用越来越多。传统的张量分解方法,如Tucker分解和PARAFAC/CP分解,目的是将输入张量分解为多个低秩因子。然而,在实际应用中,由于光照、遮挡或椒盐噪声的影响,容易产生较大的误差。为此,提出了高阶鲁棒PCA (HoRPCA)和其他鲁棒张量分解(RTD)方法。这些方法仍然存在对非稀疏噪声敏感和计算复杂度高的局限性。在本文中,我们介绍了一种结合HoRPCA和高阶SVD (HoSVD)的两阶段方法来解决这些挑战。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Two-Stage Approach to Robust Tensor Decomposition
The rapid advance in sensor technology and computing systems has lead to the increase in the availability of multidimensional (tensor) data. Tensor data analysis have witnessed increasing applications in machine learning, data mining and computer vision. Traditional tensor decomposition methods such as Tucker decomposition and PARAFAC/CP decomposition aim to factorize the input tensor into a number of low-rank factors. However, they are prone to gross error that may occur due to illumination, occlusion or salt and pepper noise encountered in practical applications. For this purpose, higher order robust PCA (HoRPCA) and other robust tensor decomposition (RTD) methods have been proposed. These methods still have some limitations including sensitivity to non-sparse noise and high computational complexity. In this paper, we introduce a two-stage approach that combines HoRPCA with Higher Order SVD (HoSVD) to address these challenges.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信