OSA's Digital Library

Optics Express

Optics Express

  • Editor: Andrew M. Weiner
  • Vol. 21, Iss. 7 — Apr. 8, 2013
  • pp: 8025–8043

Assessing the performance of a method of simultaneous compression and encryption of multiple images and its resistance against various attacks

A. Alfalou, C. Brosseau, N. Abdallah, and M. Jridi  »View Author Affiliations


Optics Express, Vol. 21, Issue 7, pp. 8025-8043 (2013)
http://dx.doi.org/10.1364/OE.21.008025


View Full Text Article

Enhanced HTML    Acrobat PDF (2888 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

We introduce a double optimization procedure for spectrally multiplexing multiple images. This technique is adapted from a recently proposed optical setup implementing the discrete cosine transformation (DCT). The new analysis technique is a combination of spectral fusion based on the properties of DCT, specific spectral filtering, and quantization of the remaining encoded frequencies using an optimal number of bits. Spectrally multiplexing multiple images defines a first level of encryption. A second level of encryption based on a real key image is used to reinforce encryption. A set of numerical simulations and a comparison with the well known JPEG (Joint Photographic Experts Group) image compression standard have been carried out to demonstrate the improved performances of this method. The focus here will differ from the method of simultaneous fusion, compression, and encryption of multiple images (SFCE) [Opt. Express 19, 24023 (2011)] in the following ways. Firstly, we shall be concerned with optimizing the compression rate by adapting the size of the spectral block to each target image and decreasing the number of bits required to encode each block. This size adaptation is achieved by means of the root-mean-square (RMS) time-frequency criterion. We found that this size adaptation provides a good tradeoff between bandwidth of spectral plane and number of reconstructed output images. Secondly, the encryption rate is improved by using a real biometric key and randomly changing the rotation angle of each block before spectral fusion. By using a real-valued key image we have been able to increase the compression rate of 50% over the original SFCE method. We provide numerical examples of the effects for size, rotation, and shifting of DCT-blocks which play noteworthy roles in the optimization of the bandwidth of the spectral plane. Inspection of the results for different types of attack demonstrates the robustness of our procedure.

© 2013 OSA

OCIS Codes
(070.0070) Fourier optics and signal processing : Fourier optics and signal processing
(100.0100) Image processing : Image processing
(200.4560) Optics in computing : Optical data processing

ToC Category:
Image Processing

History
Original Manuscript: January 8, 2013
Revised Manuscript: February 21, 2013
Manuscript Accepted: February 28, 2013
Published: March 26, 2013

Citation
A. Alfalou, C. Brosseau, N. Abdallah, and M. Jridi, "Assessing the performance of a method of simultaneous compression and encryption of multiple images and its resistance against various attacks," Opt. Express 21, 8025-8043 (2013)
http://www.opticsinfobase.org/oe/abstract.cfm?URI=oe-21-7-8025


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. A. Alfalou and C. Brosseau, “Optical image compression and encryption methods,” Adv. Opt. Photon.1(3), 589 (2009). [CrossRef]
  2. B. Javidi, ed., Optical and Digital Techniques for Information Security (Springer Verlag, New York, 2005).
  3. P. Refregier and B. Javidi, “Optical image encryption based on input plane and Fourier plane random encoding,” Opt. Lett.20(7), 767–769 (1995). [CrossRef] [PubMed]
  4. Y. Frauel, A. Castro, T. J. Naughton, and B. Javidi, “Resistance of the double random phase encryption against various attacks,” Opt. Express15(16), 10253–10265 (2007). [CrossRef] [PubMed]
  5. P. Kumar, J. Joseph, and K. Singh, “Known-plaintext attack-free double random phase-amplitude optical encryption: vulnerability to impulse function attack,” J. Opt.14(4), 045401 (2012). [CrossRef]
  6. J.-J. Huang, H.-E. Hwang, C.-Y. Chen, and C.-M. Chen, “Lensless multiple-image optical encryption based on improved phase retrieval algorithm,” Appl. Opt.51(13), 2388–2394 (2012). [CrossRef] [PubMed]
  7. X. Wang and D. Zhao, “Double images encryption method with resistance against the specific attack based on an asymmetric algorithm,” Opt. Express20(11), 11994–12003 (2012). [CrossRef] [PubMed]
  8. A. Alfalou and A. Mansour, “All optical video-image encryption enforced security level using independent component analysis,” J. Opt. A, Pure Appl. Opt.9, 787 (2007). [CrossRef]
  9. Z. Liu, Q. Guo, L. Xu, M. A. Ahmad, and S. Liu, “Double image encryption by using iterative random binary encoding in gyrator domains,” Opt. Express18(11), 12033–12043 (2010). [CrossRef] [PubMed]
  10. A. Alfalou and C. Brosseau, “Dual encryption scheme of images using polarized light,” Opt. Lett.35(13), 2185–2187 (2010). [CrossRef] [PubMed]
  11. F. Mosso, J. F. Barrera, M. Tebaldi, N. Bolognini, and R. Torroba, “All-optical encrypted movie,” Opt. Express19(6), 5706–5712 (2011). [PubMed]
  12. M. Paturzo, P. Memmolo, L. Miccio, A. Finizio, P. Ferraro, A. Tulino, and B. Javidi, “Numerical multiplexing and demultiplexing of digital holographic information for remote reconstruction in amplitude and phase,” Opt. Lett.33(22), 2629–2631 (2008). [CrossRef] [PubMed]
  13. A. Alfalou and C. Brosseau, “Exploiting root-mean-square time-frequency structure for multiple-image optical compression and encryption,” Opt. Lett.35(11), 1914–1916 (2010). [CrossRef] [PubMed]
  14. E. Darakis and J. J. Soraghan, “Reconstruction domain compression of phase-shifting digital holograms,” Appl. Opt.46(3), 351–356 (2007). [CrossRef] [PubMed]
  15. T. J. Naughton, J. B. McDonald, and B. Javidi, “Efficient compression of fresnel fields for Internet transmission of three-dimensional images,” Appl. Opt.42(23), 4758–4764 (2003). [CrossRef] [PubMed]
  16. T. J. Naughton, Y. Frauel, B. Javidi, and E. Tajahuerce, “Compression of digital holograms for three-dimensional object reconstruction and recognition,” Appl. Opt.41(20), 4124–4132 (2002). [CrossRef] [PubMed]
  17. S. L. Wijaya, M. Savvides, and B. V. K. Vijaya Kumar, “Illumination-tolerant face verification of low-bit-rate JPEG2000 wavelet images with advanced correlation filters for handheld devices,” Appl. Opt.44(5), 655–665 (2005). [CrossRef] [PubMed]
  18. L. Ding, Y. Yan, Q. Xue, and G. Jin, “Wavelet packet compression for volume holographic image recognition,” Opt. Commun.216(1-3), 105–113 (2003). [CrossRef]
  19. S. Yeom, A. Stern, and B. Javidi, “Compression of 3D color integral images,” Opt. Express12(8), 1632–1642 (2004). [CrossRef] [PubMed]
  20. A. Alfalou, C. Brosseau, N. Abdallah, and M. Jridi, “Simultaneous fusion, compression, and encryption of multiple images,” Opt. Express19(24), 24023–24029 (2011). [CrossRef] [PubMed]
  21. M. Johnson, P. Ishwar, V. Prabhakaran, D. Schonberg, and K. Ramchandran, “On compressing encrypted data,” IEEE Trans. Signal Process.52(10), 2992–3006 (2004). [CrossRef]
  22. A. Alfalou, A. Mansour, M. Elbouz, and C. Brosseau, “Optical compression scheme to multiplex & simultaneously encode images”, in Optical and Digital Image Processing Fundamentals and Applications, G. Cristobal (Ed.), P. Schelkens (Ed.), and H. Thienpont (Ed.), (Wiley, 2011) pp. 463–483.
  23. J. Krommweh, “Tetrolet transform: A new adaptive Haar wavelet algorithm for sparse image representation,” J. Vis. Commun. Image R.21(4), 364–374 (2010). [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited