14779 search results - page 2 / 2956 » On Ultrametric Algorithmic Information |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
SCALESPACE
1999
Springer
13 years 9 months ago
1999
Springer
The classical morphological segmentation paradigm is based on the watershed transform, constructed by flooding the gradient image seen as a topographic surface. For flooding a to...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
In this paper, we address the problem of constrained segmentation of natural images, in which a human user places one seed point inside each object of interest in the image and th...
APPML
2010
13 years 5 months ago
2010
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...