Robust CUR Decomposition: Theory and Imaging Applications
arXiv:2101.05231 · doi:10.1137/20M1388322
Abstract
This paper considers the use of Robust PCA in a CUR decomposition framework and applications thereof. Our main algorithms produce a robust version of column-row factorizations of matrices where is low-rank and contains sparse outliers. These methods yield interpretable factorizations at low computational cost, and provide new CUR decompositions that are robust to sparse outliers, in contrast to previous methods. We consider two key imaging applications of Robust PCA: video foreground-background separation and face modeling. This paper examines the qualitative behavior of our Robust CUR decompositions on the benchmark videos and face datasets, and find that our method works as well as standard Robust PCA while being significantly faster. Additionally, we consider hybrid randomized and deterministic sampling methods which produce a compact CUR decomposition of a given matrix, and apply this to video sequences to produce canonical frames thereof.
References in corpus (1)
Cited by in corpus (11)
- Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
- Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling
- Quantum State Tomography for Matrix Product Density Operators
- Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
- Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent
- On the Robustness of Cross-Concentrated Sampling for Matrix Completion
- SAttention: Improving Long Sequence Attention with Smoothed Skeleton Sketching
- Subset Random Sampling and Reconstruction of Finite Time-Vertex Graph Signals
- Randomized Approach to Matrix Completion: Applications in Recommendation Systems and Image Inpainting
- Structured Sampling for Robust Euclidean Distance Geometry
- Property Inheritance for Subtensors in Tensor Train Decompositions