Research
Robust Principal Component Completion
arXiv:2603.25132v2 Announce Type: replace Abstract: Robust principal component analysis (RPCA) seeks a low-rank component and a sparse component from their summation. Yet, in many applications of inte
arXiv:2603.25132v2 Announce Type: replace Abstract: Robust principal component analysis (RPCA) seeks a low-rank component and a sparse component from their summation. Yet, in many applications of interest, the sparse foreground actually replaces, or occludes, elements from the low-rank background. To address this mismatch, a new framework is proposed in which the sparse component is identified indirectly through determining its support. This approach, called robust principal component completion (RPCC), is solved via variational Bayesian inference applied to a fully probabilistic Bayesian sparse tensor factorization. Convergence to a hard classifier for the support is shown, thereby eliminating the post-hoc thresholding required of most prior RPCA-driven approaches. Experimental results reveal that the proposed approach delivers near-optimal estimates on synthetic data as well as robust foreground-extraction and anomaly-detection performance on real color video and hyperspectral datasets, respectively. Source implementation and Appendices are available at https://github.com/WongYinJ/BCP-RPCC.
Related
- PrefPaint: Enhancing Medical Image Inpainting through Expert Human Feedback
- Visual Sparse Steering (VS2): Unsupervised Adaptation for Image Classification using Sparsity-Guided Steering Vectors
- Sparse Hypergraph-Enhanced Frame-Event Object Detection with Fine-Grained MoE
- Data Leakage Detection and De-duplication in Large Scale Geospatial Image Datasets
- Improving Image Coding for Machines through Optimizing Encoder via Auxiliary Loss
Source: arXiv cs.CV | 2026-04-23