The Foundations of Set Theoretic Estimation

Proceedings of the IEEE

Volumn 81, Issue 2, 1993, Pages 182-208

  Combettes, Patrick L ^a  

^a CITY COLLEGE OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; ESTIMATION; FUNCTION EVALUATION; OPTIMIZATION; SIGNAL PROCESSING;

OBJECTIVE FUNCTIONS; SET THEORETIC ESTIMATION;

SET THEORY;

EID: 0027541192     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.214546     Document Type: Article

References (223)

1. A. Abo-Taleb and M. M. Fahmy, “Design of FIR two-dimensional digital filters by successive projections IEEE Trans. Circuits Syst., vol. 31, no. 9, pp. 801–805, Sept. 1984.
2. S. Agmon, “The relaxation method for linear inequalities,” Canadian J. Math., vol. 6, no. 3, pp. 382–392, 1954.
3. R. Aharoni, A. Berman, and Y. Censor, “An interior points algorithm for the convex feasibility problem,” Advances Appl. Math., vol. 4, no. 4, pp. 479—489, Dec. 1983.
4. R. Aharoni and Y. Censor, “Block-iterative methods for parallel computation of solutions to convex feasibility problems,” Linear Algebra and Its Applications, vol. 120, pp. 165–175, Aug. 1989.
5. M. Arioli, A. Laratta, and 0. Menchi, “A big-M type method for the computation of projections onto polyhedrons J. Optimiz. Theory Applications, vol. 47, no. 1, pp. 17–34, Sept. 1985.
6. R. B. Ash, Real Analysis and Probability. New York: Academic, 1972.
7. A. Auslender, Optimisation—Methodes Numeriques. Paris: Masson, 1976.
8. R. Barakat and G. Newsam, “Algorithms for reconstruction of partially known, band-limited Fourier transform pairs from noisy data. II: The nonlinear problem of phase retrieval,” J. Integral Eqs., vol. 9, no. 1 (supplement), pp. 77–125, July 1985.
9. J. R. Barra Notions Fondamentales de Statistique Mathematique. Paris: Dunod, 1971.
10. M. Benidir and B. Picinbono, “Nonconvexity of the stability domain of digital filters,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 38, no. 8, pp. 1459–1460, Aug. 1990.
11. J. O. Berger, Statistical Decision Theory and Bayesian Analysis, second edition. New York: Springer-Verlag, 1985.
12. D. P. Bertkestas and I. B. Rhodes, “Recursive state estimation for a set-membership description of uncertainty,” IEEE Trans. Automat. Contr., vol. 16, no. 2, pp. 117–128, Apr. 1971.
13. N. Bourbaki, Elements de Mathematique—Espaces Vectoriels Topologiques. Paris: Masson, 1981.
14. N. Bourbaki, Elements de Mathematique—Theorie des Ensembles. Paris: Masson, 1990.
15. J. P. Boyle and R. L. Dykstra, “A method for finding projections onto the intersection of convex sets in Hilbert spaces,” Lecture Notes in Statistics, vol. 37, pp. 28—47, 1986.
16. D. Braess, Nonlinear Approximation Theory. New York: Springer-Verlag, 1986.
17. L. M. Bregman, “The method of successive projection for finding a common point of convex sets,” Soviet Mathematics—Doklady, vol. 6, no. 3, pp. 688–692, May 1965.
18. L. M. Bregman, “The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming,” U.S.S.R. Computational Math. Math. Physics, vol. 7, no. 3, 200–217, 1967.
19. L. Breiman, Statistics with a View towards Applications. Boston, MA: Houghton Mifflin Co., 1973.
20. P. J. Brockwell and R. A. Davis, Time Series; Theory and Methods, second edition. Newr York: Springer-Verlag, 1991.
21. R. E. Bruck, “Random products of contractions in metric and Banach spaces,” J. Math. Analysis Applications, vol. 88, no. 2, pp. 319–332, Aug. 1982.
22. O. M. Bucci, G. Franceschetti, G. Mazzarella, and G. Panariello, “Intersection approach to array pattern synthesis,” IEE Proc.-H, vol. 137, no. 6, 349–357, Dec. 1990.
23. O. M. Bucci, G. Mazzarella, and G. Panariello, “Reconfigurable arrays by phase-only control,” IEEE Trans. Antennas Propagat., vol. 39, no. 7, pp. 919–925, July 1991.
24. J. A. Cadzow, “Signal enhancement—A composite property mapping algorithm,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 36, no. 1, pp. 49–62, Jan. 1988.
25. J. A. Cadzow and T. C. Chen, “Alebraic approach to two-dimensional recursive digital filter synthesis,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 37, no. 5, pp. 655–664, May 1989.
26. J. M. Carazo and J. L. Carrascosa, “Information recovery in missing angular data cases: An approach by the convex projections method in three dimensions,” J. Microscopy, vol. 145, 1, 23–43, Jan. 1987.
27. Y. Censor, “Iterative methods for the convex feasibility problem,” Annals of Discrete Math., vol. 20, pp. 83–91, 1984.
28. Y. Censor “An automatic relaxation method for solving interval linear inequalities,” J. Math. Analysis Applications, vol. 106, no. 1, pp. 19–25, Feb. 1985.
29. Y. Censor, “Parallel application of block-iterative methods in medical imaging and radiation therapy,” Math. Programming, vol. 42, no. 2, pp. 307–325, 1988.
30. Y. Censor, P. P. B. Eggermont, and D. Gordon, “Strong un-derrelaxation in Kaczmarz’s method for inconsistent systems,” Numerische Mathematik, vol. 41, no. 1, 83–92, 1983.
31. Y. Censor and T. Elfving, “New methods for linear inequalities,” Linear Algebra and Its Applications, vol. 42, pp. 199–211, Feb. 1982.
32. Y. Censor, D. E. Gustafson, A. Lent, and H. Tuy, “A new approach to the emission computerized tomography problem: Simultaneous calculation of attenuation and activity coeffi-cients,” IEEE Trans. Nuclear Sci., vol. NS-26, no. 2, pp. 2775–2779, Apr. 1979.
33. Y. Censor and A. Lent, “Cyclic subgradient projections,” Math. Programming, vol. 24, no. 2, pp. 233–235, 1982.
34. A. E. cetin “An iterative algorithm for signal reconstruction from bispectrum IEEE Trans. Signal Process., vol. 39, no. 12, pp. 2621–2628, Dec. 1991.
35. A. E. cetin and R. Ansari, “Iterative procedure for designing two-dimensional FIR filters,” Electronics Letters, vol. 23, no. 3, pp. 131–133, Jan. 1987.
36. A. E. cetin and R. Ansari, “Convolution-based framework for signal recovery and applications,” J. Optical Soc. America A, vol. 5, no. 8, pp. 1193–1200, Aug. 1988.
37. W. Cheney and A. A. Goldstein, “Proximity maps for convex sets,” Proc. American Math. Soc., vol. 10, no. 3, pp. 448–450, June 1959.
38. R. T. Chin, C. L. Yeh, and W. S. Olson, “Restoration of multichannel microwave radiometric images,” IEEE Trans. Pattern Analysis Machine Intelligence, vol. 7, no. 4, pp. 475–484 July 1985.
39. G. Cimmino, “Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari,” La Ricerca Scientifica (Roma), vol. 1, pp. 326–333, 1938.
40. M. R. Civanlar and R. A. Nobakht, “Optimal pulse shape design using projections onto convex sets,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Process., New York, NY, Apr. 11–14, 1988, pp. 1874–1877.
41. M. R. Civanlar and H. J. Trussell “Constructing membership functions using statistical data,” Fuzzy Sets and Systems, vol. 18, no. 1, 1–13, Jan. 1986.
42. M. R. Civanlar and H. J. Trussell, “Digital signal restoration using fuzzy sets,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 34, no. 4, pp. 919–936, Aug. 1986.
43. P. L. Combettes, “Signal recovery by best feasible approximation,” IEEE Trans. Image Process., vol. 2, no. 2, Apr. 1993.
44. P. L. Combettes, M. Benidir, and B. Picinbono, “A general framework for the incorporation of uncertainty in set theoretic estimation,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Process., San Francisco, CA, vol. 3, Mar. 23–26, 1992, pp. 349–352.
45. P. L. Combettes and T. J. Chaussalet, “Criteres de qualite en estimation ensembliste,” in Proc. Thirteenth GRETSI Symp., Juan-les-Pins, France, 16–20, 1991, 249–252.
46. P. L. Combettes and H. Puh, “Parallel projection methods for set theoretic signal reconstruction and restoration,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Process., Minneapolis, MN, vol. 5, Apr. 27–30, 1993, pp. 297–300.
47. P. L. Combettes and H. J. Trussell “Methods for digital restoration of signals degraded by a stochastic impulse response,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 37, no. 3, 393—401, Mar. 1989.
48. P. L. Combettes and H. J. Trussell“Set theoretic autoregressive spectral estimation,” in Proc. Fifth ASSP Workshop on Spectrum Estimation and Mod-eling, Rochester, NY, Oct. 10—12, 1990, 261–264.
49. P. L. Combettes and H. J. Trussell, “Method of successive projections for finding a common point of sets in metric spaces,” J. Optimiz. Theory Applications, vol. 67, no. 3, 487–507, Dec. 1990.
50. P. L. Combettes and H. J. Trussell, “The use of noise properties in set theoretic estimation,” IEEE Trans. Signal Process., vol. 39, no. 7, pp. 1630–1641, July 1991.
51. P. L. Combettes and H. J. Trussell, “Set theoretic estimation by random search,” IEEE Trans. Signal Process., vol. 39, no. 7, pp. 1669–1671, July 1991.
52. P. L. Combettes and H. J. Trussell, “Best stable and invertible approximations for ARMA systems,” IEEE Trans. Signal Process., vol. 40, no. 12, pp. 3066–3069, Dec. 1992.
53. P. L. Combettes and H. J. Trussell, “Deconvolution with bounded uncertainty,” Int. J. Adaptive Control Signal Process., accepted for publication.
54. G. Crombez, “Image recovery by convex combinations of projections,” J. Math. Analysis Applications, vol. 155, no. 2, pp. 413—419, Mar. 1991.
55. I. Csiszar, “Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems,” Annals Statistics, vol. 19, no. 4, 2032–2066, Dec. 1991.
56. S. R. Curtis, A. V. Oppenheim, and J. S. Lim, “Signal reconstruction from Fourier transform sign information,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 33, no. 3, pp. 643–657, June 1985.
57. S. Dasgupta and Y. F. Huang, “Asymptotically convergentmodified recursive least-squares with data-dependent updatingand forgetting factor for systems with bounded noise”, IEEETrans. Informal. Theory, vol. 33, no. 3, pp. 383–392, May 1987.
58. R. Dautray and J. L. Lions, Analyse Mathematique et Calcul Numerique pour les Sciences et les Techniques. Paris: Masson, 1984.
59. J. R. Deller, Jr., “A ‘systolic array’ formulation of the optimalbounding ellipsoid algorithm,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 37, no. 9, pp. 1432–1436. Sept. 1989.
60. J. R. Deller, Jr., “Set membership identification in digital signal processing,” IEEE ASSP Mag., vol. 6, no. 4, pp. 4–20, Oct. 1989.
61. J. R. Deller, Jr. and T. C. Luk, “Linear prediction analysis of speech based on set-membership theory,” Computer Speech Language, vol. 3, no. 4, pp. 301–327, Oct. 1989.
62. J. R. Deller, Jr., M. Nayeri, and S. F. Odeh, “Least-square identification with error bounds for real-time signal processing and control,” Proc. IEEE, accepted for publication.
63. A. P. Dempster, “A generalization of Bayesian inference (withdiscussion),” J. Royal Statistical Soc., vol. B30, no. 2, pp.205-247, 1968.
64. A. R. De Pierro and A. N. lusem, “A simultaneous projectionsmethod for linear inequalities,” Linear Algebra and ItsApplications, vol. 64, pp. 243–253, Jan. 1985.
65. A. R. De Pierro and A. N. Iusem, “A parallel projection method for finding a common point of a family of convex sets,” Pesquisa Operacional, vol. 5, no. 1, pp. 1–20, July 1985.
66. A. R. De Pierro and A. N. Iusem, “A finitely convergent ‘row-action’ method for the convex feasibility problem,” Appl. Math. Optimiz., vol. 17, pp. 225–235, 1988.
67. F. Deutsch, J. H. McCabe, and G. M. Phillips, “Some algorithms for computing best approximations from convex cones,” SIAM J. Numerical Analysis, vol. 12, no. 3, 390–403, June 1975.
68. J. Dieudonne, Foundations of Modem Analysis, second ed. New York: Academic, 1969.
69. D. Dubois and H. Prade, Fuzzy Sets and Systems: Theory and Applications. New York: Academic, 1980.
70. A. R. De Pierro and A. N. Iusem, “A review of fuzzy set aggregation connectives,” Infor-mat. Sci., vol. 36, no. 1, pp. 85–121, July 1985.
71. S. Ebstein, “Stellar speckle interferometry energy spectrum recovery by convex projections,” Appl. Optics, vol. 26, no. 8, pp. 1530–1536, Apr. 1987.
72. B. Efron, “Why isn't everyone a Bayesian?” American Statistician, vol. 40, no. 1, pp. 1–5, Feb. 1986.
73. H. Elmikati and A. A. Elsohly, “Extension of projection method to nonuniformly linear antenna arrays,” IEEE Trans. Antennas Propagat., vol. 32, no. 5, pp. 507–512, May 1984.
74. I. I. Eremin, “Generalization of the relaxation method of Motzkin-Agmon,” Uspekhi Matematicheskikh Nauk, vol. 20, no. 2, 183–187, Mar. 1965 (in Russian).
75. J. R. Fienup, “Phase retrieval algorithms: A comparison,” Appl. Optics, vol. 21, no. 15, pp. 2758–2769, Aug. 1982.
76. S. D. Flarn and J. Zowe, “Relaxed outer projections, weighted averages, and convex feasibility,” BIT, vol. 30, no. 2, pp. 289–300, 1990.
77. E. Fogel, “System identification via membership set constraints with energy constrained noise,” IEEE Trans. Automat. Contr., vol. 24, no. 5, 752–758, Oct. 1979.
78. E. Fogel and Y. F. Huang, “On the value of information in system identification—Bounded noise case,” Automatica, vol. 18, no. 2, pp. 229–238, Mar. 1982.
79. C. Franchetti and W. Light, “The alternating algorithm in uniformly convex spaces,” J. London Math. Soc., vol. 29, pp. 545–555, 1984.
80. N. Gaffke and R. Mathar, “A cyclic projection algorithm via duality,” Metrika, vol. 36, no. 1, pp. 29–54, 1989.
81. N. C. Gallagher and B. Liu, “Method for computing kinoforms that reduces image reconstruction error,” Applied Optics, vol. 12, no. 10, 2328–2335, Oct. 1973.
82. N. Gastinel, Analyse Numerique Lineaire. Paris: Hermann, 1966.
83. R. W. Gerchberg and W. O. Saxton, “A practical algorithm for the determination of phase from image and diffraction plane pictures,” Optik, vol. 35, no. 2, pp. 237–246, Apr. 1972.
84. R. W. Gerchberg, “Super-resolution through error energy re-duction,” Optica Acta, vol. 21, no. 9, pp. 709–720, Sept. 1974.
85. P. Gilbert, “Iterative methods for the three-dimensional reconstruction of an object from projections,” J. Theoretical Biol., vol. 36, no. 1, pp. 105–117, July 1972.
86. J. D. Glover and F. C. Schweppe, “Control of linear dynamic systems with set constrained disturbances,” IEEE Trans. Au-tomat. Contr., vol. 16, no. 5, pp. 411–423, Oct. 1971.
87. J. L. Goffin, “The relaxation method for solving systems of linear inequalities,” Math. Operations Res., vol. 5, no. 3, pp. 388–414, Aug. 1980.
88. J. L. Goffin, “Convergence of a cyclic ellipsoid algorithm for systems of linear equalities,” Math. Programming, vol. 22, no. 3, pp. 239–260, 1982.
89. M. Goldburg and R. J. Marks II, “Signal synthesis in the presence of an inconsistent set of constraints,” IEEE Trans. Circuits Syst., vol. 32, no. 7, pp. 647–663, July 1985.
90. R. Gordon, R. Bender, and G. T. Herman, “Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography,” J. Theoretical Biology, vol. 29, no. 3, pp. 471–481, Dec. 1970.
91. R. Gordon and G. T. Herman, “Three-dimensional reconstruction from projections: A review of algorithms,” Int. Review Cytology, vol. 38, pp. 111–151, 1974.
92. L. G. Gubin, B. T. Polyak, and E. V. Raik, “The method of projections for finding the common point of convex sets,” U.S.S.R. Computational Math. Math. Physics, vol. 7, no. 6, pp. 1–24, 1967.
93. I. Halperin, “The product of projection operators,” Acta Sci-entiarum Mathematicarum (Szeged), vol. 23, no. 1, pp. 96–99, 1962.
94. S. P. Han, “A successive projection method,” Math. Program-ming, vol. 40, no. 1, pp. 1–14, Jan. 1988.
95. M. H. Hayes, “The reconstruction of a multidimensional sequence from the phase or magnitude of its Fourier transform,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 30, no. 2, pp. 140–154, Apr. 1982.
96. M. Hedley, H. Yan, and D. Rosenfeld, “Motion artifact correction in MRI using generalized projections,” IEEE Trans. Medical vol. 10, no. 1, 40–46, Mar. 1991.
97. S. Hein and A. Zakhor, “Reconstruction of oversampled bandlimited signals from Š∑खencoded binary sequences,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Process., San Fran-cisco, CA, vol. 4, Mar. 23–26, 1992, 161–164.
98. G. T. Herman, “A relaxation method for reconstructing objects from noisy X-rays,” Math. Programming, vol. 8, no. 1, pp. 1–19, Feb. 1975.
99. G.T. Herman, Image Reconstruction from Projections, the Fundamentals of Computerized Tomography. New York: Aca-demic, 1980.
100. G. T. Herman, “Mathematical optimization versus practical performance: A case study based on the maximum entropy criterion in image reconstruction,” Math. Programming Study, vol. 20, 96–112, Oct. 1982.
101. G. T. Herman, A. Lent, and P. H. Lutz, “Relaxation methods for image reconstruction,” Communications ACM, vol. 21, no. 2, pp. 152–158, Feb. 1978.
102. R. G. Hoptroff, P. W. McOwan, T. J. Hall, W. J. Hossak, and R. E. Burge, “Two optimization approaches to cohoe design,” Optics Communications, vol. 73, no. 3, pp. 188–194, Oct. 1989.
103. Y. F. Huang, “A recursive estimation algorithm using selective updating for spectral analysis and adaptive signal processing,” IEEE Trans. Acoustics. Speech, Signal Process., vol. 34, no. 5, pp. 1331–1334, Oct. 1986.
104. N. E. Hurt, “Signal enhancement and the method of successive projections,” Acta Applicandae Mathematicae, vol. 23, no. 2, pp. 145–162, May 1991.
105. A. N. Iusem and A. R. De Pierro, “Convergence results for an accelerated nonlinear Cimmino algorithm,” Numerische Math-ematik, vol. 49, no. 4, pp. 367–378, Aug. 1986.
106. A. N. lusem and A. R. De Pierro, “On the convergence of Han’s method for convex programming with quadratic objective,” Math. Programming, vol. 52, no. 2, pp. 265–284, Aug. 1991.
107. A. N. Iusem and L. Moledo, “A finitely convergent method of simultaneous subgradient projections for the convex feasibility problem,” Mathematica Aplicada e Computacional, vol. 5, no. 2, pp. 169–184, 1986.
108. G. G. Johnson, “A nonconvex set which has the unique nearest point property,” J. Approximation Theory, vol. 51, no. 4, pp. 289–332, Dec. 1987.
109. S. Kaczmarz, “Angenaherte Auflosung von Systemen linearer Gleichungen,” Bulletin de VAcademie des Sciences de Pologne, vol. A35, pp. 355–357, 1937.
110. W. J. Kammerer and M. Z. Nashed, “A generalization of a matrix iterative method of G. Cimmino to best approximate solution of linear integral equations of the first kind,” Atti della Accademia Nazionale dei Lincei—Rendicoti, vol. 51, pp. 20–25, 1971.
111. A. Kandel, Fuzzy Mathematical Techniques with Applications. Reading, MA: Addison-Wesley, 1986.
112. J. N. Kapur, “Twenty-five years of maximum-entropy princi-ple” J. Math. Physical Sci., vol. 17, no. 2, pp. 103–156, Apr. 1983.
113. A. K. Katsaggelos, J. Biemond, R. W. Schafer, and R. M. Mersereau, “A regularized iterative image restoration algo-rithm,” IEEE Trans. Signal Process., vol. 39, no. 4, pp. 914–929, Apr. 1991.
114. S. M. Kay, Modern Spectrum Estimation. Englewood Cliffs, NJ: Prentice-Hall, 1988.
115. J S. Kayalar and H. L. Weinert, “Error bounds for the method of alternating projections,” Math. Control, Signals, Systems, vol. I, no. 1, 43–59, 1988.
116. K. Keesman and G. Van Straten, “Identification and prediction propagation of uncertainty in models with bounded noise,” Int. J. Control, vol. 49, no. 6, pp. 2259–2269, June 1989.
117. P. Kosmol and X. L. Zhou, “The product of affine orthogonal projections,” J. Approximation Theory, vol. 64, no. 3, pp. 351–355, Mar. 1991.
118. Z. Kostic, M. I. Sezan, and E. L. Titlebaum, “Estimation of the parameters of a multipath channel using set-theoretic deconvolution,” IEEE Trans. Commun., vol. 40, no. 6, pp. 1006–1011, June 1992.
119. R. L. Kosut, “Adaptive control via parameter set estimation,” Int. J. Adaptive Control Signal Process., vol. 2, no. 4, pp. 371–399, Dec. 1988.
120. H. Kudo and T. Saito, “Sinogram recovery with the method of convex projections for limited-data reconstruction in computed tomography,” J. Optical Soc. America A, vol. 8. no. 7, pp. 1148–1160, July 1991.
121. S. S. Kuo and R. J. Mammone, “Image restoration by convex projections using adaptive constraints and the L1 norm,” IEEE Trans. Signal Process., vol. 40, no. 1, 159–168, Jan. 1992.
122. H. J. Landau and W. L. Miranker, “The recovery of distorted band-limited signals,” J. Math. Analysis Applications, vol. 2, no. 1, pp. 97–104, Feb. 1961.
123. A. M. Landraud, “Image restoration and enhancement of char-acters, using convex projection methods,” CVGIP: Graphical Models and Image Processing, vol. 53, no. 1, pp. 85–92, Jan. 1991.
124. A. Lent and H. Tuy, “An iterative method for the extrapolation of band-limited functions,” J. Math. Analysis Applications, vol. 83, no. 2, pp. 554–565, Oct. 1981.
125. A. Levi and H. Stark, “Signal reconstruction from phase by projection onto convex sets,” J. Optical Soc. America, vol. 73, no. 6, pp. 810–822, June 1983.
126. A. Levi and H. Stark, “Image restoration by the method of generalized projections with application to restoration from magnitude,” J. Optical Soc. America A, vol. 1, no. 9, pp. 932–943, Sept. 1984.
127. J. Llacer and E. Veklerov, “Feasible images and practical stopping rules for iterative algorithms in emission tomography,” IEEE Trans. Medical Imaging, vol. 8, no. 2, pp. 186–193, June 1989.
128. D. G. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1969.
129. G. E. Mailloux, F. Langlois, P. Y. Simard, and M. Bertrand, “Restoration of the velocity field of the heart from two- dimensional echograms,” IEEE Trans. Medical Imaging, vol. 8, no. 2, pp. 143–153, June 1989.
130. S. Mallat, “Zero-crossings of a wavelet transform,” IEEE Trans. Informat. Theory, vol. 37, no. 4, pp. 1019–1033, July 1991.
131. S. Mallat and S. Zhong, “Characterization of signals from multiscale edges,” IEEE Trans. Pattern Analysis Machine In-telligence, vol. 14, no. 7, pp. 710–732, July 1992.
132. J. Mandel, “Convergence of the cyclical relaxation method for linear inequalities,” Math. Programming, vol. 30, no. 2, pp. 218–228, 1984.
133. C. P. Mariadassou and B. Yegnanarayana, “Image reconstruction from noisy digital holograms,” IEE Proc.-F, vol. 137, no. 5, pp. 351–356, Oct. 1990.
134. R. J. Marks II, “Class of continuous level associative memory neural nets,” Appl. Optics, vol. 26, no. 10, pp. 2005–2010, May 1987.
135. R. J. Marks II, S. Oh, and L. E. Atlas, “Alternating projection neural networks,” IEEE Trans. Circuits Syst., vol. 36, no. 6, pp. 846–857, June 1989.
136. J. M. Martinez, “Solution of nonlinear systems of equations by an optimal projection method,” Computing, vol. 37, no. 1, pp. 59–70, 1986.
137. W. Menke, “Applications of the POCS inversion method to interpolating topography and other geophysical fields,” Geophysical Res. Letters, vol. 18, no.3, pp. 435–438, Mar. 1991.
138. M. Milanese and G. Belaforte, “Estimation theory and uncertainty intervals evaluation in the presence of unknown but bounded errors: Linear families of models and estimators,” IEEE Trans. Automat. Contr., vol. 27, no. 2, pp. 408–414, Apr. 1982.
139. W. D. Montgomery, “Optical applications of Von Neumann’s alternating-projection theorem,” Optics Letters, vol. 7, no. 1, pp. 1–3, Jan 1982.
140. D. R. Morrell and W. C. Stirling, “Set-valued filtering and smoothing,” IEEE Trans. Systems, Man, Cybernet., vol. 21, no. 1, pp. 184–193, Jan. 1991.
141. T. S. Motzkin and I. J. Schoenberg, “The relaxation method for linear inequalities,” Canadian J. Math., vol. 6, no. 3, pp. 393–404, 1954.
142. K. M. Nashold and B. E. A. Saleh, “Image construction through diffraction-limited high-contrast imaging systems: An iterative approach,” J. Optical Soc. America A, vol. 2, no. 5, pp. 635–643, May 1985.
143. R. A. Nobakht, M. R. Civanlar, and S. H. Ardalan, “Comments on ‘Design of a class of time-constrained FIR digital filters by successive projections’,” IEEE Trans. Circuits Syst., vol. 37, no. 12, 1581, Dec. 1990.
144. J. P. Norton, “Identification and application of bounded-parameter models,” Automatica, vol. 23, no. 4, pp. 497–507, July 1987.
145. P. Oskoui-Fard and H. Stark, “Tomographic image reconstruction using the theory of convex projections,” IEEE Trans. Medical vol. 7, no. 1, 45–58, Mar. 1988.
146. P. Oskoui-Fard and H. Stark, “A comparative study of three reconstruction methods for a limited-view computer tomography problem,” IEEE Trans. Medical Imaging, vol. 8, no. 1, pp. 43–49, Mar. 1989.
147. N. Ottavy, “Strong convergence of projection-like methods in Hilbert spaces,” J. Optimiz. Theory Applications, vol. 56, no. 3, pp. 433–461, Mar. 1988.
148. R. D. Palmer, J. R. Cruz, and D. S. Zmic, “Enhanced autoregressive moving average spectral estimation applied to the measurement of Doppler spectral width,” IEEE Trans. Geosci. Remote Sensing, vol. 29, no. 3, pp. 358–368, May 1991.
149. A. Papoulis, “A new algorithm in spectral analysis and bandlimited extrapolation,” IEEE Trans. Circuits Syst., vol. 22, no. 9, pp. 735–742, Sept. 1975.
150. R. K. Pearson, “Block-sequential algorithms for set-theoretic estimation,” SIAM J. Matrix Analysis Applications, vol. 9, no. 4, pp. 513–527, Oct. 1988.
151. S. C. Pei and I.I. Yang, “Design of a class of time-constrained FIR digital filters by successive projections,” IEEE Trans. Circuits Syst., vol. 36, no. 1, pp. 164–167, Jan. 1989.
152. B. Picinbono and M. Bouvet, “Constrained Wiener filtering,” IEEE Trans. Informat. Theory, vol. 33, no. 1, pp. 160–166, Jan. 1987.
153. G. Pierra, “Eclatement de contraintes en parallele pour la minimisation d’une forme quadratique,” Lecture Notes Computer Sci., vol. 41, pp. 200–218, 1976.
154. G. Pierra, “Decomposition through formalization in a product space,” Math. Programming, vol. 28, no. 1, pp. 96–115, Jan. 1984.
155. H. Piet-Lahanier and E. Walter, “Characterization of non-connected parameter uncertainty regions,” Math. Computers in Simulation, vol. 32, no. 5–6, pp. 553–560, Dec. 1990.
156. G. T. Poulton, “Antenna power pattern synthesis using method of successive projections,” Electronics Letters, vol. 22, no. 20, pp. 1042–1043, Sept. 1986.
157. G. T. Poulton and S. G. Hay, “Efficient design of shaped reflectors using successive projections,” Electronics Letters, vol. 27, no. 23, pp. 2156–2158, Nov. 1991.
158. R. Rangayyan, A. P. Dhawan, and R. Gordon, “Algorithms for limited-view computed tomography: An annoted bibliography and a challenge,” Appl. Optics, vol. 24, no. 23, pp. 4000–4012, Dec. 1985.
159. A. K. Rao, Y. F. Huang, and S. Dasgupta, “ARMA parameter estimation using a novel recursive estimation algorithm with selective updating,” IEEE Trans. Acoustics, Speech, Signal Process., vol. 38, no. 3, pp. 447–457, Mar. 1990.
160. S. Reich, “A limit theorem for projections,” Linear Multilinear Algebra, vol. 13, no. 3, pp. 281–290, 1983.
161. J. Rosen and J. Shamir, “Application of the projection onto constraint sets algorithm for optical pattern recognition,” Optics Letters, vol. 16, no. 10, pp. 752–754, May 1991.
162. T. J. Rothenberg, Efficient Estimation with a Priori Information. New Haven: Yale University Press, 1973.
163. H. A. Sabbagh, L. D. Sabbagh, and T. M. Roberts, “An eddy-current model and algorithm for three-dimensional nondestructive evaluation of advanced composites,” IEEE Trans. Magnetics, vol. 24, no. 6, pp. 3201–3212, Nov. 1988.
164. B. E. A. Saleh and K. M. Nashold, “Image construction: Optimum amplitude and phase masks in photolitography,” Appl. Optics, vol. 24, no. 10, 1432–1437, 1985.
165. P. Santago and S. A. Rajala, “Using convex set techniques for combined pixel and frequency domain coding of time-varying images,” IEEE J. Selected Areas Commun., vol. 5, no. 7, pp. 1127–1139, Aug. 1987.
166. O. Sasaki and T. Yamagami, “Image restoration in singular vector space by the method of convex projections,” Appl. Optics, vol. 26, no. 7, 1216–1221, Apr. 1987.
167. K. D. Sauer and J. P. Allebach, “Iterative reconstruction of band-limited images from nonuniformly spaced samples,” IEEE Trans. Circuits Syst., vol. 34, no. 12, pp. 1497–1506, Dec. 1987.
168. L. J. Savage, The Foundations of Statistics, second ed. New York: Dover, 1972.
169. F. M. Schlaepfer and F. C. Schweppe, “Continuous-time state estimation under disturbances bounded by convex sets,” IEEE Trans. Automat. Contr., vol. 17, no. 2, 197–205, Apr. 1972.
170. R. O. Schmidt, “Multiple emitter location and signal parameter estimation,” IEEE Trans. Antennas Propagat., vol. 34, no. 3, pp. 276–280, Mar. 1986.
171. I. E. Schochetman and R. L. Smith, “Convergence of best approximations from unbounded sets,” J. Math. Analysis Ap-plications, vol. 166, no. 1, pp. 112–128, May 1992.
172. H. A. Schwarz, “Grenzubergang durch altemirendes Verfahren,” 1870; reprinted in Gesammelte Mathematische Abhandlungen. Berlin: Springer-Verlag, vol. 2, 1890, pp. 133–143.
173. L. Schwartz, Analyse—Topologie Gȳnȳrale et Analyse Fonction-nelle, second edition. Paris: Hermann, 1980.
174. F. C. Schweppe, “Recursive state estimation: Unknown but bounded errors and system inputs,” IEEE Trans. Automat. Contr., vol. 13, no. 1, pp. 22–28, Feb. 1968.
175. F. C. Schweppe, Uncertain Dynamic Systems. Englewood Cliffs, NJ: Prentice-Hall, 1973.
176. F. C. Schweppe and H. K. Knudsen, “The theory of amorphous cloud trajectory prediction,” IEEE Trans. Informat. Theory, vol. 14, no. 3, pp. 415–427, May 1968.
177. M. I. Sezan and H. Stark, “Image restoration by the method of convex projections: Part 2—Applications and numerical results,” IEEE Trans. Medical Imaging, vol. 1, no. 2, pp. 95–101, Oct. 1982.
178. M. I. Sezan and H. Stark, “Image restoration by convex projections in the presence of noise,” Appl. Optics, vol. 22, no. 18, pp. 2781–2789, Sept. 1983.
179. M. I. Sezan and H. Stark, “Tomographic image reconstruction from incomplete view data by convex projections and direct Fourier inversion,” IEEE Trans. Medical Imaging, vol. 3, no. 2, pp. 91–98, June 1984.
180. M. I. Sezan and H. Stark, “Incorporation of a priori moment information into signal recovery and synthesis problems,” J. Math. Analysis Applications, vol. 122, no. 1, pp. 172–186, Feb. 1987.
181. M. I. Sezan, H. Stark, and S. J. Yeh, “Projection method formulations of Hopfield-type associative memory neural networks,” Appl. Optics, vol. 29, no. 17, pp. 2616–2622, June 1990.
182. M. I. Sezan and A. M. Tekalp, “Adaptive image restoration with artifact suppression using the theory of convex projections,” IEEE Trans. Acoust., Speech, Signal Process., vol. 38, no. 1, pp. 181–185, Jan. 1990.
183. M. I. Sezan and A. M. Tekalp, “Survey of recent developments in digital image restoration,” Optical Eng., vol. 29, no. 5, pp. 393–404, May 1990.
184. M. I. Sezan and H. J. Trussell, “Prototype image constraints for set-theoretic image restoration,” IEEE Trans. Signal Process., vol. 39, no. 10, pp. 2275–2285, Oct. 1991.
185. P. Y. Simard and G. E. Mailloux, “A projection operator for the restoration of divergence-free vector fields,” IEEE Trans. Pattern Analysis Machine Intelligence, vol. 10, no. 2, pp. 248–256, Mar. 1988.
186. P. Y. Simard and G. E. Mailloux, “Vector field restoration by the method of convex projections,” Comput. Vision, Graphics, Image Process., vol. 52, no. 3, pp. 360–385, Dec. 1990.
187. H. Stark (Editor), Image Recovery: Theory and Application. San Diego, CA: Academic, 1987.
188. H. Stark, D. Cahana, and H. Webb, “Restoration of arbitrary finite energy optical objects from limited spatial and spectral information,” J. Optical Soc. America A, vol. 71, no. 6, pp. 635–642, June 1981.
189. H. Stark, W. C. Catino, and J. L. LoCicero, “Design of phase gratings by generalized projections,” J. Optical Soc. America A, vol. 8, no. 3, 566–571, Mar. 1991.
190. H. Stark and E. T. Olsen, “Projection-based image restoration,” J. Optical Soc. America A, vol. 9, no. 11, pp. 1914–1919, Nov. 1992.
191. H. Stark and P. Oskoui, “High-resolution image recovery from image-plane arrays, using convex projections,” J. Optical Soc. America A, vol. 6, no. 11, pp. 1715–1726, Nov. 1989.
192. W. J. Stiles, “Closest point maps and their product II,” Nieuw Archief voor Wiskunde, vol. 13, no. 3, 212–225, Nov. 1965.
193. W. C. Stirling and D. R. Morrell, “Convex Bayes decision theory,” IEEE Trans. Systems, Man, Cybernetics, vol. 21, no. I, pp. 173–183, Jan. 1991.
194. B. J. Sullivan and A. Katsaggelos, “New termination rule for linear iterative image restoration algorithms,” Optical Eng., vol. 29, no. 5, pp. 471–477, May 1990.
195. K. Tanabe, “Projection method for solving a singular system of linear equations and its applications,” Numerische Mathematik, vol. 17, no. 3, pp. 203–214, 1971.
196. A. M. Tekalp and H. J. Trussell, “Comparative study of some statistical and set-theoretic methods for image restoration,” CVGIP: Graphical Models Image Processing, vol. 53, no. 2, pp. 108–120, Mar. 1991.
197. R. Tempo, “Robust estimation and filtering in the presence of bounded noise,” IEEE Trans. Automat. Contr., vol. 33, no. 9, pp. 864–867, Sept. 1988.
198. N. T. Thao and M. Vetterli, “Optimal MSE signal reconstruction in oversampled A/D conversion using convexity,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., San Francisco, CA, vol. 4, Mar. 23–26, 1992, pp. 165–168.
199. H. J. Trussell, “Convergence criteria for iterative restoration methods,” IEEE Trans. Acoust., Speech, Signal Process., vol. 31, no. 1, pp. 129–136, Feb. 1983.
200. H. J. Trussell, “Application of set theoretic methods to color systems,” Color Res. Applications, vol. 16, no. 1, pp. 31–41, Feb. 1991.
201. H. J. Trussell and M. R. Civanlar, “The feasible solution in signal restoration,” IEEE Trans. Acoust., Speech, Signal Process., vol. 32, no. 2, pp. 201–212, Apr. 1984.
202. H. J. Trussell and M. R. Civanlar, “The Landweber iteration and projection onto convex sets,” IEEE Trans. Acoust., Speech, Signal Process., vol. 33, no. 6, pp. 1632–1634, Dec. 1985.
203. H. J. Trussell H. Orun-Ozturk, and M. R. Civanlar, “Errors in reprojection methods in computerized tomography,” IEEE Trans. Medical Imaging, vol. 6, no. 3, pp. 220–227, Sept. 1987.
204. H. J. Trussell and P. L. Vora, “Bounds on restoration quality using a priori information,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., New York, NY, Apr. 11–14, 1988, pp. 1758–1761.
205. E. Veklerov and J. Llacer, “Stopping rule for the MLE algorithm based on statistical hypothesis testing,” IEEE Trans. Medical Imaging, vol. 6, no. 4, pp. 313–319, Dec. 1987.
206. J. Von Neumann, “On rings of operators. Reduction theory,” Annals Math., vol. 50, no. 2, 401-485, Apr. 1949.
207. E. Walter (Guest Editor), “Parameter identifications with error bounds,” Math. Comp. Simulation, vol. 32, no. 5–6, Dec. 1990.
208. E. Walter and H. Piet-Lahanier, “Exact recursive polyhedral description of the feasible parameter set for bounded-error models,” IEEE Trans. Automat. Contr., vol. 34, no. 8, pp. 911–915, Aug. 1989.
209. M. N. Wemick and C. T. Chen, “Superresolved tomography by convex projections and detector motion,” J. Optical Soc. America A, vol. 9, no. 9, pp. 1547–1553, Sept. 1992.
210. N. Wiener, “On the factorization of matrices,” Commentarii Mathematici Helvetici, vol. 29, pp. 97 111, 1955.
211. L. B. White, “Signal synthesis from Cohen’s class of bilinear time-frequency representations using convex projections,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Toronto, Canada, May 14–17, 1991, pp. 2053–2056.
212. L. B. White, “The wide-band ambiguity function and Altes’ Q-distribution: Constrained synthesis and time-scale filtering,” IEEE Trans. Informat. Theory, vol. 38, no. 2, pp. 886–892, Mar. 1992.
213. H. S. Witsenhausen, “Sets of possible states of linear systems given perturbed observations,” IEEE Trans. Automat. Contr., vol. 13, no. 5, pp. 556–558, Oct. 1968.
214. P. Wolfe, “Finding the nearest point in a polytope,” Math. Programming, vol. 11, no. 2, pp. 128–149, Oct. 1976.
215. J K. Yang and K. G. Murty, “New iterative methods for linear inequalities,” J. Optimiz. Theory Applications, vol. 72, no. 1, pp. 163–185, Jan. 1992.
216. X. Yang, K. Wang, and S. A. Shamma, “Auditory representations of acoustic signals,” IEEE Trans. Informat. Theory, vol. 38, no. 2, pp. 824–839, Mar. 1992.
217. S. J. Yeh and H. Stark, “Iterative and one-step reconstruction from nonuniform samples by convex projections,” J. Optical Soc. America A, vol. 7, no. 3, pp. 491–499, Mar. 1990.
218. K. Yosida, Functional Analysis, sixth edition. New York: Springer-Verlag, 1980.
219. D. C. Youla, “Generalized image restoration by the method of alternating orthogonal projections,” IEEE Trans. Circuits Syst., vol. 25, no. 9, pp. 694–702, Sept. 1978.
220. D. C. Youla and V. Velasco, “Extensions of a result on the synthesis of signals in the presence of inconsistent constraints,” IEEE Trans. Circuits Svst., vol. 33, no. 4, pp. 465–468, Apr. 1986.
221. D. C. Youla and H. Webb, “Image restoration by the method of convex projections: Part 1—Theory,” IEEE Trans. Medical Imaging, vol. 1, no. 2, pp. 81–94, Oct. 1982.
222. L. A. Zadeh, “What is optimal?,” IRE Trans. Informat. Theory, vol. 4, no. 1, p. 3, Mar. 1958.
223. A. Zakhor and A. V. Oppenheim, “Reconstruction of two-dimensional signals from level crossings,” Proc. IEEE, vol. 78, no. 1, pp. 31–55, Jan. 1990.