首页> 外文会议> >Reconstructions of truncated projections using an optimal basis expansion derived from the cross-correlation of a 'Knowledge Set' of a priori cross-sections
【24h】

Reconstructions of truncated projections using an optimal basis expansion derived from the cross-correlation of a 'Knowledge Set' of a priori cross-sections

机译:使用从先验横截面的“知识集”的互相关性得出的最佳基础展开来重建截断的投影

获取原文

摘要

An algorithm was developed to obtain reconstructions from truncated projections by utilizing cross-correlation of a "knowledge set" of a priori nontruncated cross-sections with a similar structure. A cross-correlation matrix was constructed for the known set of cross-sectional images. The eigenvectors of this matrix form a set of orthogonal basis vectors for the reconstructed image. The basis set is optimal in the sense that the average of the differences between members of a given set of a priori images, and their truncated linear expansion for any basis set, is minimal for this particular basis set. A procedure for finding optimal basis vectors is fundamental for deriving the Karhunen-Loeve (K-L) transform. Therefore, one can represent an image not in the "knowledge set" but of similar structure by a linear combination of basis vectors corresponding to the larger eigenvalues; thus, the number of basis vectors is reduced to a number less than the total number of pixels. The projection of an image represented by this linear combination of basis vectors is a linear combination of projected basis vectors which are not necessarily orthogonal. A constrained least-squares method was used to evaluate the coefficients of this expansion by minimizing the sum of squares difference between the expansion and the projection measurements taking into account the distribution of coefficients over basis vectors. The constrained least-squares estimates of the coefficients were used in an expansion of the orthogonal basis to obtain the reconstructed image. The constrained solution has a reduced noise level in this inverse problem. It is shown that the reconstruction of truncated projections can be significantly improved over that of commonly used iterative reconstruction algorithms.
机译:通过利用具有相似结构的先验非截断横截面的“知识集”的互相关性,开发了一种从截断投影中获得重建的算法。为已知的一组横截面图像构建了一个互相关矩阵。该矩阵的特征向量形成用于重建图像的一组正交基向量。在一定意义上,该基础集是最佳的,因为对于该特定基础集,给定先验图像集的成员之间的差异平均值以及它们对任何基础集的截短线性扩展都是最小的。查找最佳基础向量的过程是推导Karhunen-Loeve(K-L)变换的基础。因此,可以通过对应于较大特征值的基本向量的线性组合来表示不在“知识集”中但具有相似结构的图像。因此,基矢量的数量减少到小于像素总数的数量。由基本矢量的这种线性组合表示的图像的投影是不一定正交的投影基本矢量的线性组合。考虑到系数在基矢量上的分布,使用最小二乘约束方法通过最小化展开和投影测量之间的平方差来评估此展开的系数。系数的约束最小二乘估计用于正交基础的扩展,以获得重建图像。在这个反问题中,受约束的解决方案具有降低的噪声水平。结果表明,与常用的迭代重建算法相比,截断投影的重建可以得到显着改善。

著录项

相似文献

  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号