摘要
Discrete Tomography(DT)is a technology that uses image projection to reconstruct images.Its reconstruction problem,especially the binary image(0–1matrix)has attracted strong attention.In this study,a fixed point iterative method of integer programming based on intelligent optimization is proposed to optimize the reconstructedmodel.The solution process can be divided into two procedures.First,the DT problem is reformulated into a polyhedron judgment problembased on lattice basis reduction.Second,the fixed-point iterativemethod of Dang and Ye is used to judge whether an integer point exists in the polyhedron of the previous program.All the programs involved in this study are written in MATLAB.The final experimental data show that this method is obviously better than the branch and bound method in terms of computational efficiency,especially in the case of high dimension.The branch and bound method requires more branch operations and takes a long time.It also needs to store a large number of leaf node boundaries and the corresponding consumptionmatrix,which occupies a largememory space.
基金
funded by the NSFC under Grant Nos.61803279,71471091,62003231 and 51874205
in part by the Qing Lan Project of Jiangsu,in part by the China Postdoctoral Science Foundation under Grant Nos.2020M671596 and 2021M692369
in part by the Suzhou Science and Technology Development Plan Project(Key Industry Technology Innovation)under Grant No.SYG202114
in part by the Natural Science Foundation of Jiangsu Province under Grant No.BK20200989
Postdoctoral Research Funding Program of Jiangsu Province.
