Robust estimation of highly corrupted low-rank matrix via alternating direction method of multiplier

被引:1
|
作者
Yimamu, Tuersunjiang [1 ]
Eisaka, Toshio [2 ]
机构
[1] Kitami Inst Technol, Dept Mfg Engn, Kitami, Hokkaido, Japan
[2] Kitami Inst Technol, Div Informat & Commun Engn, Kitami, Hokkaido 0908507, Japan
关键词
FACTORIZATION; COMPLETION;
D O I
10.1049/sil2.12168
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Low-rank matrices play a central role in modelling and computational methods for signal processing and large-scale data analysis. Real-world observed data are often sampled from low-dimensional subspaces, but with sample-specific corruptions (i.e. outliers) or random noises. In many applications where low-rank matrices arise, these matrices cannot be fully sampled or directly observed, and one encounters the problem of recovering the matrix given only incomplete and indirect observations. The authors aim to recover a low-rank component from incomplete and indirect observations and correct the possible errors. A new low-rank matrix recovery formula based on generalised Tikhonov regularisation and its solution algorithm are proposed. The proposed method determines the low-rank component for performing matrix recovery from highly corrupted observations. The authors' recommended algorithm reduces not only the outliers but also random corruptions in the recovering task. The experimental results obtained using both synthetic and real application data demonstrate the efficacy of the proposed method.
引用
收藏
页数:9
相关论文
共 50 条
  • [21] Augmented Lagrangian alternating direction method for low-rank minimization via non-convex approximation
    Yongyong Chen
    Yongli Wang
    Mingqiang Li
    Guoping He
    [J]. Signal, Image and Video Processing, 2017, 11 : 1271 - 1278
  • [22] Augmented Lagrangian alternating direction method for low-rank minimization via non-convex approximation
    Chen, Yongyong
    Wang, Yongli
    Li, Mingqiang
    He, Guoping
    [J]. SIGNAL IMAGE AND VIDEO PROCESSING, 2017, 11 (07) : 1271 - 1278
  • [23] RESTORING CORRUPTED MOTION CAPTURE DATA VIA JOINTLY LOW-RANK MATRIX COMPLETION
    Hou, Junhui
    Bian, Zhen-Peng
    Chau, Lap-Pui
    Magnenat-Thalmann, Nadia
    He, Ying
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO (ICME), 2014,
  • [24] An Implementable Accelerated Alternating Direction Method of Multipliers for Low-Rank Tensor Completion
    Qiu, Duo
    Zhu, Hu
    Zhang, Xiongjun
    [J]. IEEE 2018 INTERNATIONAL CONGRESS ON CYBERMATICS / 2018 IEEE CONFERENCES ON INTERNET OF THINGS, GREEN COMPUTING AND COMMUNICATIONS, CYBER, PHYSICAL AND SOCIAL COMPUTING, SMART DATA, BLOCKCHAIN, COMPUTER AND INFORMATION TECHNOLOGY, 2018, : 537 - 541
  • [25] GRPCA21 for recovering a corrupted low-rank matrix
    Lina Zhao
    Xuke Hou
    Hongwei Yang
    Ji Li
    [J]. International Journal of Machine Learning and Cybernetics, 2020, 11 : 1293 - 1305
  • [26] GRPCA21 for recovering a corrupted low-rank matrix
    Zhao, Lina
    Hou, Xuke
    Yang, Hongwei
    Li, Ji
    [J]. INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2020, 11 (06) : 1293 - 1305
  • [27] Robust Corrupted Data Recovery and Clustering via Generalized Transformed Tensor Low-Rank Representation
    Yang, Jing-Hua
    Chen, Chuan
    Dai, Hong-Ning
    Ding, Meng
    Wu, Zhe-Bin
    Zheng, Zibin
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (07) : 8839 - 8853
  • [28] Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
    Hastie, Trevor
    Mazumder, Rahul
    Lee, Jason D.
    Zadeh, Reza
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2015, 16 : 3367 - 3402
  • [29] Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery
    Wu, Lun
    Ganesh, Arvind
    Shi, Boxin
    Matsushita, Yasuyuki
    Wang, Yongtian
    Ma, Yi
    [J]. COMPUTER VISION - ACCV 2010, PT III, 2011, 6494 : 703 - +
  • [30] Low-rank Matrix Completion using Alternating Minimization
    Jain, Prateek
    Netrapalli, Praneeth
    Sanghavi, Sujay
    [J]. STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 665 - 674