Hybrid phase retrieval algorithm based on modified very fast simulated annealing

被引:4
|
作者
Xu, Yueshu [1 ]
Ye, Qian [1 ]
Meng, Guoxiang [1 ]
机构
[1] Shanghai Jiao Tong Univ, 800 Dongchuan Rd, Shanghai, Peoples R China
关键词
Antenna design; EM field theory; modelling and measurements; phase reconstruction; LARGE REFLECTOR ANTENNAS; HOLOGRAPHY;
D O I
10.1017/S1759078718000971
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The Misell algorithm is one of the most widely used phase retrieval holography methods for large reflector antennas to measure surface deformation. However, it usually locks in a local minimum because it heads downhill from an initial estimation without any consideration whether it heads for a global minimum or not. The core problem of the Misell algorithm is to find an initial estimation near the global minimum to avoid local stagnation. To cope with the problem, we construct a hybrid Misell algorithm, named modified very fast simulated annealing (MVFSA)-Misell algorithm, to search for the global minimum with a high efficiency. The algorithm is based on the combination of the MVFSA algorithm and Misell algorithm. Firstly, the MVFSA is utilized to obtain a rough position near the global minimum in limited steps. Then, the Misell algorithm starts from the rough position to converge to the global minimum with high speed and accuracy. The convergence characteristic of the proposed algorithm was discussed in detail through digital simulation. Simulation results show that the algorithm can reach global minimum in a very short time. Unlike the traditional Misell algorithm, the hybrid algorithm is not influenced by initial phase estimation.
引用
收藏
页码:1072 / 1080
页数:9
相关论文
共 50 条
  • [1] A Modified Very Fast Simulated Annealing Algorithm
    Vakil-Baghmisheh, Mohammad-Taghi
    Navarbaf, Afireza
    2008 INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS, VOLS 1 AND 2, 2008, : 61 - 66
  • [2] PERFORMANCE OF A SIMULATED-ANNEALING ALGORITHM FOR PHASE RETRIEVAL
    NIETOVESPERINAS, M
    NAVARRO, R
    FUENTES, FJ
    JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION, 1988, 5 (01): : 30 - 38
  • [3] Simulated annealing applied to the Misell algorithm for phase retrieval
    Morris, D
    IEE PROCEEDINGS-MICROWAVES ANTENNAS AND PROPAGATION, 1996, 143 (04) : 298 - 303
  • [4] A FAST ALGORITHM FOR SIMULATED ANNEALING
    HONG, G
    ZUCKERMANN, M
    HARRIS, R
    GRANT, M
    PHYSICA SCRIPTA, 1991, T38 : 40 - 44
  • [5] Fast image restoration algorithm based on simulated annealing
    Chen, Yen-Wei
    Enokura, Tatsuro
    Nakao, Zensho
    International Conference on Knowledge-Based Intelligent Electronic Systems, Proceedings, KES, 1999, : 341 - 344
  • [6] A fast kinoform optimization algorithm based on simulated annealing
    Chen, YW
    Yamauchi, S
    Wang, N
    Nakao, Z
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (04) : 774 - 776
  • [7] Phase unwrapping algorithm based on simulated annealing
    Peng, Zhenjun
    Wang, Xiangzhao
    Qian, Feng
    Wang, Xuefeng
    Zhong, Xianghong
    Wang, Xiangchao
    Guangxue Xuebao/Acta Optica Sinica, 2003, 23 (07): : 845 - 849
  • [8] Modified simulated annealing algorithm for poly phase code design
    Singh, S. P.
    Rao, K. Subba
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS, VOLS 1-7, 2006, : 2966 - +
  • [9] A Very Fast Simulated Re-Annealing Algorithm for the Automotive Trim Industry
    Zhang Yuping
    Deng Zhaori
    Zhang Ruiqi
    2013 THIRD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEM DESIGN AND ENGINEERING APPLICATIONS (ISDEA), 2013, : 209 - 212
  • [10] A very fast simulated re-annealing algorithm for the leather nesting problem
    Yuping, Z
    Shouwei, J
    Chunli, Z
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2005, 25 (11-12): : 1113 - 1118