Table of Contents
Journal of Medical Engineering
Volume 2014, Article ID 908984, 15 pages
http://dx.doi.org/10.1155/2014/908984
Research Article

Kaczmarz Iterative Projection and Nonuniform Sampling with Complexity Estimates

Department of Computer Science, Tennessee State University, 3500 John A. Merritt Boulevard, Nashville, TN 37209-1500, USA

Received 21 August 2014; Revised 26 October 2014; Accepted 27 October 2014; Published 15 December 2014

Academic Editor: Hengyong Yu

Copyright © 2014 Tim Wallace and Ali Sekmen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Kaczmarz, “Approximate solution of systems of linear equations,” International Journal of Control, vol. 57, no. 6, pp. 1269–1271, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. R. Gordon, R. Bender, and G. T. Herman, “Algebraic reconstruction techniques (art) for three-dimensional electron microscopy and x-ray photography,” Journal of Theoretical Biology, vol. 29, no. 3, pp. 471–481, 1970. View at Publisher · View at Google Scholar · View at Scopus
  3. G. T. Herman, Fundamentals of Computerized Tomography: Image Reconstruction from Projections, Springer, 2nd edition, 2009. View at MathSciNet
  4. T. Strohmer and R. Vershynin, “A randomized Kaczmarz algorithm with exponential convergence,” The Journal of Fourier Analysis and Applications, vol. 15, no. 2, pp. 262–278, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. D. Needell, “Randomized Kaczmarz solver for noisy linear systems,” BIT Numerical Mathematics, vol. 50, no. 2, pp. 395–403, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. Needell and R. Ward, “Two-subspace projection method for coherent overdetermined systems,” The Journal of Fourier Analysis and Applications, vol. 19, no. 2, pp. 256–269, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. D. Needell and J. A. Tropp, “Paved with good intentions: analysis of a randomized block Kaczmarz method,” Linear Algebra and its Applications, vol. 441, pp. 199–221, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. X. Chen and A. M. Powell, “Almost sure convergence of the Kaczmarz algorithm with random measurements,” Journal of Fourier Analysis and Applications, vol. 18, no. 6, pp. 1195–1214, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. A. Galántai, “On the rate of convergence of the alternating projection method in finite dimensional spaces,” Journal of Mathematical Analysis and Applications, vol. 310, no. 1, pp. 30–44, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. A. Galántai, Projectors and Projection Methods, Advances in Mathematics, Kluwer Academic, London, UK, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  11. F. Deutsch and H. Hundal, “The rate of convergence for the method of alternating projections, II,” Journal of Mathematical Analysis and Applications, vol. 205, no. 2, pp. 381–405, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. C. Brezinski and M. Redivo-Zaglia, “Convergence acceleration of Kaczmarz's method,” Journal of Engineering Mathematics, pp. 1–17, 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. K. T. Smith, D. C. Solmon, and S. L. Wagner, “Practical and mathematical aspects of the problem of reconstructing objects from radiographs,” Bulletin of the American Mathematical Society, vol. 83, no. 6, pp. 1227–1270, 1977. View at Publisher · View at Google Scholar · View at MathSciNet
  14. Z.-Z. Bai and X.-G. Liu, “On the Meany inequality with applications to convergence analysis of several row-action iteration methods,” Numerische Mathematik, vol. 124, no. 2, pp. 215–236, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. Y. Censor, G. T. Herman, and M. Jiang, “A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin,” Journal of Fourier Analysis and Applications, vol. 15, no. 4, pp. 431–436, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. T. Wallace and A. Sekmen, “Acceleration of Kaczmarz using subspace orthogonal projections,” in IEEE Biomedical Science and Engineering Conference (BSEC) at Oak Ridge National Laboratory, 2013.
  17. G. H. Golub and C. F. van Loan, Matrix Computations, Johns Hopkins Studies in Mathematical Sciences, The Johns Hopkins University Press, 3rd edition, 1996. View at MathSciNet
  18. C. Meyer, Matrix Analysis and Applied Linear Algebra, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 2000. View at MathSciNet
  19. H. Yanai, K. Takeuchi, and Y. Takane, Projection Matrices, Generalized Inverse Matrices, and Singular Value Decomposition, Statistics for Social and Behavioral Sciences, Springer, Dordrecht, The Netherlands, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  20. T. Strohmer and R. Vershynin, “A randomized Kaczmarz algorithm with exponential convergence,” Journal of Fourier Analysis and Applications, vol. 15, no. 2, pp. 262–278, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. J. Eaton, W. Rik, D. Bateman, and S. Hauberg, GNU Octave Version 3.8.1 Manual: A High-Level Interactive Language for Numerical Computations, CreateSpace Independent Publishing Platform, 2014.
  22. P. C. Hansen and M. Saxild-Hansen, “AIR-tools—a MATLAB package of algebraic iterative reconstruction methods,” Journal of Computational and Applied Mathematics, vol. 236, no. 8, pp. 2167–2178, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. G. P. Vasil'chenko and A. A. Svetlakov, “A projection algorithm for solving systems of linear algebraic equations of high dimensionality,” USSR Computational Mathematics and Mathematical Physics, vol. 20, no. 1, pp. 1–8, 1980. View at Google Scholar
  24. G. Marsaglia and W. W. Tsang, “The ziggurat method for generating random variables,” Journal of Statistical Software, vol. 5, no. 8, pp. 1–7, 2000. View at Google Scholar · View at Scopus
  25. D. L. Donoho, M. Elad, and V. N. Temlyakov, “Stable recovery of sparse overcomplete representations in the presence of noise,” IEEE Transactions on Information Theory, vol. 52, no. 1, pp. 6–18, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. L. R. Welch, “Lower bounds on the maximum cross correlation of signals (corresp.),” IEEE Transactions on Information Theory, vol. 20, no. 3, pp. 397–399, 1974. View at Google Scholar · View at Scopus
  27. M. Birk, R. Dapp, N. V. Ruiter, and J. Becker, “GPU-based iterative transmission reconstruction in 3D ultrasound computer tomography,” Journal of Parallel and Distributed Computing, vol. 74, no. 1, pp. 1730–1743, 2014. View at Publisher · View at Google Scholar · View at Scopus
  28. I. Peterlík, N. Ruiter, and R. Stotzka, “Algebraic reconstruction technique for ultrasound transmission tomography,” in Proceedings of the IEEE International Conference on Information Technology Applications in Biomedicine (ITAB 2006), Ioannina, Greece, October 2006.
  29. V. Ntziachristos, “Fluorescence molecular imaging,” Annual Review of Biomedical Engineering, vol. 8, no. 1, pp. 1–33, 2006. View at Publisher · View at Google Scholar · View at Scopus