2314 search results - page 246 / 463 » Minimal Partitions of a Graph |
145
click to vote
ICIAR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
147
click to vote
MICCAI
2010
Springer
15 years 2 months ago
2010
Springer
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
164
click to vote
PAMI
2010
15 years 2 months ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
164
click to vote
CIARP
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
127
click to vote
GD
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...