Sciweavers

2527 search results - page 80 / 506
» Discrete optimization in computer vision
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
Optimal Estimation of Vanishing Points in a Manhattan World
In this paper, we present an analytical method for computing the globally optimal estimates of orthogonal vanishing points in a “Manhattan world” with a calibrated camera. We ...
Faraz Mirzaei, Stergios Roumeliotis
ECCV
2006
Springer
15 years 11 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
ICCV
2011
IEEE
13 years 9 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
ACCV
2007
Springer
15 years 4 months ago
Color Constancy Via Convex Kernel Optimization
This paper introduces a novel convex kernel based method for color constancy computation with explicit illuminant parameter estimation. A simple linear render model is adopted and ...
Xiaotong Yuan, Stan Z. Li, Ran He
ECCV
2000
Springer
15 years 11 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes