Sciweavers

20 search results - page 3 / 4
» emmcvpr 2001
Sort
View
EMMCVPR
2001
Springer
14 years 2 months ago
3D Flux Maximizing Flows
A number of geometric active contour and surface models have been proposed for shape segmentation in the literature. The essential idea is to evolve a curve (in 2D) or a surface (i...
Kaleem Siddiqi, Alexander Vasilevskiy
EMMCVPR
2001
Springer
14 years 2 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...
EMMCVPR
2001
Springer
14 years 2 months ago
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
Manuele Bicego, Agostino Dovier, Vittorio Murino
EMMCVPR
2001
Springer
14 years 2 months ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
EMMCVPR
2001
Springer
14 years 2 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov