Algorithms for the Phase Retrieval Problem: an automatic Way to Overcome Stagnation

N. Cohen, Á. D. De Pierro, Clarice Favaretto Salvador
{"title":"Algorithms for the Phase Retrieval Problem: an automatic Way to Overcome Stagnation","authors":"N. Cohen, Á. D. De Pierro, Clarice Favaretto Salvador","doi":"10.1364/srs.1998.stuc.4","DOIUrl":null,"url":null,"abstract":"This work is concerned with the Phase Retrieval (PR) problem [3]. In its general formulation, the PR problem consists of retrieving the Fourier phase for a signal f whose Fourier transform F is known only in magnitude. In the applications, some additional information on f is available, e.g. the magnitude |f|. We shall be interested in the 2-D case where the additional information is the nonnegativity of f and the autocorrelation support. Iterative algorithms are commonly used to solve this problem [4]. Whereas these algorithms are the most successful in the applications, they do not enjoy ensured convergence, and often do not converge to a solution. Quite often they wind up either oscillating between two non-solutions, or converging very slowly towards a non- solution. In [2] a geometric characterization of the solution set is presented as well as experimental results suggesting an automatic way to avoid stagnation in the context of the retrieval algorithms mentioned above. For concreteness, let us consider the Error Reduction (ER) method. We observe that oscillations for the ER always occur between one fixed toroid [2] and the nonnegative orthant. The point x′ of stagnation on the toroid is external to the (convex) orthant. It is reasonable, as a means to avoid stagnation, to move from x′ to the point x” on the toroid which is “antipodal” to x′, thereby (roughly speaking) overrelaxing the operation of (convex) projection onto the orthant. More precisely, let c be the center of the toroid in question. It has been observed before [2] that c is in the positive orthant. We set x” = 2c − x′. We then use x” as an initial value for the ER algorithm. To summarize, we propose the following method : suppose that the algorithm stagnated in an image g\n k\n , that has a projection \ng\n k\n ′ onto the toroids set; then we get a new initial estimate for the algorithm by setting \ng\n o\n =−g\n k\n ′+2c with c representing the center of the toroid. This new starting point automatically satisfies the Fourier magnitude constraints, but not necessarily the positivity constraint, unless it happens to be a solution. In principle, the new initial point may lead to a renewed stagnation. However, in practice the phase retrieval improves considerably from one stagnation to another, leading to a good approximate solution. We have performed numerous experiments, using the ER algorithm with this stagnation breaker, and in all the cases it was not necessary to repeat the stagnation breaker more than twice per example. One advantage of the suggested method is that it is automatic, i.e. there is no need to identify on-line the stagnation type. A typical experiment using our new method is shown below. Two overrelaxations were necessary in this case, in order to obtain an acceptable approximation to the solution. The starting image that begins the process was taken random. Figure 1 is the image to be retrieved, Figure 2, the result after 100 iterations of ER.","PeriodicalId":184407,"journal":{"name":"Signal Recovery and Synthesis","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Signal Recovery and Synthesis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/srs.1998.stuc.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This work is concerned with the Phase Retrieval (PR) problem [3]. In its general formulation, the PR problem consists of retrieving the Fourier phase for a signal f whose Fourier transform F is known only in magnitude. In the applications, some additional information on f is available, e.g. the magnitude |f|. We shall be interested in the 2-D case where the additional information is the nonnegativity of f and the autocorrelation support. Iterative algorithms are commonly used to solve this problem [4]. Whereas these algorithms are the most successful in the applications, they do not enjoy ensured convergence, and often do not converge to a solution. Quite often they wind up either oscillating between two non-solutions, or converging very slowly towards a non- solution. In [2] a geometric characterization of the solution set is presented as well as experimental results suggesting an automatic way to avoid stagnation in the context of the retrieval algorithms mentioned above. For concreteness, let us consider the Error Reduction (ER) method. We observe that oscillations for the ER always occur between one fixed toroid [2] and the nonnegative orthant. The point x′ of stagnation on the toroid is external to the (convex) orthant. It is reasonable, as a means to avoid stagnation, to move from x′ to the point x” on the toroid which is “antipodal” to x′, thereby (roughly speaking) overrelaxing the operation of (convex) projection onto the orthant. More precisely, let c be the center of the toroid in question. It has been observed before [2] that c is in the positive orthant. We set x” = 2c − x′. We then use x” as an initial value for the ER algorithm. To summarize, we propose the following method : suppose that the algorithm stagnated in an image g k , that has a projection g k ′ onto the toroids set; then we get a new initial estimate for the algorithm by setting g o =−g k ′+2c with c representing the center of the toroid. This new starting point automatically satisfies the Fourier magnitude constraints, but not necessarily the positivity constraint, unless it happens to be a solution. In principle, the new initial point may lead to a renewed stagnation. However, in practice the phase retrieval improves considerably from one stagnation to another, leading to a good approximate solution. We have performed numerous experiments, using the ER algorithm with this stagnation breaker, and in all the cases it was not necessary to repeat the stagnation breaker more than twice per example. One advantage of the suggested method is that it is automatic, i.e. there is no need to identify on-line the stagnation type. A typical experiment using our new method is shown below. Two overrelaxations were necessary in this case, in order to obtain an acceptable approximation to the solution. The starting image that begins the process was taken random. Figure 1 is the image to be retrieved, Figure 2, the result after 100 iterations of ER.
相位恢复问题的算法:一种克服停滞的自动方法
这项工作涉及相位检索(PR)问题[3]。在它的一般公式中,PR问题包括对一个信号f的傅里叶变换f求出傅里叶相位,而这个信号的傅里叶变换f只知道其幅度。在应用中,关于f的一些附加信息是可用的,例如f的幅度。我们将对二维情况感兴趣,其中附加信息是f的非负性和自相关支持。通常采用迭代算法来解决这一问题[4]。虽然这些算法在应用中是最成功的,但它们不能保证收敛,而且通常不能收敛到一个解决方案。它们经常在两个非解之间振荡,或者非常缓慢地向一个非解收敛。在[2]中提出了解集的几何表征以及实验结果,提出了在上述检索算法的背景下避免停滞的自动方法。具体来说,让我们考虑误差减少(ER)方法。我们观察到ER的振荡总是发生在一个固定环面[2]和非负正交面之间。环面上的停滞点x '在(凸)正交线的外部。作为避免停滞的一种手段,从x '移动到与x '“对映”的环面上的点x '是合理的,因此(粗略地说)过度放松(凸)投影到正交面的操作。更准确地说,设c为所讨论的环面中心。之前[2]已经观察到c在正正交上。设x ' = 2c - x '。然后我们使用x '作为ER算法的初始值。综上所述,我们提出以下方法:假设算法停滞在一个图像g k上,该图像在环面集合上有一个投影g k ';然后设go = - g k′+2c, c代表环面中心,得到了新的算法初始估计。这个新的起点自动满足傅里叶幅度约束,但不一定满足正性约束,除非它恰好是一个解。原则上,新的起点可能导致新的停滞。然而,在实践中,相位恢复从一个停滞到另一个停滞有很大的改善,导致一个很好的近似解。我们已经进行了许多实验,使用ER算法和这个停滞断路器,在所有情况下,每个示例都不需要重复两次以上的停滞断路器。所建议的方法的一个优点是它是自动的,即不需要在线识别停滞类型。使用我们的新方法的典型实验如下所示。在这种情况下,为了获得可接受的近似解,需要两次过松弛。开始该过程的起始映像是随机选取的。图1为待检索的图像,图2为ER迭代100次后的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信