max_tree — SEGMENTATION graph op

• Data kinds: image2d → table

• Call: import fullseye as fs; fs.ledger.max_tree(image, *, connectivity: 'int' = 4) -> 'Dict[str, object]' (to call the implementation directly, import seggraph; seggraph.max_tree(image, *, connectivity: 'int' = 4) -> 'Dict[str, object]'; from the registry, opssegmentation.get("max_tree"))

Usage

Component tree (max-tree): builds the tree of connected components of the upper level sets {f ≥ h} with Union-Find (pixels processed in descending order of value) (max_tree).

> The detailed description below is the original text — the summary and the headings are translated.

返す: `parent(H, W の平らな添字。根は自分自身)、order(値の昇順、親は子より前)、canonical`(節の代表画素の印 =

根か、親と値が違う画素)、`area(代表画素での成分の画素数)、diameter`(成分の外接矩形の長い辺 = skimage の diameter と同じ)、

`height(成分の中の最大値 − 成分の値、参考)、n_nodes`。

Detailed usage guide

• halcon_segmentation family guide

Background guides (the physics and conventions behind this op)

• graph_hierarchy_and_thresholds — グラフ・階層・閾値の定理でつくる分割 — 何が厳密で、どこで割れ方が倒れるか

References (sample data, literature)

• 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.

Runnable examples (verified samples that actually call this op)

• (none yet)

Ops the type connects to (they accept table as input)

class_ndim_norm

Same category (graph)

graph_cut_binary · alpha_expansion · statistical_region_merging · area_opening_attr · quasi_flat_zones · alpha_tree · hierarchical_watershed · ultrametric_contour_map

*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.