NDLI: Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise

Content Provider	IEEE Xplore Digital Library
Author	Chenlu Qiu Vaswani, N. Lois, B. Hogben, L.
Copyright Year	1963
Abstract	This paper studies the recursive robust principal components analysis problem. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, St, in the presence of large but structured noise, Lt. The structure that we assume on Lt is that Lt is dense and lies in a low-dimensional subspace that is either fixed or changes slowly enough. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background (Lt) from moving foreground objects (St) on-the-fly. To solve the above problem, in recent work, we introduced a novel solution called recursive projected CS (ReProCS). In this paper, we develop a simple modification of the original ReProCS idea and analyze it. This modification assumes knowledge of a subspace change model on the Lt's. Under mild assumptions and a denseness assumption on the unestimated part of the subspace of Lt at various times, we show that, with high probability, the proposed approach can exactly recover the support set of St at all times, and the reconstruction errors of both St and Lt are upper bounded by a time-invariant and small value. In simulation experiments, we observe that the last assumption holds as long as there is some support change of St every few frames.
Sponsorship	IEEE Information Theory Society
Starting Page	5007
Ending Page	5039
Page Count	33
File Size	1889983
File Format	PDF
ISSN	00189448
Volume Number	60
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors Principal component analysis Robustness Linear matrix inequalities Noise Sparse matrices Eigenvalues and eigenfunctions robust matrix completion Robust PCA sparse recovery compressive sensing
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Online Algorithm for Separating Sparse and Low-Dimensional Signal Sequences From Their Sum

Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise

Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise (parts 1 and 2 combined)

Robust PCA via Outlier Pursuit

Robust Lasso With Missing and Grossly Corrupted Observations

Concentration of Measure Inequalities for Toeplitz Matrices With Applications

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

Robust 2D Principal Component Analysis: A Structured Sparsity Regularized Approach

The Sparse Principal Component of a Constant-Rank Matrix

Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise

Similar Documents

An Online Algorithm for Separating Sparse and Low-Dimensional Signal Sequences From Their Sum

Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise

Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise (parts 1 and 2 combined)

Robust PCA via Outlier Pursuit

Robust Lasso With Missing and Grossly Corrupted Observations

Concentration of Measure Inequalities for Toeplitz Matrices With Applications

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

Robust 2D Principal Component Analysis: A Structured Sparsity Regularized Approach

The Sparse Principal Component of a Constant-Rank Matrix

Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise