Acta Optica Sinica, Volume. 39, Issue 3, 0311004(2019)

Searching Method for Optimal Code Sequence of Coded Exposure Based on Memetic Algorithm

Guangmang Cui1,2, Kuaikuai Yu2、*, Xiaojie Ye1, Jufeng Zhao1, and Liyao Zhu1
Author Affiliations
  • 1 School of Electronics and Information, Hangzhou Dianzi University, Hangzhou, Zhejiang 310018, China
  • 2 Science and Technology on Electro-Optical Information Security Control Laboratory, Tianjin 300308, China
  • show less

    A searching method for an optimal code sequence of coded exposure is proposed based on the Memetic algorithm. The theoretical model for coded exposure imaging is analyzed and the criteria of fitness function for the optimal codeword selection is established. The Memetic algorithm framework is introduced to carry out the optimal code sequence search, and the genetic search algorithm is utilized to implement the global optimal solution search. On this basis, the simulated annealing algorithm is used to conduct the local optimal solution. The optimal codeword search results are obtained by the threshold constraint of the fitness function and the updated iteration of population and optimal solution. The research results show that, compared with other methods, the proposed algorithm can take into account both the global and the local optimal solutions, the obtained optimal code sequence has a better performance index, the execution efficiency is high, and the restored image has superior subjective and objective evaluation quality.

    Tools

    Get Citation

    Copy Citation Text

    Guangmang Cui, Kuaikuai Yu, Xiaojie Ye, Jufeng Zhao, Liyao Zhu. Searching Method for Optimal Code Sequence of Coded Exposure Based on Memetic Algorithm[J]. Acta Optica Sinica, 2019, 39(3): 0311004

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category: Imaging Systems

    Received: Sep. 11, 2018

    Accepted: Nov. 26, 2018

    Published Online: May. 10, 2019

    The Author Email:

    DOI:10.3788/AOS201939.0311004

    Topics