The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Robust Matrix Factorization with Unknown Noise
Abstract
Many problems in computer vision can be posed as recovering a low-dimensional subspace from high-dimensional visual data. Factorization approaches to low-rank subspace estimation minimize a loss function between the observed measurement matrix and a bilinear factorization. Most popular loss functions include the L1and L2losses. While L1is optimal for Laplacian distributed noise, L2is optimal for Gaussian noise. However, real data is often corrupted by an unknown noise distribution, which is unlikely to be purely Gaussian or Laplacian. To address this problem, this paper proposes a low-rank matrix factorization problem with a Mixture of Gaussians (MoG) noise. The MoG model is a universal approximator for any continuous distribution, and hence is able to model a wider range of real noise distributions. The parameters of the MoG model can be estimated with a maximum likelihood method, while the subspace is computed with standard approaches. We illustrate the benefits of our approach in extensive synthetic, structure from motion, face modeling and background subtraction experiments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Cited by
Weighted Nuclear Norm Minimization and Its Applications to Low Level Vision
Gu, S., Xie, Q., Meng, D., Zuo, W., Feng, X., & Zhang, L. (2017) · International Journal of Computer Vision · doi:10.1007/s11263-016-0930-5 · Cited by 816
Self-citationImage Blind Denoising with Generative Adversarial Network Based Noise Modeling
Chen, J., Chen, J., Chao, H., & Yang, M. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00333 · Cited by 599
Kronecker-Basis-Representation Based Tensor Sparsity and Its Applications to Tensor Recovery
Xie, Q., Zhao, Q., Meng, D., & Xu, Z. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2734888 · Cited by 318
Self-citationHSI-DeNet: Hyperspectral Image Restoration via Convolutional Neural Network
Chang, Y., Yan, L., Fang, H., Zhong, S., & Liao, W. (2019) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2018.2859203 · Cited by 317
Bouwmans, T., Sobral, A., Javed, S., Jung, S. K., & Zahzah, E.-H. (2017) · Computer Science Review · doi:10.1016/j.cosrev.2016.11.001 · Cited by 267
Metadata
- Authors
- Meng, D., & De la Torre, F.
- Venue
- 2013 IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2013-12
- Pages
- 1337-1344
- OpenAlex
- W2138507544
- Cited by
- 222
- References
- 1
- FWCI
- 6.40
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust Matrix Factorization with Unknown Noise. https://app.cochat.ai/papers/10.1109/iccv.2013.169
- The paper
- Meng, D., & De la Torre, F. (2013). Robust Matrix Factorization with Unknown Noise. 2013 IEEE International Conference on Computer Vision. https://doi.org/10.1109/iccv.2013.169
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.