par Noo, Frédéric;Clack, Rolf;Defrise, Michel
Référence IEEE transactions on nuclear science, 44, 3 PART 2, page (1309-1316)
Publication Publié, 1997
Article révisé par les pairs
Résumé : This paper addresses image reconstruction in cone-beam tomography from an arbitrary discrete set of positions of the cone vertex. As a first step in the analysis of the problem, we define some measures of how close a discrete vertex set comes to satisfying Tuy's condition [1]. Next, we propose three rebinning algorithms which use Orangeat's formula [2] and Marr's algorithm [3], and are capable of accurate reconstructions. The first algorithm is designed to accurately process cone-beam data finely sampled along a vertex path satisfying Tuy's condition. The second algorithm applies to pair-complete vertex sets. The third algorithm is suited to process any discrete vertex set. The efficacy of the algorithms is illustrated with reconstructions from computer-simulated data using several vertex sets, including a set of randomly placed vertices. © 1997 IEEE.