Iterative Difference Deblurring Algorithm For Linear Computed Laminography

OPTICS EXPRESS(2021)

引用 1|浏览2
暂无评分
摘要
Linear Computed Laminography (LCL) is used to yield slice images of plate-like objects (PLO) for the advantage of short exposure time, high control precision and low cost. Shift and Add (SAA) is a widely used reconstruction algorithm for LCL. One limitation of SAA is that the reconstructed image of the in-focus layer (IFL) contains information from off-focus layers (OFL), resulting in inter-slice aliasing and blurring. In this paper, an Iterative Difference Deblurring (IDD) algorithm based on LCL is proposed to reduce the blur in reconstructed images. The core idea of the IDD algorithm is: contributions from OFL are subtracted from the projection data to remove the blur from the IFL. The corrected projections are then reconstructed using the SAA to remove the superimposed contributions of OFL from the IFL. An iterative approach is utilized to adjust a weighting factor applied during the subtraction stage. The results demonstrate that IDD algorithm can achieve PLO reconstruction in the LCL system under extremely sparse sampling conditions, and can effectively reduce the inter-slice aliasing and blurring. (C) 2021 Optical Society of America under the terms of the OSA Open Access Publishing Agreement
更多
查看译文
关键词
laminography,iterative difference,algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要