Volume 20, Issue 1 (JIAEEE Vol.20 No.1 2023)
Journal of Iranian Association of Electrical and Electronics Engineers 2023, 20(1): 89-96 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Ahmadi A, Majidian S, Kahaei M H. Graph Matrix Completion in Presence of Outliers. Journal of Iranian Association of Electrical and Electronics Engineers 2023; 20 (1) :89-96
URL: http://jiaeee.com/article-1-1272-en.html
URL: http://jiaeee.com/article-1-1272-en.html
Faculty of Electrical Engineering, Iran University of Science & Technology, Tehran
Abstract: (1499 Views)
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the graph total variation term to the objective function of matrix completion problem. However; in practice, the observed data is noisy and contains outliers. Outlier data is defined as part of the observed that are different than other parts and are not consistent with the data structure. In this paper, we apply graph total variation based on the directed Laplacian and propose a new method for graph matrix completion. We introduce a new method called GMCO-DL for the case where both noise and outliers exist in observations. Simulation results show outstanding results for the proposed method in terms of estimation error.
Type of Article: Research |
Subject:
Communication
Received: 2021/02/11 | Accepted: 2022/10/19 | Published: 2022/12/27
Received: 2021/02/11 | Accepted: 2022/10/19 | Published: 2022/12/27
Extended Abstract [PDF 191 KB] (6 Download)
Send email to the article author
| Rights and permissions | |
 |
This Journal is an open access Journal Licensed under the Creative Commons Attribution-NonCommercial 4.0 International License. (CC BY NC 4.0) |
