Metal objects in X-ray computed tomography can cause severe artifacts.The state-of-the-art metal artifact reduction methods are in the sinogram inpainting category and are iterative methods.This paper proposes a proje...Metal objects in X-ray computed tomography can cause severe artifacts.The state-of-the-art metal artifact reduction methods are in the sinogram inpainting category and are iterative methods.This paper proposes a projectiondomain algorithm to reduce the metal artifacts.In this algorithm,the unknowns are the metal-affected projections,while the objective function is set up in the image domain.The data fidelity term is not utilized in the objective function.The objective function of the proposed algorithm consists of two terms:the total variation of the metalremoved image and the energy of the negative-valued pixels in the image.After the metal-affected projections are modified,the final image is reconstructed via the filtered backprojection algorithm.The feasibility of the proposed algorithm has been verified by real experimental data.展开更多
It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used suc...It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.展开更多
An iterative algorithm to calculate mutual correlation using hierarchical key points and the search space mark principle is proposed. An effective algorithm is designed to improve the matching speed. By hi-erarchical ...An iterative algorithm to calculate mutual correlation using hierarchical key points and the search space mark principle is proposed. An effective algorithm is designed to improve the matching speed. By hi-erarchical key point algorithm and mutual correlation coefficients of the matching images, the important points can be iteratively calculated in the images hierarchically, and the correlation coefficient can be ob-tained with satisfactory precision. Massive spots in the parameter space which are impossible to match can be removed by the search space mark principle. Two approximate continuities in the correlation image matching process, the image gray level distribution continuity and the correlation coefficient value in the parameter space continuity, are considered in the method. The experiments show that the new algorithm can greatly enhance matching speed and achieve accurate matching results.展开更多
目的比较不同水平的高级建模迭代重建算法(ADMIRE)对颞骨CT图像质量的影响。方法收集2023年1月至2月在空军军医大学唐都医院行颞骨CT扫描的患者24例,其中男性13例,女性11例;年龄21~61岁,平均年龄43.3岁。采用德国西门子SOMATOM FORCE C...目的比较不同水平的高级建模迭代重建算法(ADMIRE)对颞骨CT图像质量的影响。方法收集2023年1月至2月在空军军医大学唐都医院行颞骨CT扫描的患者24例,其中男性13例,女性11例;年龄21~61岁,平均年龄43.3岁。采用德国西门子SOMATOM FORCE CT扫描仪对24例患者行颞骨CT扫描,分别采用传统滤波反投影(FBP)和AD MIRE 1、3、5对扫描后的图像进行重建,比较4组图像客观评价(包括CT值、噪声、信噪比)、主观评价的差异。结果4组图像的客观评价、主观评价总分差异均有统计学意义(P<0.05);相对于FBP,ADMIRE重建后,图像的噪声减低,信噪比升高,ADMIRE 5噪声最小,信噪比最高;ADMIRE 1与FBP组图像主观评价差异无统计学意义,ADMIRE 3图像质量最好,5分占比最高(75%)。结论采用高级建模迭代重建算法后,图像噪声减低,信噪比提高,但并非迭代比例越高,图像质量越好。展开更多
The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but ba...The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but bad for unsmoothed image. Based on the diversity of fractional Fourier transform on its orders, this paper suggests a novel iterative algorithm, which extracts the information of the original image from amplitudes of its fractional Fourier transform at two orders. This new algorithm consists of two independent Gerchberg-Saxton procedures and an averaging operation in each circle. Numerical simulations are carried out to show its validity for both smoothed and unsmoothed images with most pairs of orders in the interval [0, 1].展开更多
When neutron yield is very low, reconstruction of coding penumbra image is rather difficult. In this paper, low-yield （109） 14 MeV neutron penumbra imaging was simulated by Monte Carlo method. The Richardson Lucy （...When neutron yield is very low, reconstruction of coding penumbra image is rather difficult. In this paper, low-yield （109） 14 MeV neutron penumbra imaging was simulated by Monte Carlo method. The Richardson Lucy （R-L） iteration method was proposed to incorporated with Bayesian least square-Gaussian scale mixture model （BLS-GSM） wavelet denoising for the simulated image. Optimal number of R-L iterations was gotten by a large number of tests. The results show that compared with Wiener method and median filter denoising, this method is better in restraining background noise, the correlation coefficient Rsr between the reconstructed and the real images is larger, and the reconstruction result is better.展开更多
The order of the projection in the algebraic reconstruction technique(ART)method has great influence on the rate of the convergence.Although many scholars have studied the order of the projection,few theoretical proof...The order of the projection in the algebraic reconstruction technique(ART)method has great influence on the rate of the convergence.Although many scholars have studied the order of the projection,few theoretical proofs are given.Thomas Strohmer and Roman Vershynin introduced a randomized version of the Kaczmarz method for consistent,and over-determined linear systems and proved whose rate does not depend on the number of equations in the systems in 2009.In this paper,we apply this method to computed tomography(CT)image reconstruction and compared images generated by the sequential Kaczmarz method and the randomized Kaczmarz method.Experiments demonstrates the feasibility of the randomized Kaczmarz algorithm in CT image reconstruction and its exponential curve convergence.展开更多
An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together fo...An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together form an overall effect that "draws" CA,n towards best fitting to the group of points. The basic element of the force is called circular attracting factor(CAF) which is defined as a real scalar in a radial direction of CA,n. An iterative algorithm based on this idea is proposed, and the convergence and accuracy are analyzed. The algorithm converges uniformly which is proved by the analysis of Lyapunov function, and the accuracy of the algorithm is in accord with that of geometric least squares of circle fitting. The algorithm is adopted to circle detection in grayscale images, in which the transferring to binary images is not required, and thus the algorithm is less sensitive to lightening and background noise. The main point for the adaption is the calculation of CAF which is extended in radial directions of CA,n for the whole image. All pixels would apply forces to CA,n, and the overall effect of forces would be equivalent to a force from the centroid of pixels to CA,n. The forces from would-be edge pixels would overweigh that from noisy pixels, so the following approximate circle would be of better fitting. To reduce the amount of calculation, pixels are only used in an annular area including the boundary of CA,n just in between for the calculation of CAF. Examples are given, showing the process of circle fitting of scattered points around a circle from an initial assuming circle, comparing the fitting results for scattered points from some related literature, applying the method proposed for circular edge detection in grayscale images with noise, and/or with only partial arc of a circle, and for circle detection in BGA inspection.展开更多
If a spatial-domain function has a finite support,its Fourier transform is an entire function.The Taylor series expansion of an entire function converges at every finite point in the complex plane.The analytic continu...If a spatial-domain function has a finite support,its Fourier transform is an entire function.The Taylor series expansion of an entire function converges at every finite point in the complex plane.The analytic continuation theory suggests that a finite-sized object can be uniquely determined by its frequency components in a very small neighborhood.Trying to obtain such an exact Taylor expansion is difficult.This paper proposes an iterative algorithm to extend the measured frequency components to unmeasured regions.Computer simulations show that the proposed algorithm converges very slowly,indicating that the problem is too ill-posed to be practically solvable using available methods.展开更多
We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization(ML-EM)algorithm.In this study,we extend these algorithms to Bayesian algorithms...We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization(ML-EM)algorithm.In this study,we extend these algorithms to Bayesian algorithms.The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme.The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor,which contains the Bayesian information.One of the extended algorithms can be applied to emission tomography and another to transmission tomography.Computer simulations are performed and compared with the corresponding un-extended algorithms.The total-variation norm is employed as the Bayesian constraint in the computer simulations.The newly developed algorithms demonstrate a stable performance.A simple Bayesian algorithm can be derived for any noise variance function.The proposed algorithms have properties such as multiplicative updating,non-negativity,faster convergence rates for bright objects,and ease of implementation.Our algorithms are inspired by Green’s one-steplate algorithm.If written in additive-update form,Green’s algorithm has a step size determined by the future image value,which is an undesirable feature that our algorithms do not have.展开更多
基金This research is partially supported by NIH,No.R15EB024283.
文摘Metal objects in X-ray computed tomography can cause severe artifacts.The state-of-the-art metal artifact reduction methods are in the sinogram inpainting category and are iterative methods.This paper proposes a projectiondomain algorithm to reduce the metal artifacts.In this algorithm,the unknowns are the metal-affected projections,while the objective function is set up in the image domain.The data fidelity term is not utilized in the objective function.The objective function of the proposed algorithm consists of two terms:the total variation of the metalremoved image and the energy of the negative-valued pixels in the image.After the metal-affected projections are modified,the final image is reconstructed via the filtered backprojection algorithm.The feasibility of the proposed algorithm has been verified by real experimental data.
文摘It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.
文摘An iterative algorithm to calculate mutual correlation using hierarchical key points and the search space mark principle is proposed. An effective algorithm is designed to improve the matching speed. By hi-erarchical key point algorithm and mutual correlation coefficients of the matching images, the important points can be iteratively calculated in the images hierarchically, and the correlation coefficient can be ob-tained with satisfactory precision. Massive spots in the parameter space which are impossible to match can be removed by the search space mark principle. Two approximate continuities in the correlation image matching process, the image gray level distribution continuity and the correlation coefficient value in the parameter space continuity, are considered in the method. The experiments show that the new algorithm can greatly enhance matching speed and achieve accurate matching results.
文摘目的比较不同水平的高级建模迭代重建算法(ADMIRE)对颞骨CT图像质量的影响。方法收集2023年1月至2月在空军军医大学唐都医院行颞骨CT扫描的患者24例,其中男性13例,女性11例;年龄21~61岁,平均年龄43.3岁。采用德国西门子SOMATOM FORCE CT扫描仪对24例患者行颞骨CT扫描,分别采用传统滤波反投影(FBP)和AD MIRE 1、3、5对扫描后的图像进行重建,比较4组图像客观评价(包括CT值、噪声、信噪比)、主观评价的差异。结果4组图像的客观评价、主观评价总分差异均有统计学意义(P<0.05);相对于FBP,ADMIRE重建后,图像的噪声减低,信噪比升高,ADMIRE 5噪声最小,信噪比最高;ADMIRE 1与FBP组图像主观评价差异无统计学意义,ADMIRE 3图像质量最好,5分占比最高(75%)。结论采用高级建模迭代重建算法后,图像噪声减低,信噪比提高,但并非迭代比例越高,图像质量越好。
文摘The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but bad for unsmoothed image. Based on the diversity of fractional Fourier transform on its orders, this paper suggests a novel iterative algorithm, which extracts the information of the original image from amplitudes of its fractional Fourier transform at two orders. This new algorithm consists of two independent Gerchberg-Saxton procedures and an averaging operation in each circle. Numerical simulations are carried out to show its validity for both smoothed and unsmoothed images with most pairs of orders in the interval [0, 1].
基金supported by National Natural Science Foundation of China(No.11105106)
文摘When neutron yield is very low, reconstruction of coding penumbra image is rather difficult. In this paper, low-yield （109） 14 MeV neutron penumbra imaging was simulated by Monte Carlo method. The Richardson Lucy （R-L） iteration method was proposed to incorporated with Bayesian least square-Gaussian scale mixture model （BLS-GSM） wavelet denoising for the simulated image. Optimal number of R-L iterations was gotten by a large number of tests. The results show that compared with Wiener method and median filter denoising, this method is better in restraining background noise, the correlation coefficient Rsr between the reconstructed and the real images is larger, and the reconstruction result is better.
基金National Natural Science Foundation of China(No.61171179,No.61171178)Natural Science Foundation of Shanxi Province(No.2010011002-1,No.2010011002-2and No.2012021011-2)
文摘The order of the projection in the algebraic reconstruction technique(ART)method has great influence on the rate of the convergence.Although many scholars have studied the order of the projection,few theoretical proofs are given.Thomas Strohmer and Roman Vershynin introduced a randomized version of the Kaczmarz method for consistent,and over-determined linear systems and proved whose rate does not depend on the number of equations in the systems in 2009.In this paper,we apply this method to computed tomography(CT)image reconstruction and compared images generated by the sequential Kaczmarz method and the randomized Kaczmarz method.Experiments demonstrates the feasibility of the randomized Kaczmarz algorithm in CT image reconstruction and its exponential curve convergence.
基金Project(2013CB035504) supported by the National Basic Research Program of ChinaProject(2012zzts078) supported by the Fundamental Research Funds for the Central Universities of Central South University,ChinaProject(2009ZX02038) supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China
文摘An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together form an overall effect that "draws" CA,n towards best fitting to the group of points. The basic element of the force is called circular attracting factor(CAF) which is defined as a real scalar in a radial direction of CA,n. An iterative algorithm based on this idea is proposed, and the convergence and accuracy are analyzed. The algorithm converges uniformly which is proved by the analysis of Lyapunov function, and the accuracy of the algorithm is in accord with that of geometric least squares of circle fitting. The algorithm is adopted to circle detection in grayscale images, in which the transferring to binary images is not required, and thus the algorithm is less sensitive to lightening and background noise. The main point for the adaption is the calculation of CAF which is extended in radial directions of CA,n for the whole image. All pixels would apply forces to CA,n, and the overall effect of forces would be equivalent to a force from the centroid of pixels to CA,n. The forces from would-be edge pixels would overweigh that from noisy pixels, so the following approximate circle would be of better fitting. To reduce the amount of calculation, pixels are only used in an annular area including the boundary of CA,n just in between for the calculation of CAF. Examples are given, showing the process of circle fitting of scattered points around a circle from an initial assuming circle, comparing the fitting results for scattered points from some related literature, applying the method proposed for circular edge detection in grayscale images with noise, and/or with only partial arc of a circle, and for circle detection in BGA inspection.
基金This research is partially supported by NIH,No.R15EB024283.
文摘If a spatial-domain function has a finite support,its Fourier transform is an entire function.The Taylor series expansion of an entire function converges at every finite point in the complex plane.The analytic continuation theory suggests that a finite-sized object can be uniquely determined by its frequency components in a very small neighborhood.Trying to obtain such an exact Taylor expansion is difficult.This paper proposes an iterative algorithm to extend the measured frequency components to unmeasured regions.Computer simulations show that the proposed algorithm converges very slowly,indicating that the problem is too ill-posed to be practically solvable using available methods.
基金This research is partially supported by NIH(No.R15EB024283).
文摘We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization(ML-EM)algorithm.In this study,we extend these algorithms to Bayesian algorithms.The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme.The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor,which contains the Bayesian information.One of the extended algorithms can be applied to emission tomography and another to transmission tomography.Computer simulations are performed and compared with the corresponding un-extended algorithms.The total-variation norm is employed as the Bayesian constraint in the computer simulations.The newly developed algorithms demonstrate a stable performance.A simple Bayesian algorithm can be derived for any noise variance function.The proposed algorithms have properties such as multiplicative updating,non-negativity,faster convergence rates for bright objects,and ease of implementation.Our algorithms are inspired by Green’s one-steplate algorithm.If written in additive-update form,Green’s algorithm has a step size determined by the future image value,which is an undesirable feature that our algorithms do not have.
