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 条
  • [31] Low-rank Matrix Completion using Alternating Minimization
    Jain, Prateek
    Netrapalli, Praneeth
    Sanghavi, Sujay
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 665 - 674
  • [32] A penalized method of alternating projections for weighted low-rank hankel matrix optimization
    Jian Shen
    Jein-Shan Chen
    Hou-Duo Qi
    Naihua Xiu
    Mathematical Programming Computation, 2022, 14 : 417 - 450
  • [33] A penalized method of alternating projections for weighted low-rank hankel matrix optimization
    Shen, Jian
    Chen, Jein-Shan
    Qi, Hou-Duo
    Xiu, Naihua
    MATHEMATICAL PROGRAMMING COMPUTATION, 2022, 14 (03) : 417 - 450
  • [34] NONCONVEX ROBUST LOW-RANK MATRIX RECOVERY
    Li, Xiao
    Zhu, Zhihui
    So, Anthony Man-Cho
    Vidal, Rene
    SIAM JOURNAL ON OPTIMIZATION, 2020, 30 (01) : 660 - 686
  • [35] Robust low-rank data matrix approximations
    XingDong Feng
    XuMing He
    Science China Mathematics, 2017, 60 : 189 - 200
  • [36] Robust low-rank data matrix approximations
    Feng XingDong
    He XuMing
    SCIENCE CHINA-MATHEMATICS, 2017, 60 (02) : 189 - 200
  • [37] Robust low-rank data matrix approximations
    FENG XingDong
    HE XuMing
    Science China(Mathematics), 2017, 60 (02) : 189 - 200
  • [38] Robust Decentralized Low-Rank Matrix Decomposition
    Hegedus, Istvan
    Berta, Arpad
    Kocsis, Levente
    Benczur, Andras A.
    Jelasity, Mark
    ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2016, 7 (04)
  • [39] Sample Efficient Reinforcement Learning via Low-Rank Matrix Estimation
    Shah, Devavrat
    Song, Dogyoon
    Xu, Zhi
    Yang, Yuzhe
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [40] DOA Estimation of Coherent Sources via Low-Rank Matrix Decomposition
    Yang, Zeqi
    Ma, Shuai
    Liu, Yiheng
    Zhang, Hua
    Lyu, Xiaode
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2024, 13 (11) : 3049 - 3053