{"title":"基于分层/精细反卷积的相位检索","authors":"J. H. Seldin, J. Fienup","doi":"10.1364/srs.1989.fa3","DOIUrl":null,"url":null,"abstract":"An iterative algorithm developed by Ayers and Dainty [1] for the blind deconvolution of two functions is applied to the problem of phase retrieval. Because its structure closely resembles that of the Error Reduction (ER) algorithm commonly used for phase retrieval [2-4], the performance of the Ayers/Dainty (AD) algorithm is compared with that of ER. Both of these algorithms are compared to the faster hybrid input-output (HIO) algorithm [2-4] for the cases of real, nonnegative objects with known and unknown support using Fourier intensity data with different levels of additive Gaussian noise.","PeriodicalId":193110,"journal":{"name":"Signal Recovery and Synthesis III","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Phase Retrieval Using Ayers/Dainty Deconvolution\",\"authors\":\"J. H. Seldin, J. Fienup\",\"doi\":\"10.1364/srs.1989.fa3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An iterative algorithm developed by Ayers and Dainty [1] for the blind deconvolution of two functions is applied to the problem of phase retrieval. Because its structure closely resembles that of the Error Reduction (ER) algorithm commonly used for phase retrieval [2-4], the performance of the Ayers/Dainty (AD) algorithm is compared with that of ER. Both of these algorithms are compared to the faster hybrid input-output (HIO) algorithm [2-4] for the cases of real, nonnegative objects with known and unknown support using Fourier intensity data with different levels of additive Gaussian noise.\",\"PeriodicalId\":193110,\"journal\":{\"name\":\"Signal Recovery and Synthesis III\",\"volume\":\"15 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.fa3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Signal Recovery and Synthesis III","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/srs.1989.fa3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An iterative algorithm developed by Ayers and Dainty [1] for the blind deconvolution of two functions is applied to the problem of phase retrieval. Because its structure closely resembles that of the Error Reduction (ER) algorithm commonly used for phase retrieval [2-4], the performance of the Ayers/Dainty (AD) algorithm is compared with that of ER. Both of these algorithms are compared to the faster hybrid input-output (HIO) algorithm [2-4] for the cases of real, nonnegative objects with known and unknown support using Fourier intensity data with different levels of additive Gaussian noise.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
