Please use this identifier to cite or link to this item:
|Title:||Optical image encryption via high-quality computational ghost imaging using iterative phase retrieval||Authors:||Asundi, Anand Krishna
Optical Security and Encryption
|Issue Date:||2018||Source:||Sui, L., Cheng, Y., Li, B., Tian, A., & Asundi, A. K. (2018). Optical image encryption via high-quality computational ghost imaging using iterative phase retrieval. Laser Physics Letters, 15(7), 075204-. doi:10.1088/1612-202X/aac002||Series/Report no.:||Laser Physics Letters||Abstract:||A novel computational ghost imaging scheme based on specially designed phase-only masks, which can be efficiently applied to encrypt an original image into a series of measured intensities, is proposed in this paper. First, a Hadamard matrix with a certain order is generated, where the number of elements in each row is equal to the size of the original image to be encrypted. Each row of the matrix is rearranged into the corresponding 2D pattern. Then, each pattern is encoded into the phase-only masks by making use of an iterative phase retrieval algorithm. These specially designed masks can be wholly or partially used in the process of computational ghost imaging to reconstruct the original information with high quality. When a significantly small number of phase-only masks are used to record the measured intensities in a single-pixel bucket detector, the information can be authenticated without clear visualization by calculating the nonlinear correlation map between the original image and its reconstruction. The results illustrate the feasibility and effectiveness of the proposed computational ghost imaging mechanism, which will provide an effective alternative for enriching the related research on the computational ghost imaging technique.||URI:||https://hdl.handle.net/10356/87106
|ISSN:||1612-2011||DOI:||10.1088/1612-202X/aac002||Rights:||© 2018 Astro Ltd (published by IOP Publishing). Original content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||MAE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.