Open Access

ARTICLE

A Fixed-Point Iterative Method for Discrete Tomography Reconstruction Based on Intelligent Optimization

Luyao Yang^1,#, Hao Chen^2,#, Haocheng Yu¹, Jin Qiu^1,*, Shuxian Zhu^1,*

1 School of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou, 215009, China
2 College of Mechanical Engineering, Suzhou University of Science and Technology, Suzhou, 215009, China

* Corresponding Authors: Jin Qiu. Email: ; Shuxian Zhu. Email:
# Contributed equally as co-first authors

(This article belongs to the Special Issue: Advanced Intelligent Decision and Intelligent Control with Applications in Smart City)

Computer Modeling in Engineering & Sciences 2023, 134(1), 731-745. https://doi.org/10.32604/cmes.2022.020656

Received 05 December 2021; Accepted 06 February 2022; Issue published 24 August 2022

Abstract

Discrete Tomography (DT) is a technology that uses image projection to reconstruct images. Its reconstruction problem, especially the binary image (0–1 matrix) has attracted strong attention. In this study, a fixed point iterative method of integer programming based on intelligent optimization is proposed to optimize the reconstructed model. The solution process can be divided into two procedures. First, the DT problem is reformulated into a polyhedron judgment problem based on lattice basis reduction. Second, the fixed-point iterative method 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 consumption matrix, which occupies a large memory space.

---

Keywords

---