اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the equivalence between hierarchical segmentations and ultrametric watersheds
93
0
0.0
(
0
)
تأليف
Laurent Najman
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study hierarchical segmentation in the framework of edge-weighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exists a bijection between the set of ultrametric watersheds and the set of hierarchical segmentations. We end this paper by showing how to use the proposed framework in practice in the example of constrained connectivity; in particular it allows to compute such a hierarchy following a classical watershed-based morphological scheme, which provides an efficient algorithm to compute the whole hierarchy.
قيم البحث
اقرأ أيضاً
The free energy landscape of mean field marginal glasses is ultrametric. We demonstrate that this feature remains in finite three dimensional systems by finding sets of minima which are nearby in configuration space. By calculating the distance betwe
en these nearby minima, we produce a small region of the distance metric. This metric exhibits a clear hierarchical structure and shows the signature of an ultrametric space. That such a hierarchy exists for the jamming energy landscape provides direct evidence for the existence of a marginal phase along the zero temperature jamming line.
Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly su
rvey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing.
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In this paper,
we show the equivalence of many more classes of subtree overlap and subtree filament graphs, and equate them to classes of complements of cochordal-mixed graphs. Our results generalize the previously known results mentioned above.
The recent work by Achlioptas, DSouza, and Spencer opened up the possibility of obtaining a discontinuous (explosive) percolation transition by changing the stochastic rule of bond occupation. Despite the active research on this subject, several ques
tions still remain open about the leading mechanism and the properties of the system. We review the largest cluster and the Gaussian models recently introduced. We show that, to obtain a discontinuous transition it is solely necessary to control the size of the largest cluster, suppressing the growth of a cluster differing significantly, in size, from the average one. As expected for a discontinuous transition, a Gaussian cluster-size distribution and compact clusters are obtained. The surface of the clusters is fractal, with the same fractal dimension of the watershed line.
Constrained Differential Renormalization (CDR) and the constrained version of Implicit Regularization (IR) are two regularization independent techniques that do not rely on dimensional continuation of the space-time. These two methods which have rath
er distinct basis have been successfully applied to several calculations which show that they can be trusted as practical, symmetry invariant frameworks (gauge and supersymmetry included) in perturbative computations even beyond one-loop order. In this paper, we show the equivalence between these two methods at one-loop order. We show that the configuration space rules of CDR can be mapped into the momentum space procedures of Implicit Regularization, the major principle behind this equivalence being the extension of the properties of regular distributions to the regularized ones.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
