physarum_transport_image — GRAPH flow op

• 데이터 종류: image2d × image2d → table

• 호출: import fullseye as fs; fs.ledger.physarum_transport_image(a, b, connectivity=4, normalize=True, dt=0.1, max_iters=5000, tol=1e-06, gap_tol=1e-06, snapshots=0)(구현을 직접 호출하려면 import physarum_search; physarum_search.physarum_transport_image(a, b, connectivity=4, normalize=True, dt=0.1, max_iters=5000, tol=1e-06, gap_tol=1e-06, snapshots=0), 원장에서 가져오려면 opsgraph.get("physarum_transport_image"))

사용법

> 이 연산자의 설명은 아직 번역이 없습니다. 원문을 그대로 싣습니다.

Earth mover's distance between two mass images by the slime mould's tube dynamics.

Every pixel is a node; neighbouring pixels (`connectivity` 4 or 8) are joined by a tube of

length 1 (`sqrt(2)` on diagonals), so the ground metric is the grid path length (Manhattan

for 4, octile for 8). Mass `a enters and mass b leaves: the supply is a - b` after

both are scaled to unit mass (`normalize=True; with False` they must already carry the

same mass). Dynamics, convergence and the two-sided bound as in

:func:graph_physarum_transport; larger images run on the sparse Laplacian with conjugate

gradients.

Returns `cost` (the 1-Wasserstein distance estimate in pixel units, an upper bound),

`dual_bound (Kantorovich–Rubinstein lower bound), gap, conductance` (an image: each

pixel's thickest incident tube), `flow_field ((H, W, 2)`: the mean of the flow vectors

of the tubes at each pixel, in `(row, col)` units of mass per unit length, for drawing

arrows), `potential ((H, W) pressures), iters, converged, gap_converged`,

`history, cost_history, dual_history, and with snapshots = m > 0 also snapshots (m`

conductance images at evenly spaced iterations, the last one final), `snapshot_iters` and

`snapshot_cost (sum_e L_e |Q_e|` at those iterations) for watching the tubes form.

Raises `ValueError`: images not 2-D, finite, non-negative, of the same shape with at

least 2 rows and columns, or without mass; unequal masses when `normalize=False`;

`connectivity not 4 or 8; snapshots < 0; and as :func:graph_physarum_transport`.

참고(샘플 데이터·문헌)

• 샘플 데이터 카탈로그(DL URL / 라이선스) —— 2-D 는 skimage.data(BSD/public)+ 합성, 3-D 는 실데이터 소스(Stanford/PDS 등)의 DL URL.

• 연산자의 내력·참고문헌 —— 이 연산자 족의 바탕이 된 연구/기법의 출처.

• 알고리즘의 정전(저자·연도)과 용도는 위의 패밀리 사용 가이드에 적혀 있습니다.

실행 가능한 예제(이 연산자를 실제로 호출하는 검증된 샘플)

• poc_physarum_transport — py -3.11 examples/poc_physarum_transport.py

타입이 이어지는 다음 연산자(table 를 입력으로 받는 것)

graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl · tree_run_length

같은 카테고리(flow)

graph_physarum_path · physarum_route · graph_physarum_transport


*Provenance: physarum_search.py — GRAPH 연산자 레지스트리. 이 op 노트는 tools/opdocs.py md 가 자동 생성합니다(직접 편집하지 마세요).*

© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.