Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections

International Transactions in Operational Research

Volumn 16, Issue 4, 2009, Pages 505-524

  Davidi, R ^a   Herman, G T ^a   Censor, Y ^b  

^a City College of New York   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Block iterative algorithms; Convex feasibility; Image reconstruction; Perturbation resilience; Product space; Projection methods; Superiorization

Indexed keywords

EID: 77954049138     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2009.00695.x     Document Type: Article

References (39)

1. Aharoni, R., Censor, Y., 1989. Block-iterative projection methods for parallel computation of solutions to convex feasibility problems. Linear Algebra and Its Applications 120, 165–175.
2. Aleyner, A., Reich, S., 2008. Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces. Journal of Mathematical Analysis and Applications 343, 427–435.
3. Andrews, H.C., Hunt, B.R., 1977. Digital Image Restoration. Prentice-Hall, Englewood Cliffs, NJ.
4. Bauschke, H.H., 1996. The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space. Journal of Mathematical Analysis and Applications 202, 150–159.
5. Bauschke, H.H., Borwein, J.M., 1996. On projection algorithms for solving convex feasibility problems. SIAM Review 38, 367–426.
6. Bauschke, H.H., Combettes, P.L., 2001. A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces. Mathematics of Operations Research 26, 248–264.
7. Bauschke, H.H., Matoušková, E., Reich, S., 2004. Projection and proximal point methods: convergence results and counterexamples. Nonlinear Analysis: Theory, Methods and Applications 56, 715–738.
8. Bilbao-Castro, J.R., Carazo, J.M., García, I., Fernández, J.J., 2003. Parallel iterative reconstruction methods for structure determination of biological specimens by electron microscopy. Proceedings of the International Conference on Image Processing (ICIP) 1, 1565–1568.
9. Butnariu, D., Davidi, R., Herman, G.T., Kazantsev, I.G., 2007. Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems. IEEE Journal of Selected Topics in Signal Processing 1, 540–547.
10. Carazo, J.M., Herman, G.T., Sorzano, C.O.S., Marabini, R., 2006. Algorithms for three-dimensional reconstruction from imperfect projection data provided by electron microscopy. In: Frank, J. (eds) Electron Tomography: Methods for Three-Dimensional Visualization of Structures in the Cell, (2nd edition), Springer Science+Business Media, LLC, New York, pp. 217–243.
11. Carvalho, B., Chen, W., Dubowy, J., Herman, G.T., Kalinowski, M., Liao, H.Y., Rodek, L., Ruskó, L., Rowland, S.W., Vardi-Gonen, E. SNARK05: A Programming System for the Reconstruction of 2D Images from 1D Projections. http://www.snark05.com/SNARK05.pdf.
12. Censor, Y., Tom, E., 2003. Convergence of string-averaging projection schemes for inconsistent convex feasibility problems. Optimization Methods and Software 18, 543–554.
13. Censor, Y., Zenios, S., 1997. Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press, New York.
14. Censor, Y., Altschuler, M.D., Powlis, W.D., 1988. On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning. Inverse Problems 4, 607–623.
15. Censor, Y., Elfving, T., Herman, G.T., 2001a. Averaging strings of sequential iterations for convex feasibility problems. In: Butnariu, D., Censor, Y., Reich, S. (eds) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications. Elsevier Science Publishers, Amsterdam, pp. 101–113.
16. Censor, Y., Gordon, D., Gordon, R., 2001b. BICAV: a block-iterative, parallel algorithm for sparse systems with pixel-related weighting. IEEE Transactions on Medical Imaging 20, 1050–1060.
17. Censor, Y., Elfving, T., Herman, G.T., Nikazad, T., 2007. On diagonally relaxed orthogonal projection methods. SIAM Journal on Scientific Computing 30, 473–504.
18. Combettes, P.L., 1993. The foundations of set-theoretic estimation. Proceedings of the IEEE 81, 182–208.
19. Combettes, P.L., 1996. The convex feasibility problem in image recovery. Advances in Imaging and Electron Physics 95, 155–270.
20. Combettes, P.L., Pesquet, J.C., 2004. Image restoration subject to a total variation constraint. IEEE Transactions on Image Processing 13, 1213–1222.
21. Crombez, G., 2002. Finding common fixed points of strict paracontractions by averaging strings of sequential iterations. Journal of Nonlinear and Convex Analysis 3, 345–351.
22. Crombez, G., 2004. Finding common fixed points of a class of paracontractions. Acta Mathematica Hungarica 103, 233–241.
23. Deutsch, F., 2001. Best Approximation in Inner Product Spaces. Springer-Verlag, New York.
24. Eggermont, P.P.B., Herman, G.T., Lent, A., 1981. Iterative algorithms for large partitioned linear systems, with applications to image reconstruction. Linear Algebra and Its Applications 40, 37–67.
25. Elfving, T., 1980. Block-iterative methods for consistent and inconsistent linear equations. Numerische Mathematik 35, 1–12.
26. Gordon, R., Bender, R., Herman, G.T., 1970. Algebraic Reconstruction Techniques (ART) for three-dimensional electron microscopy and x-ray photography. Journal of Theoretical Biology 29, 471–481.
27. Gould, N.I.M., 2008. How good are projection methods for convex feasibility problems? Computational Optimization and Applications 40, 1–12.
28. Herman, G.T., 1980. Image Reconstruction from Projections: The Fundamentals of Computerized Tomography. Academic Press, New York.
29. Herman, G.T., Chen, W., 2008. A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy. Linear Algebra and Its Applications 428, 1207–1217.
30. Herman, G.T., Davidi, R., 2008. On image reconstruction from a small number of projections. Inverse Problems 24, 045011.
31. Konovalov, A.B., Vlasov, V.V., Mogilenskikh, D.V., Kravtsenyuk, O.V., Liubimov, V.V., 2008. Algebraic reconstruction and postprocessing in one-step diffuse optical tomography. Quantum Electronics 38, 588–596.
32. Lent, A., 1977. A convergent algorithm for maximum entropy image restoration, with a medical x-ray application. In Shaw, R. (ed.) Image Analysis and Evaluation, pp. 249–257. Society of Photographic Scientists and Engineers (SPSE), Washington, DC.
33. Levine, R.D., Tribus, M. (eds) 1979. The Maximum Entropy Formalism. MIT Press, Cambridge, MA.
34. Malgouyres, F., 2002. Minimizing the total variation under general convex constraints for image restoration. IEEE Transactions on Image Processing 11, 1450–1456.
35. Marks, L.D., Sinkler, W., Landree, E., 1999. A feasible set approach to the crystallographic phase problem. Acta Crystallographica A55, 601–612.
36. Persson, M., Bone, D., Elmqvist, H., 2001. Total variation norm for three-dimensional iterative reconstruction in limited view angle tomography. Physics in Medicine and Biology 46, 853–866.
37. Pierra, G., 1984. Decomposition through formalization in a product space. Mathematical Programming 28, 96–115.
38. Rudin, L.I., Osher, S., Fatemi, E., 1992. Nonlinear total variation based noise removal algorithms. Physica D 60, 259–268.
39. Worth, N.A., Nickels, T.B., 2008. Acceleration of Tomo-PIV by estimating the initial volume distribution. Experiments in Fluids 45, 847–856.