A combinatorial approach to L₁-matrix factorization

DOI10.1007/S10851-014-0533-0MaRDI QIDQ2515367zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical examplesrobust estimationsingular value decompositionalgorithmphotometric stereostructure-from-motion\(L_1\)-matrix factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

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

Cites work

• scientific article; zbMATH DE number 3599325 (Why is no real title available?)
• scientific article; zbMATH DE number 2045457 (Why is no real title available?)
• A framework for robust subspace learning
• A simple prior-free method for non-rigid structure-from-motion factorization
• Arbitrary-norm separating plane
• Exact matrix completion via convex optimization
• Linear Fitting with Missing Data for Structure-from-Motion
• Multiple View Geometry in Computer Vision
• Robust principal component analysis?
• The \(L_1\)-norm best-fit hyperplane problem

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)