2079 search results - page 235 / 416 » Universality of random graphs |
205
click to vote
MICCAI
2010
Springer
15 years 5 months ago
2010
Springer
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
167
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
197
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
197
click to vote
ICPR
2008
IEEE
16 years 29 days ago
2008
IEEE
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
213
click to vote
MIR
2006
ACM
16 years 15 days ago
2006
ACM
The variety of features available to represent multimedia data constitutes a rich pool of information. However, the plethora of data poses a challenge in terms of feature selectio...