M. Nieto-Vesperinas, M. J. Pérez-Ilzarbe, R. Navarro
{"title":"Object reconstruction from experimental far-field data using phase retrieval algorithms","authors":"M. Nieto-Vesperinas, M. J. Pérez-Ilzarbe, R. Navarro","doi":"10.1364/srs.1989.fb4","DOIUrl":null,"url":null,"abstract":"Recently a Simulated Annealing (S.A.) algorithm has been put forward [1] for phase retrieval from the power spectrum of a real and positive object. This method has been succesfully used in computer simulations, of object reconstruction, with different signal to noise ratios [2] and also of photon-limited stellar speckle interferometry [3]. The algorithm is flexible and permits an easy introduction of additional constraints. Its performance is uniformly high. However, it requires a rather lengthy computing time. In some cases, it can be accelerated by using first the hybrid input-output version of the iterative Fourier trasform (I.F.T.) algorithm [4-6].","PeriodicalId":193110,"journal":{"name":"Signal Recovery and Synthesis III","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Signal Recovery and Synthesis III","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/srs.1989.fb4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Recently a Simulated Annealing (S.A.) algorithm has been put forward [1] for phase retrieval from the power spectrum of a real and positive object. This method has been succesfully used in computer simulations, of object reconstruction, with different signal to noise ratios [2] and also of photon-limited stellar speckle interferometry [3]. The algorithm is flexible and permits an easy introduction of additional constraints. Its performance is uniformly high. However, it requires a rather lengthy computing time. In some cases, it can be accelerated by using first the hybrid input-output version of the iterative Fourier trasform (I.F.T.) algorithm [4-6].