二值层析成像的一个凸公式
A Convex Formulation for Binary Tomography
摘要:
二值层析成像涉及从它们的几个投影中恢复二值图像(即,沿着各个方向的像素值的总和)。为了从噪声投影数据重建图像,可以将其视为约束最小二乘问题。由于约束是非凸的,许多解决它的方法要么依赖于放松约束,要么依赖于算法。在本文中,我们提出了一种新的凸公式,基于拉格朗日对偶的约束最小二乘问题。由此产生的问题是一个广义的LASSO问题,可以有效地解决。这是一种放松,因为它只能保证给出一个可行的解决方案,而不一定是最优的。然而,在对小图像(2x2,3x3,4x4)的穷举实验中,我们发现,如果问题有唯一的解决方案,我们的对偶方法会找到它。在多个解决方案的情况下,我们的方法会找到解决方案之间的共性。在真实数值模型和X射线数据集上的实验表明,该方法优于全变分和DART。
英文摘要:
Binary tomography is concerned with the recovery of binary images from a few of their projections (i.e., sums of the pixel values along various directions). To reconstruct an image from noisy projection data, one can pose it as a constrained least-squares problem. As the constraints are non-convex, many approaches for solving it rely on either relaxing the constraints or heuristics. In this paper we propose a novel convex formulation, based on the Lagrange dual of the constrained least-squares problem. The resulting problem is a generalized LASSO problem which can be solved efficiently. It is a relaxation in the sense that it can only be guaranteed to give a feasible solution; not necessarily the optimal one. In exhaustive experiments on small images (2x2, 3x3, 4x4) we find, however, that if the problem has a unique solution, our dual approach finds it. In case of multiple solutions, our approach finds the commonalities between the solutions. Further experiments on realistic numerical phantoms and an experiment on X-ray dataset show that our method compares favourably to Total Variation and DART.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。