Signal reconstruction from given phase of the Fourier transform using Fejér monotone methods
Dieter Schott
Discussiones Mathematicae, Differential Inclusions, Control and Optimization, Tome 20 (2000), p. 27-40 / Harvested from The Polish Digital Mathematics Library

The aim is to reconstruct a signal function x ∈ L₂ if the phase of the Fourier transform [x̂] and some additional a-priori information of convex type are known. The problem can be described as a convex feasibility problem. We solve this problem by different Fejér monotone iterative methods comparing the results and discussing the choice of relaxation parameters. Since the a-priori information is partly related to the spectral space the Fourier transform and its inverse have to be applied in each iterative step numerically realized by FFT techniques. The computation uses MATLAB routines.

Publié le : 2000-01-01
EUDML-ID : urn:eudml:doc:271532
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1002,
     author = {Dieter Schott},
     title = {Signal reconstruction from given phase of the Fourier transform using Fej\'er monotone methods},
     journal = {Discussiones Mathematicae, Differential Inclusions, Control and Optimization},
     volume = {20},
     year = {2000},
     pages = {27-40},
     zbl = {1013.94512},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1002}
}
Dieter Schott. Signal reconstruction from given phase of the Fourier transform using Fejér monotone methods. Discussiones Mathematicae, Differential Inclusions, Control and Optimization, Tome 20 (2000) pp. 27-40. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1002/

[000] [1] H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996), 367-426. | Zbl 0865.47039

[001] [2] P.L. Combettes, Fejér-monotonicity in convex optimization, in: C.A. Floudas and P.M. Pardalos (eds.), Encyclopedia of Optimization, Kluwer Acad. Publ., Dordrecht 2000.

[002] [3] L.G. Gubin, B.T. Polyak and E.V. Raik, The method of projections for finding the common point of convex sets, USSR Comput. Math. Math. Phys. 7 (1967), 1-24.

[003] [4] M.H. Hayes, J.S. Lim and A.V. Oppenheim, Signal reconstruction from phase or magnitude, IEEE Trans. Acoust. Speech and Signal Process. ASSP-28 (1980), 672-680. | Zbl 0521.94004

[004] [5] M.H. Hayes, The reconstruction of a multidimensional sequence from the phase or magnitude of its Fourier transform, IEEE Trans. Acoust. Speech and Signal Process. ASSP-30 (1982), 140-154. | Zbl 0563.65084

[005] [6] A. Levi and H. Stark, Restoration from Phase and Magnitude by Generalized Projections, in: [] , Chapter 8, 277-320.

[006] [7] D. Schott, Iterative solution of convex problems by Fejér monotone methods, Numer. Funct. Anal. Optimiz. 16 (1995), 1323-1357. | Zbl 0853.65055

[007] [8] D. Schott, Basic properties of Fejér monotone mappings, Rostock. Math. Kolloq. 50 (1997), 71-84. | Zbl 0905.65068

[008] [9] D. Schott, Weak convergence of iterative methods generated by strongly Fejér monotone methods, Rostock. Math. Kolloq. 51 (1997), 83-96. | Zbl 0890.65055

[009] [10] D. Schott, About strongly Fejér monotone mappings and their relaxations, Zeitschr. Anal. Anw. 16 (1997), 709-726. | Zbl 0882.65043

[010] [11] H. Stark (ed.), Image recovery: Theory and applications, Academic Press, New York 1987.

[011] [12] D.C. Youla, Mathematical Theory of Image Restoration by the Method of Convex Projections, in: [11], Chapter 2, 29-76.