论文标题
使用基于词典的稀疏形状恢复的二进制有限数据断层扫描的重建方法
A reconstruction method for binary limited-data tomography using a dictionary-based sparse shape recovery
论文作者
论文摘要
二进制断层扫描与从数量很小或其他有限的CT投影数据中重建二进制图像有关。这个问题本身不仅具有多种医学成像应用,而且可以被视为一般反向问题的模型,可以从有限的测量数据中恢复对象形状。已经研究了几种方法,例如Mumford-Shah方法和各种级别的方法,但是由于难以处理二进制约束,因此大多数方法导致了非凸优化。我们提出了一种基于灵感来自基于字典的形状恢复的凸优化的新方法。在提出的方法中,二进制图像的对象边界由字典中基矢量的一组线性组合表示。使用词典,通过查找最适合测量数据的线性组合的权重来重建对象边界。我们通过使用高斯径向基函数(GRBF)创建字典。更具体地说,我们将高斯函数用作放置在稀疏网格点的基础函数来表示参数级别函数,并在重建图像的二进制表示中提供更灵活的功能。仅来自四个投影数据的CT图像重建的仿真结果表明,所提出的方法可以更准确地恢复对象边界与其他竞争方法相比。我们方法的意义是通过可拖动的凸面程序进行配方,同时保持中等数学的严格性。
Binary tomography is concerned with reconstructing a binary image from a very small number or other limited CT projection data. This problem itself not only possesses several medical imaging applications but also can be considered a model of general inverse problems to recover the object shape from limited measured data. Several approaches such as the Mumford-Shah method and various level-set methods have been investigated, but most of them lead to a non-convex optimization due to the difficulty to handle the binary constraint. We propose a new method based on a convex optimization inspired by dictionary-based shape recovery. In the proposed method, the object boundary of the binary image is represented by a level set of linear combinations of basis vectors in the dictionary. Using the dictionary, the object boundary is reconstructed by finding weights of the linear combination that best match the measured data. We create the dictionary by using the Gaussian radial basis function (GRBF). More concretely, we use Gaussian functions as a basis function placed at sparse grid points to represent the parametric level-set function and provide more flexibility in the binary representation of the reconstructed image. The simulation results of CT image reconstruction from only four projection data demonstrate that the proposed method can recover the object boundary more accurately compared with other competitive methods. The significance of our approach is the formulation with a tractable convex program while keeping moderate mathematical rigorousness.