Sciweavers

269 search results - page 18 / 54
» A branch and bound method for stochastic global optimization
Sort
View
MICCAI
2005
Springer
15 years 10 months ago
Cross Entropy: A New Solver for Markov Random Field Modeling and Applications to Medical Image Segmentation
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...
Jue Wu, Albert C. S. Chung
ICCV
2009
IEEE
16 years 2 months ago
Globally Optimal Affine Epipolar Geometry from Apparent Contours
We study the problem of estimating the epipolar geometry from apparent contours of smooth curved surfaces with affine camera models. Since apparent contours are viewpoint depend...
Gang Li, Yanghai Tsin
WSCG
2004
142views more  WSCG 2004»
14 years 11 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
SPIESR
1997
97views Database» more  SPIESR 1997»
14 years 11 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
EOR
2008
79views more  EOR 2008»
14 years 9 months ago
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
Konstantinos Kaparis, Adam N. Letchford