Closed zjutk closed 1 month ago
Hi Kun,
To see that they are equivalent, consider this:
$$logL = \sum_i y_i \log \bar{y_i} - \sum_i \bar{y_i} $$
now rewrite $y_i$ as
$$y_i = \sum_1^{y_i} 1$$
(the counts in sinogram bin "i" are a sum of ones $y_i$ times)
$$logL = \sum_i \sum_1^{y_i} \log \bar{y_i} - \sum_i \bar{y_i} $$
the first two sums can be rewritten as the sum over all events (with event index $t$ and corresponding sinogram bin $i_t$)
$$logL = \sum{events \ t} \log \bar{y}{i(t)} - \sum_i \bar{y_i} $$
If we now insert the forward model (ignoring scatter and randoms)
$$\bar{y_i} = \sumj a{ij} x_j$$
we get the expression of Ote et al.
Dear Professor Georg Schramm,
I recently reviewed the various algorithm examples in the Iterative Listmode Algorithm Examples and noticed your expression for the list-mode negative Poisson log-likelihood function:
I would like to confirm with you whether this expression aligns with the Listmode re-formulation of the sinogram-based minimization problem in your paper "Fast and memory-efficient reconstruction of sparse Poisson data in listmode with non-smooth priors with application to time-of-flight PET."
Additionally, I observed that your expression for the list-mode negative Poisson log-likelihood function appears to differ from those mentioned in other literature, such as:
Can these two expressions be considered fundamentally equivalent?
I look forward to your response. Thank you!
Sincerely, Kun Tian