A Convex Solution to Spatially-Regularized Correspondence Problems.
Thomas WindheuserDaniel CremersPublished in: ECCV (2) (2016)
Keyphrases
- optimization problems
- convex relaxation
- convex programming
- approximate solutions
- partial solutions
- multicriteria optimization
- neural network
- exact solution
- variational inequalities
- convex optimization
- point correspondences
- efficient solutions
- np complete
- least squares
- risk minimization
- optimal or near optimal
- previously solved
- dynamic programming