English
Related papers

Related papers: Robust PCA and subspace tracking from incomplete o…

200 papers

Given the superposition of a low-rank matrix plus the product of a known fat compression matrix times a sparse matrix, the goal of this paper is to establish deterministic conditions under which exact recovery of the low-rank and sparse…

Information Theory · Computer Science 2013-10-01 Morteza Mardani , Gonzalo Mateos , Georgios B. Giannakis

Many computer vision tasks involve processing large amounts of data contaminated by outliers, which need to be detected and rejected. While outlier detection methods based on robust statistics have existed for decades, only recently have…

Computer Vision and Pattern Recognition · Computer Science 2017-04-14 Chong You , Daniel P. Robinson , René Vidal

In this manuscript, we research on the behaviors of surrogates for the rank function on different image processing problems and their optimization algorithms. We first propose a novel nonconvex rank surrogate on the general rank…

Machine Learning · Computer Science 2024-09-23 Cho-Ying Wu , Jian-Jiun Ding

Recovering a low-rank matrix from highly corrupted measurements arises in compressed sensing of structured high-dimensional signals (e.g., videos and hyperspectral images among others). Robust principal component analysis (RPCA), solved via…

Optimization and Control · Mathematics 2022-06-28 Vahan Hovhannisyan , Yannis Panagakis , Panos Parpas , Stefanos Zafeiriou

We introduce a novel framework for an approxi- mate recovery of data matrices which are low-rank on graphs, from sampled measurements. The rows and columns of such matrices belong to the span of the first few eigenvectors of the graphs…

Machine Learning · Computer Science 2016-10-05 Nauman Shahid , Nathanael Perraudin , Gilles Puy , Pierre Vandergheynst

In recent work, robust Principal Components Analysis (PCA) has been posed as a problem of recovering a low-rank matrix $\mathbf{L}$ and a sparse matrix $\mathbf{S}$ from their sum, $\mathbf{M}:= \mathbf{L} + \mathbf{S}$ and a provably exact…

Information Theory · Computer Science 2023-07-19 Jinchun Zhan , Namrata Vaswani

We study high-dimensional sparse estimation tasks in a robust setting where a constant fraction of the dataset is adversarially corrupted. Specifically, we focus on the fundamental problems of robust sparse mean estimation and robust sparse…

Data Structures and Algorithms · Computer Science 2019-11-20 Ilias Diakonikolas , Sushrut Karmalkar , Daniel Kane , Eric Price , Alistair Stewart

Low-rank tensor completion recovers missing entries based on different tensor decompositions. Due to its outstanding performance in exploiting some higher-order data structure, low rank tensor ring has been applied in tensor completion. To…

Machine Learning · Computer Science 2020-07-14 Huyan Huang , Yipeng Liu , Ce Zhu

Sparse and outlier-robust Principal Component Analysis (PCA) has been a very active field of research recently. Yet, most existing methods apply PCA to a single dataset whereas multi-source data-i.e. multiple related datasets requiring…

Methodology · Statistics 2026-02-26 Patricia Puchhammer , Ines Wilms , Peter Filzmoser

Anomalies and outliers are common in real-world data, and they can arise from many sources, such as sensor faults. Accordingly, anomaly detection is important both for analyzing the anomalies themselves and for cleaning the data for further…

Machine Learning · Statistics 2018-11-13 Haitao Liu , Randy C. Paffenroth , Jian Zou , Chong Zhou

This paper is concerned with the problem of low rank plus sparse matrix decomposition for big data. Conventional algorithms for matrix decomposition use the entire data to extract the low-rank and sparse components, and are based on…

Numerical Analysis · Computer Science 2017-03-17 Mostafa Rahmani , George Atia

In this work, we study the online robust principal components' analysis (RPCA) problem. In recent work, RPCA has been defined as a problem of separating a low-rank matrix (true data), $L$, and a sparse matrix (outliers), $S$, from their…

Information Theory · Computer Science 2016-02-01 Jinchun Zhan , Brian Lois , Namrata Vaswani

In this work, we address the following matrix recovery problem: suppose we are given a set of data points containing two parts, one part consists of samples drawn from a union of multiple subspaces and the other part consists of outliers.…

Information Theory · Computer Science 2014-04-01 Guangcan Liu , Huan Xu , Shuicheng Yan

Expressing a matrix as the sum of a low-rank matrix plus a sparse matrix is a flexible model capturing global and local features in data popularized as Robust PCA (Candes et al., 2011; Chandrasekaran et al., 2009). Compressed sensing,…

Numerical Analysis · Mathematics 2022-04-28 Jared Tanner , Simon Vary

We propose a general framework for reconstructing transform-sparse images from undersampled (squared)-magnitude data corrupted with outliers. This framework is implemented using a multi-layered approach, combining multiple initializations…

In the field of data mining, how to deal with high-dimensional data is an inevitable problem. Unsupervised feature selection has attracted more and more attention because it does not rely on labels. The performance of spectral-based…

Machine Learning · Computer Science 2021-01-01 Zhengxin Li , Feiping Nie , Jintang Bian , Xuelong Li

The task of reconstructing a low rank matrix from incomplete linear measurements arises in areas such as machine learning, quantum state tomography and in the phase retrieval problem. In this note, we study the particular setup that the…

Information Theory · Computer Science 2016-12-12 Holger Rauhut , Ulrich Terstiege

In health-pollution cohort studies, accurate predictions of pollutant concentrations at new locations are needed, since the locations of fixed monitoring sites and study participants are often spatially misaligned. For multi-pollution data,…

Applications · Statistics 2022-01-24 Phuong T. Vu , Adam A. Szpiro , Noah Simon

Subspace tracking is a fundamental problem in signal processing, where the goal is to estimate and track the underlying subspace that spans a sequence of data streams over time. In high-dimensional settings, data samples are often corrupted…

In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursuit, is proposed. It is motivated as a tool for video…

Computer Vision and Pattern Recognition · Computer Science 2015-03-17 Chenlu Qiu , Namrata Vaswani