A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography
Discrete tomography concerns the reconstruction of functions with a finite number of values from few projections. For a number of important real-world problems, this tomography problem involves thousands of variables. Applicability and performance of discrete tomography therefore largely depend on the criteria used for reconstruction and the optimization algorithm applied. From this viewpoint, we evaluate two major optimization strategies, simulated annealing and convex-concave regularization, for the case of binary-valued functions using various data sets. Extensive numerical experiments show that despite being quite different from the viewpoint of optimization, both strategies show similar reconstruction performance as well as robustness to noise.
- 2.Herman, G.T., Kuba, A. (eds.): Advances in Discrete Tomography and Its Applications. Birkhäuser, Basel (to appear, 2006)Google Scholar
- 5.Liao, H.Y., Herman, G.T.: A method for reconstructing label images from a few projections, as motivated by electron microscopy. Annals of Operations Research (to appear)Google Scholar
- 6.Weber, S., Schüle, T., Schnörr, C., Hornegger, J.: A linear programming approach to limited angle 3d reconstruction from dsa projections. Special Issue of Methods of Information in Medicine 4, 320–326 (2004)Google Scholar
- 8.Schnörr, C., Schüle, T., Weber, S.: Variational Reconstruction with DC-Programming. In: Herman, G.T., Kuba, A. (eds.) Advances in Discrete Tomography and Its Applications. Birkhäuser, Boston (to appear, 2006)Google Scholar