Sciweavers

24 search results - page 3 / 5
» Active Mean Fields: Solving the Mean Field Approximation in ...
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 5 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
TIP
2008
222views more  TIP 2008»
13 years 5 months ago
Local Region Descriptors for Active Contours Evolution
Edge-based and region-based active contours are frequently used in image segmentation. While edges characterize small neighborhoods of pixels, region descriptors characterize entir...
Cristina Darolti, Alfred Mertins, Christoph Bodens...
ICCV
2001
IEEE
14 years 7 months ago
Gradient Vector Flow Fast Geodesic Active Contours
This paper proposes a new front propagation flow for boundary extraction. The proposed framework is inspired by the geodesic active contour model and leads to a paradigm that is r...
Nikos Paragios, Olivier Mellina-Gottardo, Visvanat...
IJCV
2006
165views more  IJCV 2006»
13 years 5 months ago
A Riemannian Framework for Tensor Computing
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...
Xavier Pennec, Pierre Fillard, Nicholas Ayache
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 4 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet