A generalized least-squares approach regularized with graph embedding for dimensionality reduction

XJ Shen, SX Liu, BK Bao, CH Pan, ZJ Zha, J Fan - Pattern Recognition, 2020 - Elsevier
In current graph embedding methods, low dimensional projections are obtained by
preserving either global geometrical structure of data or local geometrical structure of data …

Robust PCA using generalized nonconvex regularization

F Wen, R Ying, P Liu, RC Qiu - IEEE Transactions on Circuits …, 2019 - ieeexplore.ieee.org
Recently, the robustification of principal component analysis (PCA) has attracted much
research attention in numerous areas of science and engineering. The most popular and …

Robust low-rank matrix completion via an alternating manifold proximal gradient continuation method

M Huang, S Ma, L Lai - IEEE Transactions on Signal …, 2021 - ieeexplore.ieee.org
Robust low-rank matrix completion (RMC), or robust principal component analysis with
partially observed data, has been studied extensively for computer vision, signal processing …

Nonconvex regularized robust PCA using the proximal block coordinate descent algorithm

F Wen, R Ying, P Liu, TK Truong - IEEE Transactions on Signal …, 2019 - ieeexplore.ieee.org
This work addresses the robust principal component analysis (PCA) problem using
generalized nonoconvex regularization for low-rank and sparsity promotion. While the …

Inductive matrix completion: No bad local minima and a fast algorithm

P Zilber, B Nadler - International Conference on Machine …, 2022 - proceedings.mlr.press
The inductive matrix completion (IMC) problem is to recover a low rank matrix from few
observed entries while incorporating prior knowledge about its row and column subspaces …

Highlight removal for endoscopic images based on accelerated adaptive non-convex RPCA decomposition

J Pan, R Li, H Liu, Y Hu, W Zheng, B Yan… - Computer Methods and …, 2023 - Elsevier
Objective: Highlights always occur in endoscopic images due to their special imaging
environment. It not only increases the difficulty of observation and diagnosis from surgeons …

Efficient robust principal component analysis via block krylov iteration and cur decomposition

S Fang, Z Xu, S Wu, S Xie - … of the IEEE/CVF Conference on …, 2023 - openaccess.thecvf.com
Robust principal component analysis (RPCA) is widely studied in computer vision. Recently
an adaptive rank estimate based RPCA has achieved top performance in low-level vision …

A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm

QZ Zheng, PF Xu - Journal of the Franklin Institute, 2022 - Elsevier
Recovering a low-rank matrix and a sparse matrix from an observed matrix, known as
sparse and low-rank decomposition (SLRD), is becoming a hot topic in recent years. The …

Superposed Atomic Representation for Robust High-Dimensional Data Recovery of Multiple Low-Dimensional Structures

Y Wang - Proceedings of the AAAI Conference on Artificial …, 2024 - ojs.aaai.org
This paper proposes a unified Superposed Atomic Representation (SAR) framework for high-
dimensional data recovery with multiple low-dimensional structures. The data can be in …

New Robust Principal Component Analysis for Joint Image Alignment and Recovery via Affine Transformations, Frobenius and L2,1 Norms

HT Likassa - International Journal of Mathematics and …, 2020 - Wiley Online Library
This paper proposes an effective and robust method for image alignment and recovery on a
set of linearly correlated data via Frobenius and L2, 1 norms. The most popular and …