A combinatorial approach to L₁-matrix factorization
DOI10.1007/S10851-014-0533-0zbMATH Open1321.65059OpenAlexW1993537537MaRDI QIDQ2515367FDOQ2515367
Authors: Fangyuan Jiang, Olof Enqvist, Fredrik Kahl 
Publication date: 31 July 2015
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-014-0533-0
Recommendations
- A unification of some matrix factorization results
- Factorization approach to structured low-rank approximation with applications
- Problem of the approximate matrix factorization and its applications
- Matrix factorization and lifting
- Approximate low-rank factorization with structured factors
- A constrained matrix factorization problem
- Lower bounds for matrix factorization
- Lower bounds for matrix factorization
- On the complexity of nonnegative matrix factorization
numerical examplesrobust estimationsingular value decompositionalgorithmphotometric stereostructure-from-motion\(L_1\)-matrix factorization
Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cites Work
- Robust principal component analysis?
- Exact matrix completion via convex optimization
- A framework for robust subspace learning
- Multiple View Geometry in Computer Vision
- Arbitrary-norm separating plane
- The \(L_1\)-norm best-fit hyperplane problem
- Title not available (Why is that?)
- A simple prior-free method for non-rigid structure-from-motion factorization
- Linear Fitting with Missing Data for Structure-from-Motion
- Title not available (Why is that?)
This page was built for publication: A combinatorial approach to \(L_1\)-matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515367)
