arXiv 1202.64452012-02-29cs.ITmath.IT

Principal Component Pursuit with Reduced Linear Measurements

Arvind Ganesh, Kerui Min, John Wright, Yi Ma

备注：: 32 pages, preliminary version submitted to ISIT'12

英文摘要：

In this paper, we study the problem of decomposing a superposition of a low-rank matrix and a sparse matrix when a relatively few linear measurements are available. This problem arises in many data processing tasks such as aligning multiple images or rectifying regular texture, where the goal is to recover a low-rank matrix with a large fraction of corrupted entries in the presence of nonlinear domain transformation. We consider a natural convex heuristic to this problem which is a variant to the recently proposed Principal Component Pursuit. We prove that under suitable conditions, this convex program guarantees to recover the correct low-rank and sparse components despite reduced measurements. Our analysis covers both random and deterministic measurement models.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit

We consider the problem of recovering a low-rank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magnitude. It has recently been shown that this problem can be solved efficiently and effectively by a convex program named Principal Component Pursuit (PCP), provided that the fraction of corrupted entries and the rank of the matrix are both sufficiently small. In this paper, we extend that result to show that the same convex program, with a slightly improved weighting parameter, exactly recovers the low-rank matrix even if "alm…

2010-01-22cs.ITmath.IT

Support-Predicted Modified-CS for Recursive Robust Principal Components' Pursuit

This work proposes a causal and recursive algorithm for solving the "robust" principal components' analysis (PCA) problem. We primarily focus on robustness to correlated outliers. In recent work, we proposed a new way to look at this problem and showed how a key part of its solution strategy involves solving a noisy compressive sensing(CS) problem. However, if the support size of the outliers becomes too large, for a given dimension of the current PC space, then the number of "measurements" available for CS may become too small. In this work, we show how to address this issue by utilizing the …

2011-03-01cs.ITmath.IT

Stable Principal Component Pursuit

In this paper, we study the problem of recovering a low-rank matrix (the principal components) from a high-dimensional data matrix despite both small entry-wise noise and gross sparse errors. Recently, it has been shown that a convex program, named Principal Component Pursuit (PCP), can recover the low-rank matrix when the data matrix is corrupted by gross sparse errors. We further prove that the solution to a related convex program (a relaxed PCP) gives an estimate of the low-rank matrix that is simultaneously stable to small entrywise noise and robust to gross sparse errors. More precisely, …

2010-01-14cs.ITmath.IT

Compressive Principal Component Pursuit

We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in compressed sensing of structured high-dimensional signals such as videos and hyperspectral images, as well as in the analysis of transformation invariant low-rank recovery. We analyze the performance of the natural convex heuristic for solving this problem, under the assumption that measurements are chosen uniformly at random. We prove that this heuristic exactly recovers low-rank and sparse terms, provided the number o…

2012-02-21cs.ITmath.IT

主成分追踪的强凸规划

Strongly Convex Programming for Principal Component Pursuit

the School of Electronic Engineering University of Electronic Science and Technology of China（电子科技大学电子工程学院）；Department of Electrical Engineering, ESAT-SCD / IBBT - KU Leuven Future Health Department, KU Leuven（荷语鲁汶大学电气工程系、ESAT-SCD/IBBT未来健康部门）

本文针对降维线性测量下的主成分追踪问题，提出强凸规划模型，给出精确恢复低秩和稀疏矩阵的充分条件及参数选择建议。

2012-09-20cs.ITcs.NAmath.IT

Real-time Robust Principal Components' Pursuit

Iowa State University（爱荷华州立大学）

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 surveillance applications with the background image sequence forming the low rank part and the moving objects/persons/abnormalities forming the sparse part. Each image frame is treated as a column vector of the data matrix made up of a low rank matrix and a sparse corruption matrix. Principal component pursuit solves the problem under the assumptions that the singul…

2011-02-12cs.CVcs.ITmath.IT

更多相关论文收起更多论文

Structural Analysis of Network Traffic Matrix via Relaxed Principal Component Pursuit

The network traffic matrix is widely used in network operation and management. It is therefore of crucial importance to analyze the components and the structure of the network traffic matrix, for which several mathematical approaches such as Principal Component Analysis (PCA) were proposed. In this paper, we first argue that PCA performs poorly for analyzing traffic matrix that is polluted by large volume anomalies, and then propose a new decomposition model for the network traffic matrix. According to this model, we carry out the structural analysis by decomposing the network traffic matrix i…

2012-03-06cs.ITcs.NIcs.PF

Minimum Complexity Pursuit: Stability Analysis

A host of problems involve the recovery of structured signals from a dimensionality reduced representation such as a random projection; examples include sparse signals (compressive sensing) and low-rank matrices (matrix completion). Given the wide range of different recovery algorithms developed to date, it is natural to ask whether there exist "universal" algorithms for recovering "structured" signals from their linear projections. We recently answered this question in the affirmative in the noise-free setting. In this paper, we extend our results to the case of noisy measurements.

2012-05-21cs.ITmath.IT

Robust Principal Component Analysis?

This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; among all feasible decompositions, simply minimize a weighted combination of the nuclear norm and of the L1 norm. This suggests the possibility of a principled approach to robust principal component anal…

2009-12-18cs.ITmath.IT

Douglas-Rachford迭代在基追踪中的最终线性收敛性

Eventual linear convergence of the Douglas Rachford iteration for basis pursuit

Massachusetts Institute of Technology（麻省理工学院）

本文通过主角度量化了Douglas-Rachford分裂算法在ℓ1最小化问题中的渐近线性收敛率，并展示了在压缩感知中如何用受限等距常数界定该速率，同时分析了ℓ2正则化和过松弛等更一般的迭代方案。

2013-05-29cs.ITcs.NAmath.IT

Deep Unfolding Basis Pursuit: Improving Sparse Channel Reconstruction via Data-Driven Measurement Matrices

For massive multiple-input multiple-output (MIMO) systems operating in frequency-division duplex mode, downlink channel state information (CSI) acquisition will incur large overhead. This overhead is substantially reduced when sparse channel estimation techniques are employed, owing to the channel sparsity in the angular domain. When a sparse channel estimation method is implemented, the measurement matrix, which is related to the pilot matrix, is essential to the channel estimation performance. Existing sparse channel estimation schemes widely adopt random measurement matrices, which have bee…

2022-03-27cs.ITeess.SPmath.IT

Robust PCA via Outlier Pursuit

Department of Electrical and Computer Engineering, The University of Texas at Austin（德克萨斯大学奥斯汀分校电气与计算机工程系）

Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it is nevertheless plagued by a well-known, well-documented sensitivity to outliers. Recent work has considered the setting where each point has a few arbitrarily corrupted components. Yet, in applications of SVD or PCA such as robust collaborative filtering or bioinformatics, malicious agents, defective genes, or simply corrupted or contaminated experiments may effectively yield entire points that are completely corrupte…

2010-12-31cs.ITcs.LGmath.IT

线性计算编码：指数搜索与降维状态算法

Linear Computation Coding: Exponential Search and Reduced-State Algorithms

本文研究线性计算编码，提出逐步最优搜索算法以超越DMP，并针对大矩阵引入降维状态算法，在保持计算可行性的同时实现至少10%的性能提升。

2023-01-13cs.ITeess.SPmath.IT

Sparse Signal Recovery from Nonadaptive Linear Measurements

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some orthonormal basis', from m = O(klogn), k<< n nonadaptive measurements . The accuracy of the recovered signal is 'as good as that attainable with direct knowledge of the k most important coefficients and its locations'. Moreover, a good approximation to those important coefficients is extracted from the measurements by solving a L1 minimization problem viz. Bas…

2013-10-31cs.ITmath.IT

稀疏主成分分析与能量剖面依赖的样本复杂度

Sparse Principal Component Analysis with Energy Profile Dependent Sample Complexity

Fudan University（复旦大学）；Weizmann Institute of Science（魏茨曼科学研究所）；Northeastern University（东北大学）

SEP通过适应能量剖面的样本复杂度，有效解决稀疏主成分分析中的样本限制问题，适用于不同能量分布情况，优于现有算法。

2026-08-25cs.ITmath.ITmath.ST