The Use of Bivariate Polynomial Factorization Algorithms in Two-dimensional Phase Problems
- 1 June 1985
- journal article
- research article
- Published by Taylor & Francis in Optica Acta: International Journal of Optics
- Vol. 32 (6), 689-701
- https://doi.org/10.1080/713821772
Abstract
In this paper is demonstrated the possibility of using a bivariate factorization algorithm in phase retrieval when a finite degree polynomial model is adopted to describe the (at least twice over-sampled) intensity function.Keywords
This publication has 10 references indexed in Scilit:
- The Essential Role of Prior Knowledge in Phase RetrievalOptica Acta: International Journal of Optics, 1984
- The Phase Retrieval ProblemPublished by SPIE-Intl Soc Optical Eng ,1983
- Phase Ambiguities In More Than One DimensionPublished by SPIE-Intl Soc Optical Eng ,1983
- Enforcing irreducibility for phase retrieval in two dimensionsOptics Letters, 1983
- Phase retrieval algorithms: a comparisonApplied Optics, 1982
- Reducible polynomials in more than one variableProceedings of the IEEE, 1982
- On the ambiguity of the image reconstruction problemOptics Communications, 1979
- The Chinese Remainder TheoremPublished by Springer Nature ,1979
- Source reconstruction from the modulus of the correlation function: a practical approach to the phase problem of optical coherence theory*Journal of the Optical Society of America, 1973
- Factoring Polynomials Over Finite FieldsBell System Technical Journal, 1967