Sciweavers

64 search results - page 9 / 13
» Comparison of Energy Minimization Algorithms for Highly Conn...
Sort
View
MICCAI
2009
Springer
14 years 19 hour ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eļ¬...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 8 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
CVPR
2007
IEEE
14 years 1 months ago
Optimized Color Sampling for Robust Matting
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ā€¯alphaā€¯, for those pixels that are a mixt...
Jue Wang, Michael F. Cohen
CVPR
2000
IEEE
14 years 9 months ago
Fixed Topology Skeletons
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchang...
Polina Golland, W. Eric L. Grimson
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 4 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel