Premium
SU‐F‐I‐07: CBCT Denoising Based On Adaptive Dictionary Learning Algorithms
Author(s) -
Qin Shaohua,
Yin Juan,
Li Hongsheng,
Chen Jinhu,
Yin Yong,
Li Dengwang
Publication year - 2016
Publication title -
medical physics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.473
H-Index - 180
eISSN - 2473-4209
pISSN - 0094-2405
DOI - 10.1118/1.4955835
Subject(s) - singular value decomposition , k svd , noise (video) , sparse approximation , algorithm , noise reduction , computer science , mathematics , gaussian noise , pattern recognition (psychology) , artificial intelligence , image (mathematics)
Purpose: We proposed a new dictionary learning algorithm (AK‐SVD) based on K‐SVD. AK‐SVD can denoise the CBCT image, and did not need the noise information as prior knowledge. Methods: The AK‐SVD had two steps: signal sparse representation, and then dictionary optimization. The CBCT image was sparse, and there were limited big coefficients. The other coefficients were zero or near zero. In the sparse representation step of traditional K‐SVD, the noise variance was used as a threshold to select the big representation coefficients. This increased the complexity of the algorithm. The denoising result also was affected by the accuracy of the noise variance estimation, especially in non‐Gaussian noise. In AK‐SVD we used the average of the existing big coefficients as a threshold. The new found coefficient was compared with the threshold. If it was bigger than this threshold, it will be determined as the big coefficient, and be added to the set of existing big coefficients. The finding process continued. If it was smaller than this threshold, the finding process was end.This threshold was not related to the noise variance, and based on this method we improved the traditional K‐SVD. Results: In the synthetic experiments about designing dictionary from synthetic signals, the correct rate of dictionary learning by the AK‐SVD was similar with the ideal results of the K‐SVD where the noise variance was known. However, the AK‐SVD algorithm did not need to evaluate the noise variance, so it had lower computational complexity and wider adaptability. In the denoising experiment about the CBCT image corrupted by the non‐Gaussian noise, AK‐SVD has an advantage in terms of texture. Conclusion: The AK‐SVD can work well with the noise variance unknown, and it had lower computational complexity and wider adaptability than K‐SVD. This work was jointly supported by National Natural Science Foundation of China (61471226), Natural Science Foundation for Distinguished Young Scholars of Shandong Province (JQ201516), China Postdoctoral Science Foundation (2015T80739, 2014M551949), and research funding from Jinan (201401221).