2014
DOI: 10.1364/ao.53.000g64
|View full text |Cite
|
Sign up to set email alerts
|

Hologram authentication based on a secure watermarking algorithm using cellular automata

Abstract: A secure watermarking algorithm for hologram authentication is presented in this paper. The algorithm exploits the noise-like feature of holograms to randomly embed a watermark in the domain of the discrete cosine transform with marginal degradation in transparency. The pseudo random number (PRN) generators based on a cellular automata algorithm with asymmetrical and nonlocal connections are used for the random hiding. Each client has its own unique PRN generators for enhancing the watermark security. In the p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…The experimental results indicate that a very small amount of bit errors in the hologram can be detected. To enhance the security, the DCT coefficients for watermark embedding are randomly selected by a pseudo random number (PRN) generator based on cellular automata [65], rather than deterministic locations [64].…”
Section: Digital Watermarking For Hologramsmentioning
confidence: 99%
“…The experimental results indicate that a very small amount of bit errors in the hologram can be detected. To enhance the security, the DCT coefficients for watermark embedding are randomly selected by a pseudo random number (PRN) generator based on cellular automata [65], rather than deterministic locations [64].…”
Section: Digital Watermarking For Hologramsmentioning
confidence: 99%
“…Extensive research has also been carried out in optical watermarking area were work has been done in Fourier domain (Sheng et al, 2009), gyrator wavelet domain (Abuturab, 2015), gyrator domain (Li, 2014;Yadav et al, 2015;Liansheng et al, 2017); fractional Fourier transform domain (Guo, Liu and Liucora, 2011;Lang and Zhang, 2014); wavelet domain (Mendlovic and Konforti, 1993;Javidi et al, 2006;Okman and Akar, 2007;Li et al, 2008Li et al, , 2009Hwang, Chan and Cheng, 2014;Mehra and Nishchal, 2015); kinoform transform (Deng,Yang and Xie,804 Pankaj Rakheja et al 2011); using orthogonal transforms: discrete cosine transform (DCT), discrete wavelet transform (DWT), Hadamard-Walsh (Ishikawa, Uehira and Yanaka, 2012); in DCT domain (Starchenko, 2011); based on 5-DWT, fast Fourier transform (FFT) & singular value decomposition (SVD) (Mittal, Bisen and Gupta, 2017). Here in all these transforms number of independent variables were limited as gyrator transform and fractional Fourier transform has one independent variable, Fresnel transform has two independent variables whereas there is no independent variable in Fourier transform.…”
Section: Introductionmentioning
confidence: 99%