tree op• 資料種類:table × signal → table
• 呼叫: import fullseye as fs; fs.ledger.tree_run_length(tree, labels, background=0, zero_labels=None)(要直接呼叫實作,import treemorph; treemorph.tree_run_length(tree, labels, background=0, zero_labels=None);從台帳取用則 opsgraph.get("tree_run_length"))
> 該運算子的說明尚無譯文,以下照原文給出。
Expected run length (ERL) of a skeleton under a candidate labelling of its nodes.
`labels` gives, for every node of the tree table, the candidate object it falls in.
A run is a maximal connected piece of the tree whose nodes all carry the same
label and that holds at least one edge; its length is the cable inside it (an edge
belongs to a run only if both ends share the label; a lone node between two cuts is
no run). Edges touching `background` belong to no run. Runs whose label is
in `zero_labels` (objects that also cover another skeleton — a merge) count as length
0, as in Januszewski et al. 2018: a merged run is not trustworthy anywhere.
`erl = sum(l_i^2) / L with L` the whole cable — the run length a point drawn
uniformly along the skeleton finds itself in (points on cut or background edges find
length 0). Also returns `run_lengths` (one per run, merged runs already zeroed),
`runs, max_run, cable_length, cut_edges` (both ends labelled, differently),
`background_edges and merged_runs`.
Identities: `erl == L` when every node carries one non-background label;
`sum(run_lengths) + cut cable + background cable == L`; for any labelling with
`k runs and no lost cable, erl >= L / k (Cauchy-Schwarz) and erl <= max_run`;
a path of length `L cut at m equally spaced points gives exactly L / (m + 1)`;
cut at `m uniformly random points, E[erl] = 2L / (m + 2)` (Dirichlet(1, .., 1)).
Raises `ValueError: not a tree table; labels` not one integer per node,
non-finite or non-integer.
• 範例資料目錄(下載 URL / 授權) —— 2-D 用 skimage.data(BSD/公有領域)加合成圖,3-D 給出真實資料源(Stanford/PDS 等)的下載 URL。
• 運算子來歷與參考文獻 —— 該運算子族所依據的研究/方法出處。
• 演算法的正典(作者・年份)與用途見上面的族使用指南。
• poc_skeleton_run_length_vs_voi — py -3.11 examples/poc_skeleton_run_length_vs_voi.py
table 作為輸入)graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl
tree)tree_from_swc · tree_morphometry · tree_sholl
*Provenance: treemorph.py — GRAPH 運算子登記表。本條目由 tools/opdocs.py md 自動產生(請勿手動編輯)。*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.