tb_tcspc_coates_correct — 2D typed op

• 資料種類:counts → counts

• 呼叫:fullseye.apply(img, "tb_tcspc_coates_correct", a=0.5, b=0.5)(2-D 的模型是一張圖 + 兩個純量旋鈕 a,b∈[0,1])

tb_tcspc_coates_correct: input → output

*圖為在 128×128 合成輸入上實際執行的輸出。左為輸入,右為輸出。點雲以俯視散點顯示(亮度 = z),一維序列為折線,體資料為沿 z 的最大值投影,影片為中間影格,複數影像為振幅;無法成像的回傳值直接顯示數值。*

*旋鈕 a 不改變輸出(實測: 0.1 / 0.5 / 0.9 相同)。*

*旋鈕 b 不改變輸出(實測: 0.1 / 0.5 / 0.9 相同)。*

階段(前置運算子 → 本運算子,由左至右):

▸ tb_tcspc_coates_correct: 處理階段 (文件網站)

換別的影像(合成場景 / 照片 / 硬幣。上排為輸入,下排為對應輸出。旋鈕取預設):

▸ tb_tcspc_coates_correct: 其他輸入影像 (文件網站)

用法

精確消除 TCSPC 堆積效應(Coates 估計量)——早到光子偏差。

> 以下的詳細說明為原文 —— 摘要與標題已翻譯。

Classical TCSPC records at most one photon per excitation cycle: the first one. Late bins are therefore starved, because the cycles in which an early photon arrived never reach them, and the measured histogram is biased toward short arrival times — a dToF depth read straight off a piled-up histogram is *too close*, and a fluorescence lifetime is *too short*.

Coates's estimator inverts that exactly. With N_k the measured counts in bin k and C the number of excitation cycles, the number of cycles that survived to reach bin k is D_k = C - sum_{j<k} N_j, the per-cycle detection probability in that bin is p_k = N_k / D_k and the pile-up-free per-cycle intensity is lambda_k = -ln(1 - p_k). This op returns C * lambda_k — the histogram the same scene would have produced if the detector could record every photon — so it is directly comparable to the measured one.

This is an exact inverse, not a linearisation: build a histogram from a known lambda through the forward model N_k = C * exp(-sum_{j<k} lambda_j) * (1 - exp(-lambda_k)) and Coates returns lambda to machine precision (measured max relative error 1.6e-15 in the tests, on a pile-up so severe that the last bin was suppressed to 14.8% of its true counts).

*hist* is the 1-D measured histogram (counts per bin); *cycles* the number of excitation cycles (laser pulses) that produced it.

Raises ValueError: negative, non-finite or non-1-D *hist*, a non-positive or non-integer *cycles*, a histogram whose total exceeds *cycles* (impossible: at most one photon per cycle — a sure sign that *cycles* is wrong or the data are not first-photon TCSPC), and any bin that consumed every remaining cycle (p_k = 1, where -ln(0) is inf).

Typed bridge of the photon op tcspc_coates_correct into the 2-D evolution registry: the same implementation, called under the op(v, a, b) convention. This op has no tunable parameter; a and b are unused.

參考(範例資料、文獻)

• 範例資料目錄(下載 URL / 授權) —— 2-D 用 skimage.data(BSD/公有領域)加合成圖,3-D 給出真實資料源(Stanford/PDS 等)的下載 URL。

• 運算子來歷與參考文獻 —— 該運算子族所依據的研究/方法出處。

在 Studio 中試試

下面的程式已確認可以執行(與圖相同的輸入)。在 Studio 說明中,此區塊會變成按鈕,可當場載入並執行。

img_to_counts 0.50 0.50
tb_tcspc_coates_correct 0.50 0.50

▸ 載入此管線  ·  載入並執行

可執行的範例(實際呼叫該運算子並已驗證的樣例)

下面的範例呼叫的是底層帳本運算子 tcspc_coates_correct。此橋接運算子只是把同一實作適配為 fn(v, a, b) 慣例,行為完全相同(只是呼叫形式不同)。

• photon_timeresolved — py -3.11 examples/photon_timeresolved.py

• poc_dtof_ranging — py -3.11 examples/poc_dtof_ranging.py

型別可銜接的下一個運算子(可接受 counts 作為輸入)

identity · tb_spad_deadtime_apply · tb_spad_deadtime_correct · tb_tcspc_irf_convolve · tb_tcspc_background_subtract · tb_dtof_depth · tb_countrate_to_counts · tb_counts_to_countrate

同類別(typed)

tb_points_to_voxel · tb_estimate_point_normals · tb_iss_keypoints · tb_project_points · tb_render_point_depth · tb_statistical_outlier_removal · tb_radius_outlier_removal · tb_voxel_grid_downsample


*Provenance: ops.py — 2D 運算子登記表。本條目由 tools/opdocs.py md 自動產生(請勿手動編輯)。*

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