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
    Figures & Tables(14)
    Traditional exposure mode. (a) Imaging exposure model; (b) Fourier transform amplitude curve
    Coded exposure mode. (a) Coded exposure imaging model; (b) Fourier transform amplitude curve
    Searching method for optimal code sequence of coded exposure based on Memetic algorithm
    Comparison of frequency amplitude curves for code sequence of 32 bits
    Comparison of frequency amplitude curves for code sequence of 52 bits
    Comparison of frequency amplitude curves for code sequence of 112 bits
    Simulated blurred images and deblurring results for image “Target” with code sequence of 32 bits. (a) Traditional exposure mode; (b) coded exposure mode plus genetic search method; (c) coded exposure mode plus Memetic searching method
    Simulated blurred images and deblurring results for image “Target” with code sequence of 32 bits. (a) Traditional exposure mode; (b) coded exposure mode plus genetic search method; (c) coded exposure mode plus Memetic searching method
    Simulated blurred images and deblurring results for image “Cameraman” with code sequence of 32 bits. (a)Traditional exposure mode; (b) coded exposure mode plus genetic search method; (c) coded exposure mode plus Memetic searching method
    Simulated blurred images and deblurring results for image “Cameraman” with code sequence of 52 bits. (a) Traditional exposure mode; (b) coded exposure mode plus genetic search method; (c) coded exposure mode plus Memetic searching method
    • Table 1. Objective evaluation results of frequency amplitude curves for code sequence

      View table

      Table 1. Objective evaluation results of frequency amplitude curves for code sequence

      Code sequence lengthEvaluate indexGenetic search methodProposed method
      32MIN0.260.85
      VAR6.073.62
      52MIN0.350.46
      VAR9.175.39
      112MIN0.390.44
      VAR24.7219.55
    • Table 2. Execution time of searching methods for optimal code sequences

      View table

      Table 2. Execution time of searching methods for optimal code sequences

      Code sequence lengthExhaustion methodGenetic search methodProposed method
      32~1.491´1054.0353.862
      52~1.262´10117.2645.678
      112~1.455´102922.04314.768
    • Table 3. Objective evaluation results of simulated deblurring images for image “Target”

      View table

      Table 3. Objective evaluation results of simulated deblurring images for image “Target”

      Code sequence lengthPSF lengthEvaluateindexTraditional exposure methodCoded exposure by genetic search methodCoded exposure by proposed method
      327SNR15.431027.665136.6306
      SSIM0.83520.97790.9914
      5211SNR14.606531.655836.4372
      SSIM0.80830.98520.9904
    • Table 4. Objective evaluation results of simulated deblurring images for image “Cameraman”

      View table

      Table 4. Objective evaluation results of simulated deblurring images for image “Cameraman”

      Code sequence lengthPSF lengthEvaluateindexTraditional exposure methodCoded exposure by genetic search methodCoded exposure by proposed method
      327SNR10.490029.523332.5042
      SSIM0.24750.93760.9633
      5211SNR7.814427.426232.2805
      SSIM0.15470.92450.9621
    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