A generalized projective reconstruction theorem and depth constraints for projective factorization
From MaRDI portal
(Redirected from Publication:1800002)
Recommendations
- On one generalization for the projection matrices method in the S-matrix factorization problem
- Factorizations of relative extremal projectors
- The projectors of the decomposition theorem are motivated
- Reconstructing (0,1)-matrices from projections using integer programming
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Factorisation of orthogonal projectors
Cites work
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Critical configurations for projective reconstruction from multiple views
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3072597 (Why is no real title available?)
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Multiple View Geometry in Computer Vision
- The twisted cubic and camera calibration
Cited in
(3)
This page was built for publication: A generalized projective reconstruction theorem and depth constraints for projective factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800002)