dcsimg

Rethinking Principal Component Analysis (PCA) for Modern Data Sets: Theory, Algorithms, and Applications

Volume 106, Issue 8 | August 2018

Guest Editors:

Namrata Vaswani
Yuejie Chi
Thierry Bouwmans

Special Issue Papers

Scanning the Issue

By N. Vaswani, Y. Chi, and T. Bouwmans

PCA in High Dimensions: An Orientation

By I. M. Johnstone and D. Paul

This paper provides a broad overview of the key phenomena associated with high-dimensional PCA, focusing on asymptotic results for the closeness of eigenvalues and eigenvectors of the sample covariance matrices to those of the population covariance matrix.

Streaming PCA and Subspace Tracking: The Missing Data Case

By L. Balzano, Y. Chi, and Y. M. Lu

This paper reviews both classical and recent algorithms, together with their performance guarantees, for solving the PCA problem in an online fashion under memory and computation constraints.

A Selective Overview of Sparse Principal Component Analysis

By H. Zou and L. Xue

This paper provides a selective overview of methodological and theoretical developments of sparse PCA that produce principal components that are sparse, i.e., have only a few nonzero entries.

A Review of Distributed Algorithms for Principal Component Analysis

By S. X. Wu, H. Wai, Lin Li, and A. Scaglione

This paper discusses distributed PCA algorithms that are amenable when data are distributively acquired without communicating and accessing the entire data set locally.

Extension of PCA to Higher Order Data Structures: An Introduction to Tensors, Tensor Decompositions, and Tensor PCA

By A. Zare, A. Ozdemir, M. A. Iwen, and S. Aviyente

This paper reviews the extension of PCA to tensors, which are multiway data that find important applications in many domains.

Static and Dynamic Robust PCA and Matrix Completion: A Review

By N. Vaswani and P. Narayanamurthy

This paper provides an exhaustive overview of the literature on robust PCA [PCA or subspace recovery in the presence of elementwise (sparse) outliers] and its dynamic extension (robust subspace tracking), and matrix completion, with an emphasis on provably correct methods.

An Overview of Robust Subspace Recovery

By G. Lerman and T. Maunu

This paper overviews the entire body of work on robust subspace recovery (subspace recovery when an entire data vector is either an “inlier” or an “outlier”), emphasizing the advantages and disadvantages of the various proposed approaches on this topic and discussing unsolved problems in the area.

Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants

By S. Ma and N. S. Aybat

This paper reviews specialized efficient optimization algorithms that have been developed to solve convex relaxations of various optimization programs that can be defined to solve robust PCA and related problems.

On the Applications of Robust PCA in Image and Video Processing

By T. Bouwmans, S. Javed, H. Zhang, Z. Lin, and R. Otazo

This paper surveys the applications of RPCA in computer vision and biomedical imaging by reviewing representative image processing applications (low-level imaging, biomedical imaging, 3-D computer vision), and video processing applications such as background/foreground separation.

Point of View