메뉴 건너뛰기




Volumn 16, Issue 4, 2009, Pages 427-463

Block-iterative algorithms

Author keywords

Image; Optimization; Reconstruction

Indexed keywords


EID: 70350673979     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2008.00683.x     Document Type: Article
Times cited : (28)

References (50)
  • 1
    • 0000026159 scopus 로고
    • The relaxation method for linear inequalities
    • Agmon, S., 1954. The relaxation method for linear inequalities. Canadian Journal of Mathematics 6, 382–392.
    • (1954) Canadian Journal of Mathematics , vol.6 , pp. 382-392
    • Agmon, S.1
  • 2
    • 0039279366 scopus 로고
    • Quelques propriétés des operateurs angle-bornes et n-cycliquement monotones
    • Baillon, J.-B., Haddad, G., 1977. Quelques propriétés des operateurs angle-bornes et n-cycliquement monotones. Israel Journal of Mathematics 26, 137–150.
    • (1977) Israel Journal of Mathematics , vol.26 , pp. 137-150
    • Baillon, J.-B.1    Haddad, G.2
  • 3
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • Bauschke, H., Borwein, J., 1996. On projection algorithms for solving convex feasibility problems. SIAM Review 38, 3, 367–426.
    • (1996) SIAM Review , vol.38 , Issue.3 , pp. 367-426
    • Bauschke, H.1    Borwein, J.2
  • 5
    • 0031285678 scopus 로고    scopus 로고
    • A new class of incremental gradient methods for least squares problems
    • Bertsekas, D.P., 1997. A new class of incremental gradient methods for least squares problems. SIAM Journal on Optimization 7, 913–926.
    • (1997) SIAM Journal on Optimization , vol.7 , pp. 913-926
    • Bertsekas, D.P.1
  • 6
    • 49949144765 scopus 로고
    • The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
    • Bregman, L.M., 1967. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7, 200–217.
    • (1967) USSR Computational Mathematics and Mathematical Physics , vol.7 , pp. 200-217
    • Bregman, L.M.1
  • 7
    • 0030270511 scopus 로고    scopus 로고
    • A row-action alternative to the EM algorithm for maximizing likelihoods in emission tomography
    • Browne, J., De Pierro, A., 1996. A row-action alternative to the EM algorithm for maximizing likelihoods in emission tomography. IEEE Transactions on Medical Imaging 15, 687–699.
    • (1996) IEEE Transactions on Medical Imaging , vol.15 , pp. 687-699
    • Browne, J.1    De Pierro, A.2
  • 8
    • 0027190119 scopus 로고
    • Iterative image reconstruction algorithms based on cross-entropy minimization
    • Byrne, C., 1993. Iterative image reconstruction algorithms based on cross-entropy minimization. IEEE Transactions on Image Processing IP-2, 96–103.
    • (1993) IEEE Transactions on Image Processing , vol.IP-2 , pp. 96-103
    • Byrne, C.1
  • 9
    • 0030150471 scopus 로고    scopus 로고
    • Block-iterative methods for image reconstruction from projections
    • Byrne, C., 1996. Block-iterative methods for image reconstruction from projections. IEEE Transactions on Image Processing IP-5, 792–794.
    • (1996) IEEE Transactions on Image Processing , vol.IP-5 , pp. 792-794
    • Byrne, C.1
  • 10
    • 0031233862 scopus 로고    scopus 로고
    • Convergent block-iterative algorithms for image reconstruction from inconsistent data
    • Byrne, C., 1997. Convergent block-iterative algorithms for image reconstruction from inconsistent data. IEEE Transactions on Image Processing IP-6, 1296–1304.
    • (1997) IEEE Transactions on Image Processing , vol.IP-6 , pp. 1296-1304
    • Byrne, C.1
  • 11
    • 0001183858 scopus 로고    scopus 로고
    • Iterative algorithms for deblurring and deconvolution with constraints
    • Byrne, C., 1998. Iterative algorithms for deblurring and deconvolution with constraints. Inverse Problems 14, 1455–1467.
    • (1998) Inverse Problems , vol.14 , pp. 1455-1467
    • Byrne, C.1
  • 12
    • 77956682929 scopus 로고    scopus 로고
    • Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
    • Butnariu, D., Censor, Y., Reich, S., (eds), Elsevier Publishers, Amsterdam
    • Byrne, C., 2001. Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization. In Butnariu, D., Censor, Y., Reich, S. (eds) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Studies in Computational Mathematics, Vol. 8. Elsevier Publishers, Amsterdam, 87–100.
    • (2001) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Studies in Computational Mathematics , vol.8 , pp. 87-100
    • Byrne, C.1
  • 13
    • 0036538286 scopus 로고    scopus 로고
    • Iterative oblique projection onto convex sets and the split feasibility problem
    • Byrne, C., 2002. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Problems 18, 441–453.
    • (2002) Inverse Problems , vol.18 , pp. 441-453
    • Byrne, C.1
  • 14
    • 1342265919 scopus 로고    scopus 로고
    • A unified treatment of some iterative algorithms in signal processing and image reconstruction
    • Byrne, C., 2004. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Problems 20, 103–120.
    • (2004) Inverse Problems , vol.20 , pp. 103-120
    • Byrne, C.1
  • 15
    • 14844366632 scopus 로고    scopus 로고
    • Choosing parameters in block-iterative or ordered-subset reconstruction algorithms
    • Byrne, C., 2005a. Choosing parameters in block-iterative or ordered-subset reconstruction algorithms. IEEE Transactions on Image Processing 14, 3, 321–327.
    • (2005) IEEE Transactions on Image Processing , vol.14 , Issue.3 , pp. 321-327
    • Byrne, C.1
  • 18
    • 41849092186 scopus 로고    scopus 로고
    • Sequential unconstrained minimization algorithms for constrained optimization
    • Byrne, C., 2008. Sequential unconstrained minimization algorithms for constrained optimization. Inverse Problems 24, 1–27
    • (2008) Inverse Problems , vol.24 , pp. 1-27
    • Byrne, C.1
  • 19
    • 0035565698 scopus 로고    scopus 로고
    • Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback–Leibler distance minimization
    • Byrne, C., Censor, Y., 2001. Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback–Leibler distance minimization. Annals of Operations Research 105, 77–98.
    • (2001) Annals of Operations Research , vol.105 , pp. 77-98
    • Byrne, C.1    Censor, Y.2
  • 23
    • 0001054069 scopus 로고
    • Calcolo approssimato per soluzioni dei sistemi di equazioni lineari
    • Cimmino, G., 1938. Calcolo approssimato per soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica XVI, Series II, Anno IX 1, 326–333.
    • (1938) La Ricerca Scientifica XVI, Series II, Anno IX , vol.1 , pp. 326-333
    • Cimmino, G.1
  • 25
    • 30844438177 scopus 로고    scopus 로고
    • Signal recovery by proximal forward-backward splitting
    • Combettes, P., Wajs, V., 2005. Signal recovery by proximal forward-backward splitting. Multiscale Modeling and Simulation 4, 4, 1168–1200.
    • (2005) Multiscale Modeling and Simulation , vol.4 , Issue.4 , pp. 1168-1200
    • Combettes, P.1    Wajs, V.2
  • 26
    • 0001573124 scopus 로고
    • Generalized iterative scaling for log-linear models
    • Darroch, J., Ratcliff, D., 1972. Generalized iterative scaling for log-linear models. Annals of Mathematical Statistics 43, 1470–1480.
    • (1972) Annals of Mathematical Statistics , vol.43 , pp. 1470-1480
    • Darroch, J.1    Ratcliff, D.2
  • 27
    • 0025566496 scopus 로고
    • The convergence of linear stationary iterative processes for solving singular unstructured systems of linear equations
    • Dax, A., 1990. The convergence of linear stationary iterative processes for solving singular unstructured systems of linear equations. SIAM Review 32, 611–635.
    • (1990) SIAM Review , vol.32 , pp. 611-635
    • Dax, A.1
  • 28
    • 38249019931 scopus 로고
    • On the asymptotic behavior of some alternate smoothing series expansion iterative methods
    • De Pierro, A., Iusem, A., 1990. On the asymptotic behavior of some alternate smoothing series expansion iterative methods. Linear Algebra and its Applications 130, 3–24.
    • (1990) Linear Algebra and its Applications , vol.130 , pp. 3-24
    • De Pierro, A.1    Iusem, A.2
  • 29
    • 0002416978 scopus 로고
    • Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
    • 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.
    • (1981) Linear Algebra and its Applications , vol.40 , pp. 37-67
    • Eggermont, P.P.B.1    Herman, G.T.2    Lent, A.3
  • 30
    • 0012126939 scopus 로고
    • Nonlinear Programming: Sequential Unconstrained Minimization Techniques. SIAM Classics in Mathematics (reissue)
    • Philadelphia, PA
    • Fiacco, A., McCormick, G., 1990. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. SIAM Classics in Mathematics (reissue). Society of Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
    • (1990) Society of Industrial and Applied Mathematics (SIAM)
    • Fiacco, A.1    McCormick, G.2
  • 32
    • 0014905513 scopus 로고
    • Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography
    • 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.
    • (1970) Journal of Theoretical Biology , vol.29 , pp. 471-481
    • Gordon, R.1    Bender, R.2    Herman, G.T.3
  • 34
    • 0027659444 scopus 로고
    • Algebraic reconstruction techniques can be made computationally efficient
    • Herman, G.T., Meyer, L., 1993. Algebraic reconstruction techniques can be made computationally efficient. IEEE Transactions on Medical Imaging 12, 600–609.
    • (1993) IEEE Transactions on Medical Imaging , vol.12 , pp. 600-609
    • Herman, G.T.1    Meyer, L.2
  • 35
    • 0025416480 scopus 로고
    • Iterative image reconstruction for positron emission tomography: a study of convergence and quantitation problems
    • Holte, S., Schmidlin, P., Linden, A., Rosenqvist, G., Eriksson, L., 1990. Iterative image reconstruction for positron emission tomography: a study of convergence and quantitation problems. IEEE Transactions on Nuclear Science 37, 629–635.
    • (1990) IEEE Transactions on Nuclear Science , vol.37 , pp. 629-635
    • Holte, S.1    Schmidlin, P.2    Linden, A.3    Rosenqvist, G.4    Eriksson, L.5
  • 36
    • 0028700063 scopus 로고
    • Accelerated image reconstruction using ordered subsets of projection data
    • Hudson, H.M., Larkin, R.S., 1994. Accelerated image reconstruction using ordered subsets of projection data. IEEE Transactions on Medical Imaging 13, 601–609.
    • (1994) IEEE Transactions on Medical Imaging , vol.13 , pp. 601-609
    • Hudson, H.M.1    Larkin, R.S.2
  • 39
    • 0023363121 scopus 로고
    • A theoretical study of some maximum likelihood algorithms for emission and transmission tomography
    • Lange, K., Bahn, M., Little, R., 1987. A theoretical study of some maximum likelihood algorithms for emission and transmission tomography. IEEE Transactions on Medical Imaging MI-6, 2, 106–114.
    • (1987) IEEE Transactions on Medical Imaging , vol.MI-6 , Issue.2 , pp. 106-114
    • Lange, K.1    Bahn, M.2    Little, R.3
  • 40
    • 0021327145 scopus 로고
    • EM reconstruction algorithms for emission and transmission tomography
    • Lange, K., Carson, R., 1984. EM reconstruction algorithms for emission and transmission tomography. Journal of Computer Assisted Tomography 8, 306–316.
    • (1984) Journal of Computer Assisted Tomography , vol.8 , pp. 306-316
    • Lange, K.1    Carson, R.2
  • 43
    • 0035297606 scopus 로고    scopus 로고
    • An interior point iterative maximum-likelihood reconstruction algorithm incorporating upper and lower bounds with application to SPECT transmission imaging
    • Narayanan, M., Byrne, C., King, M., 2001. An interior point iterative maximum-likelihood reconstruction algorithm incorporating upper and lower bounds with application to SPECT transmission imaging. IEEE Transactions on Medical Imaging TMI-20, 4, 342–353.
    • (2001) IEEE Transactions on Medical Imaging , vol.TMI-20 , Issue.4 , pp. 342-353
    • Narayanan, M.1    Byrne, C.2    King, M.3
  • 44
    • 0015509019 scopus 로고
    • Iterative separation of sections in tomographic scintigrams
    • Schmidlin, P., 1972. Iterative separation of sections in tomographic scintigrams. Nuclear Medicine 11, 1, 1–6.
    • (1972) Nuclear Medicine , vol.11 , Issue.1 , pp. 1-6
    • Schmidlin, P.1
  • 45
    • 0020194763 scopus 로고
    • Maximum likelihood reconstruction for emission tomography
    • Shepp, L., Vardi, Y., 1982. Maximum likelihood reconstruction for emission tomography. IEEE Transactions on Medical Imaging MI-1, 113–122.
    • (1982) IEEE Transactions on Medical Imaging , vol.MI-1 , pp. 113-122
    • Shepp, L.1    Vardi, Y.2
  • 47
    • 1542269554 scopus 로고
    • Projection method for solving a singular system of linear equations and its applications
    • Tanabe, K., 1971. Projection method for solving a singular system of linear equations and its applications. Numerical Mathematics 17, 203–214.
    • (1971) Numerical Mathematics , vol.17 , pp. 203-214
    • Tanabe, K.1
  • 48
    • 0001286634 scopus 로고
    • Entropic proximal mappings with applications to nonlinear programming
    • Teboulle, M., 1992. Entropic proximal mappings with applications to nonlinear programming. Mathematics of Operations Research 17, 3, 670–690.
    • (1992) Mathematics of Operations Research , vol.17 , Issue.3 , pp. 670-690
    • Teboulle, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.