graph op• Data kinds: image2d → table
• Call: import fullseye as fs; fs.ledger.ultrametric_contour_map(image, *, mask=None, connectivity: 'int' = 4, distance_matrix: 'bool' = False) -> 'Dict[str, object]' (to call the implementation directly, import seggraph; seggraph.ultrametric_contour_map(image, *, mask=None, connectivity: 'int' = 4, distance_matrix: 'bool' = False) -> 'Dict[str, object]'; from the registry, opssegmentation.get("ultrametric_contour_map"))
Ultrametric contour map (UCM) of the dynamics hierarchy: the value between neighbouring pixels p, q = the smallest threshold at which p and q fall into the same region (ultrametric_contour_map).
> The detailed description below is the original text — the summary and the headings are translated.
盆地の中の辺は 0、盆地の境の辺は第 2 の Kruskal(盆地の木を saliency の昇順に併合)で 2 つの盆地が出会う高さ。
返す: `ucm_h(H, W − 1:画素とその右)、ucm_v(H − 1, W:画素とその下)、ucm`(画素ごとに右と下の大きい方 =
境界を左上の画素で代表、segeval と同じ)、`basins、levels、distance(distance_matrix=True` かつ盆地が
2500 以下なら盆地の全組の ultrametric 距離の行列)。閾値 θ で ucm > θ の辺を切った成分 = hierarchical_watershed(θ)。
• halcon_segmentation family guide
• graph_hierarchy_and_thresholds — グラフ・階層・閾値の定理でつくる分割 — 何が厳密で、どこで割れ方が倒れるか
• Sample-data catalog (download URLs / licences) — 2-D uses skimage.data (BSD/public domain) plus synthetic images; 3-D lists download URLs for real data sources (Stanford, PDS, …).
• Operator provenance and references — the sources of the research/methods this op family came from.
• The canonical algorithm (author, year) and its uses are named in the family usage guide above.
• poc_graph_hierarchy_segmentation — py -3.11 examples/poc_graph_hierarchy_segmentation.py
table as input)graph)graph_cut_binary · alpha_expansion · statistical_region_merging · max_tree · area_opening_attr · quasi_flat_zones · alpha_tree · hierarchical_watershed
*Provenance: seggraph.py — SEGMENTATION operator registry. This per-op note is generated by tools/opdocs.py md (do not hand-edit).*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.