z-logo
open-access-imgOpen Access
Adaptive weight matrix and phantom intensity learning for computed tomography of chemiluminescence
Author(s) -
Hujie Pan,
Di Xiao,
Fuhao Zhang,
Xuesong Li
Publication year - 2021
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.427459
Subject(s) - imaging phantom , computer science , voxel , computation , robustness (evolution) , artificial intelligence , projection (relational algebra) , pixel , algorithm , iterative reconstruction , computer vision , optics , physics , biochemistry , chemistry , gene
Classic algebraic reconstruction technique (ART) for computed tomography requires pre-determined weights of the voxels for the projected pixel values to build the equations. However, such weights cannot be accurately obtained in the application of chemiluminescence measurements due to the high physical complexity and computation resources required. Moreover, streaks arise in the results from ART method especially with imperfect projections. In this study, we propose a semi-case-wise learning-based method named Weight Encode Reconstruction Network (WERNet) to co-learn the target phantom intensities and the adaptive weight matrix of the case without labeling the target voxel set and thus offers a more applicable solution for computed tomography problems. Both numerical and experimental validations were conducted to evaluate the algorithm. In the numerical test, with the help of gradient normalization, the WERNet reconstructed voxel set with a high accuracy and showed a higher capability of denoising compared to the classic ART methods. In the experimental test, WERNet produces comparable results to the ART method while having a better performance in avoiding the streaks. Furthermore, with the adaptive weight matrix, WERNet is not sensitive to the ensemble intensity of the projection which shows much better robustness than ART method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here