Low-rank Matrix Factorization under General Mixture Noise Distributions
Xiangyong Cao, Qian Zhao, Deyu Meng, Yang Chen, Zongben Xu

TL;DR
This paper introduces a novel low-rank matrix factorization model that adaptively handles complex noise distributions by using a mixture of exponential power distributions, enhanced with Markov random fields for improved noise modeling.
Contribution
It proposes the first LRMF model based on MoEP distributions, integrating Markov random fields and developing EM algorithms for robust noise fitting in high-dimensional data.
Findings
Effective in modeling complex noise in synthetic data
Improves face modeling and hyperspectral image restoration
Enhances background subtraction accuracy
Abstract
Many computer vision problems can be posed as learning a low-dimensional subspace from high dimensional data. The low rank matrix factorization (LRMF) represents a commonly utilized subspace learning strategy. Most of the current LRMF techniques are constructed on the optimization problems using L1-norm and L2-norm losses, which mainly deal with Laplacian and Gaussian noises, respectively. To make LRMF capable of adapting more complex noise, this paper proposes a new LRMF model by assuming noise as Mixture of Exponential Power (MoEP) distributions and proposes a penalized MoEP (PMoEP) model by combining the penalized likelihood method with MoEP distributions. Such setting facilitates the learned LRMF model capable of automatically fitting the real noise through MoEP distributions. Each component in this mixture is adapted from a series of preliminary super- or sub-Gaussian candidates.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
