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"))
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).
Returns: parent (flat indices into H, W; the root is its own parent), order (ascending by value, parents before children), canonical (marks the representative pixel of a node = the root, or a pixel whose value differs from its parent's), area (pixel count of the component at the representative pixel), diameter (long side of the component's bounding rectangle = same as skimage's diameter), height (maximum within the component − the component's value, for reference), n_nodes.
• halcon_segmentation family guide
• graph_hierarchy_and_thresholds — Segmentation from graph, hierarchy and threshold theorems — what is exact, and where the partition breaks down
• 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.
• (none yet)
table as input)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.