메뉴 건너뛰기




Volumn 51, Issue 7, 2003, Pages 1771-1782

A block-iterative surrogate constraint splitting method for quadratic signal recovery

Author keywords

Block iterative optimization; Convex analysis; Deconvolution; Quadratic programming; Signal recovery; Subgradient projection

Indexed keywords

CONSTRAINT THEORY; CONVOLUTION; ITERATIVE METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

EID: 0038538416     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2003.812846     Document Type: Review
Times cited : (140)

References (54)
  • 2
    • 0037976260 scopus 로고
    • Dykstra's alternating projection algorithm for two sets
    • H. H. Bauschke and J. M. Borwein, "Dykstra's alternating projection algorithm for two sets," J. Approx. Theory, vol. 79, pp. 418-443, 1994.
    • (1994) J. Approx. Theory , vol.79 , pp. 418-443
    • Bauschke, H.H.1    Borwein, J.M.2
  • 3
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • Sept.
    • _, "On projection algorithms for solving convex feasibility problems," SIAM Rev., vol. 38, pp. 367-426, Sept. 1996.
    • (1996) SIAM Rev. , vol.38 , pp. 367-426
  • 4
    • 0035351666 scopus 로고    scopus 로고
    • A weak-to-strong convergence principle for Fejér-monotone methods in Hubert spaces
    • May
    • H. H. Bauschke and P. L. Combettes, "A weak-to-strong convergence principle for Fejér-monotone methods in Hubert spaces," Math. Oper. Res., vol. 26, pp. 248-264, May 2001.
    • (2001) Math. Oper. Res. , vol.26 , pp. 248-264
    • Bauschke, H.H.1    Combettes, P.L.2
  • 5
    • 0002436271 scopus 로고
    • A method for finding projections onto the intersection of convex sets in Hubert spaces
    • J. P. Boyle and R. L. Dykstra, "A method for finding projections onto the intersection of convex sets in Hubert spaces," Lecture Notes Statist., vol. 37, pp. 28-47, 1986.
    • (1986) Lecture Notes Statist. , vol.37 , pp. 28-47
    • Boyle, J.P.1    Dykstra, R.L.2
  • 7
    • 0020718577 scopus 로고
    • Finite series-expansion reconstruction methods
    • Mar.
    • Y. Censor, "Finite series-expansion reconstruction methods," Proc. IEEE, vol. 71, pp. 409-419, Mar. 1983.
    • (1983) Proc. IEEE , vol.71 , pp. 409-419
    • Censor, Y.1
  • 9
    • 0027579732 scopus 로고
    • Signal recovery by best feasible approximation
    • Apr.
    • P. L. Combettes, "Signal recovery by best feasible approximation," IEEE Trans. Image Processing, vol. 2, pp. 269-271, Apr. 1993.
    • (1993) IEEE Trans. Image Processing , vol.2 , pp. 269-271
    • Combettes, P.L.1
  • 10
    • 0028543165 scopus 로고
    • Inconsistent signal feasibility problems: Least-squares solutions in a product space
    • Nov.
    • _, "Inconsistent signal feasibility problems: Least-squares solutions in a product space," IEEE Trans. Signal Processing, vol. 42, pp. 2955-2966, Nov. 1994.
    • (1994) IEEE Trans. Signal Processing , vol.42 , pp. 2955-2966
  • 11
    • 0001488677 scopus 로고
    • Construction d'un point fixe commun à une famille de contractions fermes
    • June
    • _, "Construction d'un point fixe commun à une famille de contractions fermes," C. R. Acad. Sci. Paris Sér. I Math., vol. 320, pp. 1385-1390, June 1995.
    • (1995) C. R. Acad. Sci. Paris Sér. I Math. , vol.320 , pp. 1385-1390
  • 12
    • 77954607855 scopus 로고    scopus 로고
    • The convex feasibility problem in image recovery
    • New York: Academic
    • _, "The convex feasibility problem in image recovery," in Advances in Imaging and Electron Physics, P. Hawkes, Ed. New York: Academic, 1996, vol. 95, pp. 155-270.
    • (1996) Advances in Imaging and Electron Physics , vol.95 , pp. 155-270
    • Hawkes, P.1
  • 13
    • 0031118954 scopus 로고    scopus 로고
    • Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
    • Apr.
    • _, "Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections," IEEE Trans. Image Processing, vol. 6, pp. 493-506, Apr. 1997.
    • (1997) IEEE Trans. Image Processing , vol.6 , pp. 493-506
  • 14
    • 0033889575 scopus 로고    scopus 로고
    • Strong convergence of block-iterative outer approximation methods for convex optimization
    • Feb.
    • _, "Strong convergence of block-iterative outer approximation methods for convex optimization," SIAM J. Contr. Optim., vol. 38, pp. 538-565, Feb. 2000.
    • (2000) SIAM J. Contr. Optim. , vol.38 , pp. 538-565
  • 15
    • 0032653272 scopus 로고    scopus 로고
    • Hard-constrained inconsistent signal feasibility problems
    • Sept.
    • P. L. Combettes and P. Bondon, "Hard-constrained inconsistent signal feasibility problems," IEEE Trans. Signal Processing, vol. 47, pp. 2460-2468, Sept. 1999.
    • (1999) IEEE Trans. Signal Processing , vol.47 , pp. 2460-2468
    • Combettes, P.L.1    Bondon, P.2
  • 16
    • 0030108032 scopus 로고    scopus 로고
    • Combining statistical information in set theoretic estimation
    • Mar.
    • P. L. Combettes and T. J. Chaussalet, "Combining statistical information in set theoretic estimation," IEEE Signal Processing Lett., vol. 3, pp. 61-62, Mar. 1996.
    • (1996) IEEE Signal Processing Lett. , vol.3 , pp. 61-62
    • Combettes, P.L.1    Chaussalet, T.J.2
  • 17
    • 0036871107 scopus 로고    scopus 로고
    • An adaptive level set method for nondifferentiable constrained image recovery
    • Nov.
    • P. L. Combettes and J. Luo, "An adaptive level set method for nondifferentiable constrained image recovery," IEEE Trans. Image Processing, vol. 11, pp. 1295-1304, Nov. 2002.
    • (2002) IEEE Trans. Image Processing , vol.11 , pp. 1295-1304
    • Combettes, P.L.1    Luo, J.2
  • 18
    • 0026188767 scopus 로고
    • The use of noise properties in set theoretic estimation
    • July
    • P. L. Combettes and H. J. Trussell, "The use of noise properties in set theoretic estimation," IEEE Trans. Signal Processing, vol. 39, pp. 1630-1641, July 1991.
    • (1991) IEEE Trans. Signal Processing , vol.39 , pp. 1630-1641
    • Combettes, P.L.1    Trussell, H.J.2
  • 20
    • 0030080902 scopus 로고    scopus 로고
    • A quadratically convergent algorithm for convex set constrained signal recovery
    • Feb.
    • S. Dharanipragada and K. S. Arun, "A quadratically convergent algorithm for convex set constrained signal recovery," IEEE Trans. Signal Processing, vol. 44, pp. 248-266, Feb. 1996.
    • (1996) IEEE Trans. Signal Processing , vol.44 , pp. 248-266
    • Dharanipragada, S.1    Arun, K.S.2
  • 21
    • 84948499836 scopus 로고
    • An algorithm for restricted least squares regression
    • Dec.
    • R. L. Dykstra, "An algorithm for restricted least squares regression," J. Amer. Statist. Assoc., vol. 78, pp. 837-842, Dec. 1983.
    • (1983) J. Amer. Statist. Assoc. , vol.78 , pp. 837-842
    • Dykstra, R.L.1
  • 22
    • 84880683689 scopus 로고
    • Iteration methods for convexly constrained ill-posed problems in Hubert space
    • B. Eicke, "Iteration methods for convexly constrained ill-posed problems in Hubert space," Numer. Func. Anal. Optim., vol. 13, pp. 413-429, 1992.
    • (1992) Numer. Func. Anal. Optim. , vol.13 , pp. 413-429
    • Eicke, B.1
  • 23
    • 0031332301 scopus 로고    scopus 로고
    • Restoration of a single superresolution image from several blurred, noisy, and undersampled measured images
    • Dec.
    • M. Elad and A. Feuer, "Restoration of a single superresolution image from several blurred, noisy, and undersampled measured images," IEEE Trans. Image Processing, vol. 6. pp. 1646-1658, Dec. 1997.
    • (1997) IEEE Trans. Image Processing , vol.6 , pp. 1646-1658
    • Elad, M.1    Feuer, A.2
  • 24
    • 0001886656 scopus 로고
    • A cyclic projection algorithm via duality
    • N. Gaffke and R. Mathar, "A cyclic projection algorithm via duality," Metrika, vol. 36, pp. 29-54, 1989.
    • (1989) Metrika , vol.36 , pp. 29-54
    • Gaffke, N.1    Mathar, R.2
  • 25
    • 22444455259 scopus 로고    scopus 로고
    • Incomplete projection algorithms for solving the convex feasibility problem
    • U. M. García-Palomares and F. J. González-Castaño, "Incomplete projection algorithms for solving the convex feasibility problem," Numer. Algorithms, vol. 18, pp. 177-193, 1998.
    • (1998) Numer. Algorithms , vol.18 , pp. 177-193
    • García-Palomares, U.M.1    González-Castaño, F.J.2
  • 27
    • 84894234564 scopus 로고
    • Fixed points of nonexpanding maps
    • Nov.
    • B. Halpern, "Fixed points of nonexpanding maps," Bull. Amer. Math. Soc., vol. 73, pp. 957-961, Nov. 1967.
    • (1967) Bull. Amer. Math. Soc. , vol.73 , pp. 957-961
    • Halpern, B.1
  • 29
    • 0016993571 scopus 로고
    • Quadratic optimization for image reconstruction I
    • G. T. Herman and A. Lent, "Quadratic optimization for image reconstruction I," Comput. Graph. Image Processing, vol. 5, pp. 319-332, 1976.
    • (1976) Comput. Graph. Image Processing , vol.5 , pp. 319-332
    • Herman, G.T.1    Lent, A.2
  • 30
    • 0011981684 scopus 로고
    • The inverse problem of radiography
    • June
    • B. R. Hunt, "The inverse problem of radiography," Math. Biosci.,vol 8, pp. 161-179, June 1970.
    • (1970) Math. Biosci. , vol.8 , pp. 161-179
    • Hunt, B.R.1
  • 31
    • 0015660455 scopus 로고
    • The application of constrained least-squares estimation to image restoration by digital computer
    • Sept.
    • _, "The application of constrained least-squares estimation to image restoration by digital computer," IEEE Trans. Comput., vol. C-22, pp. 805-812, Sept. 1973.
    • (1973) IEEE Trans. Comput. , vol.C-22 , pp. 805-812
  • 32
    • 34249920356 scopus 로고
    • On the convergence of Han's method for convex programming with quadratic objective
    • Aug.
    • A. N. Iusem and A. R. De Pierro, "On the convergence of Han's method for convex programming with quadratic objective," Math. Programming, vol. 52, pp. 265-284, Aug. 1991.
    • (1991) Math. Programming , vol.52 , pp. 265-284
    • Iusem, A.N.1    De Pierro, A.R.2
  • 33
    • 27144477647 scopus 로고
    • A row-action method for convex programming
    • A. N. Iusem and B. F. Svaiter, "A row-action method for convex programming," Math. Programming, vol. 64, pp. 149-171, 1994.
    • (1994) Math. Programming , vol.64 , pp. 149-171
    • Iusem, A.N.1    Svaiter, B.F.2
  • 34
    • 38249016829 scopus 로고
    • A multiple input image restoration approach
    • Sept.
    • A. K. Katsaggelos, "A multiple input image restoration approach," J. Visual Commun. Image Represent, vol. 1, pp. 93-103, Sept. 1990.
    • (1990) J. Visual Commun. Image Represent , vol.1 , pp. 93-103
    • Katsaggelos, A.K.1
  • 35
    • 0038913767 scopus 로고    scopus 로고
    • Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
    • Feb.
    • K. C. Kiwiel, "Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems," Linear Algebra Appl, vol. 252, pp. 27-33, Feb. 1997.
    • (1997) Linear Algebra Appl , vol.252 , pp. 27-33
    • Kiwiel, K.C.1
  • 36
    • 0012559158 scopus 로고
    • Sinogram recovery with the method of convex projections for limited-data reconstruction in computed tomography
    • July
    • H. Kudo and T. Saito, "Sinogram recovery with the method of convex projections for limited-data reconstruction in computed tomography," J. Opt. Soc. Amer.,vol. A8, pp. 1148-1160, July 1991.
    • (1991) J. Opt. Soc. Amer. , vol.A8 , pp. 1148-1160
    • Kudo, H.1    Saito, T.2
  • 37
    • 0037976257 scopus 로고
    • Généralisation de la formule de Trotter-Lie
    • Oct.
    • M. Lapidus, "Généralisation de la formule de Trotter-Lie," C. R. Acad. Sci. Paris Sér. A Math., vol. 291, pp. 497-500, Oct. 1980.
    • (1980) C. R. Acad. Sci. Paris Sér. A Math. , vol.291 , pp. 497-500
    • Lapidus, M.1
  • 38
    • 0022908688 scopus 로고
    • An optimal technique for constraint-based image restoration and reconstruction
    • Dec.
    • R. M. Leahy and C. E. Goutis. "An optimal technique for constraint-based image restoration and reconstruction," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 1629-1642, Dec. 1986.
    • (1986) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-34 , pp. 1629-1642
    • Leahy, R.M.1    Goutis, C.E.2
  • 39
    • 0020922448 scopus 로고
    • A fast quadratic programming algorithm for positive signal restoration
    • Dec.
    • A. J. Levy, "A fast quadratic programming algorithm for positive signal restoration," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 1337-1341, Dec. 1983.
    • (1983) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-31 , pp. 1337-1341
    • Levy, A.J.1
  • 40
    • 0035503164 scopus 로고    scopus 로고
    • Comments on "Least squares restoration of multichannel images"
    • Nov.
    • M. K. Ng and W. C. Kwan, "Comments on "Least squares restoration of multichannel images"," IEEE Trans. Signal Processing, vol. 49, p. 2885, Nov. 2001.
    • (2001) IEEE Trans. Signal Processing , vol.49 , pp. 2885
    • Ng, M.K.1    Kwan, W.C.2
  • 41
    • 0023981050 scopus 로고
    • Tomographie image reconstruction using the theory of convex projections
    • Mar.
    • P. Oskoui-Fard and H. Stark, "Tomographie image reconstruction using the theory of convex projections," IEEE Trans. Med. Imag., vol. 7, pp. 45-58, Mar. 1988.
    • (1988) IEEE Trans. Med. Imag. , vol.7 , pp. 45-58
    • Oskoui-Fard, P.1    Stark, H.2
  • 42
    • 84987937647 scopus 로고
    • Éclatement de contraintes en parallèle pour la minimisation d'une forme quadratique
    • G. Pierra, "Éclatement de contraintes en parallèle pour la minimisation d'une forme quadratique," in Lecture Notes in Comput. Sci., 1976, vol. 41, pp. 200-218. See also "Decomposition through formalization in a product space," Math. Programming, vol. 28, pp. 96-115, Jan. 1984.
    • (1976) Lecture Notes in Comput. Sci. , vol.41 , pp. 200-218
    • Pierra, G.1
  • 43
    • 0021201713 scopus 로고
    • Decomposition through formalization in a product space
    • Jan.
    • G. Pierra, "Éclatement de contraintes en parallèle pour la minimisation d'une forme quadratique," in Lecture Notes in Comput. Sci., 1976, vol. 41, pp. 200-218. See also "Decomposition through formalization in a product space," Math. Programming, vol. 28, pp. 96-115, Jan. 1984.
    • (1984) Math. Programming , vol.28 , pp. 96-115
  • 44
    • 0038313697 scopus 로고
    • A limit theorem for projections
    • S. Reich, "A limit theorem for projections," Linear Multilinear Algebra, vol. 13, pp. 281-290, 1983.
    • (1983) Linear Multilinear Algebra , vol.13 , pp. 281-290
    • Reich, S.1
  • 45
    • 0032166840 scopus 로고    scopus 로고
    • Convexly constrained linear inverse problems: Iterative least-squares and regularization
    • Sept.
    • A. Sabharwal and L. C. Potter, "Convexly constrained linear inverse problems: Iterative least-squares and regularization," IEEE Trans. Signal Processing, vol. 46, pp. 2345-2352, Sept. 1998.
    • (1998) IEEE Trans. Signal Processing , vol.46 , pp. 2345-2352
    • Sabharwal, A.1    Potter, L.C.2
  • 47
    • 0026237983 scopus 로고
    • Prototype image constraints for settheoretic image restoration
    • Oct.
    • M. I. Sezan and H. J. Trussell, "Prototype image constraints for settheoretic image restoration," IEEE Trans. Signal Processing, vol. 39, pp. 2275-2285, Oct. 1991.
    • (1991) IEEE Trans. Signal Processing , vol.39 , pp. 2275-2285
    • Sezan, M.I.1    Trussell, H.J.2
  • 48
    • 0001632008 scopus 로고
    • General structure of regularization procedures in image reconstruction
    • Mar.
    • D. M. Titterington, "General structure of regularization procedures in image reconstruction," Astron. Astrophys., vol. 144, pp. 381-387, Mar. 1985.
    • (1985) Astron. Astrophys. , vol.144 , pp. 381-387
    • Titterington, D.M.1
  • 50
    • 0002504521 scopus 로고
    • The application of numerical filtering to the solution of integral equations encountered in indirect sensing measurements
    • Feb.
    • S. Twomey, "The application of numerical filtering to the solution of integral equations encountered in indirect sensing measurements," J. Franklin Inst., vol. 279, pp. 95-109, Feb. 1965.
    • (1965) J. Franklin Inst. , vol.279 , pp. 95-109
    • Twomey, S.1
  • 51
    • 0032002260 scopus 로고    scopus 로고
    • Quadratic optimization of fixed points of nonexpansive mappings in Hubert space
    • I. Yamada, N. Ogura, Y. Yamashita, and K. Sakaniwa, "Quadratic optimization of fixed points of nonexpansive mappings in Hubert space," Numer. Funct. Anal. Optim., vol. 19, pp. 165-190, 1998.
    • (1998) Numer. Funct. Anal. Optim. , vol.19 , pp. 165-190
    • Yamada, I.1    Ogura, N.2    Yamashita, Y.3    Sakaniwa, K.4
  • 52
    • 0036571426 scopus 로고    scopus 로고
    • An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques
    • May
    • I. Yamada, K. Slavakis, and K. Yamada, "An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques," IEEE Trans. Signal Processing, vol. 50, pp. 1091-1101, May 2002.
    • (2002) IEEE Trans. Signal Processing , vol.50 , pp. 1091-1101
    • Yamada, I.1    Slavakis, K.2    Yamada, K.3
  • 53
    • 0020191832 scopus 로고
    • Image restoration by the method of convex projections: Part 1 - Theory
    • Oct.
    • D. C. Youla and H. Webb, "Image restoration by the method of convex projections: Part 1 - Theory," IEEE Trans. Medical Imag., vol. MI-1, pp. 81-94, Oct. 1982.
    • (1982) IEEE Trans. Medical Imag. , vol.MI-1 , pp. 81-94
    • Youla, D.C.1    Webb, H.2


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