2014
DOI: 10.1016/j.cnsns.2013.06.002
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic visual cryptography based on chaotic oscillations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…Palivonaite et al [7] proposed an image hiding algorithm in time-averaged deformable moire gratings. Petrauskiene et al [8] proposed a dynamic visual cryptography based on chaotic oscillations. In these improved algorithms [2][3][4][5][6][7][8], the basic generating equations and parameters are almost the same as those in [1].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Palivonaite et al [7] proposed an image hiding algorithm in time-averaged deformable moire gratings. Petrauskiene et al [8] proposed a dynamic visual cryptography based on chaotic oscillations. In these improved algorithms [2][3][4][5][6][7][8], the basic generating equations and parameters are almost the same as those in [1].…”
Section: Introductionmentioning
confidence: 99%
“…Petrauskiene et al [8] proposed a dynamic visual cryptography based on chaotic oscillations. In these improved algorithms [2][3][4][5][6][7][8], the basic generating equations and parameters are almost the same as those in [1]. Experimental results of [1-8] did not give related parameters, nevertheless, we know that the reconstruction quality may be different when we use the same algorithm with different parameters (about this point, see Fig.…”
Section: Introductionmentioning
confidence: 99%
“…Greater values of the standard deviation determine more blurred time-averaged moiré image. When = 0, time-averaged moiré grating corresponds to the moiré grating in the state of equilibrium [12]. Greyscale intensity of the time-averaged moiré image converges to value 0.5 if the standard deviation is sufficiently high ( → ∞) [12].…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…The embedding of the secret information into the moiré grating requires phase regularization algorithm as well as random phase scrambling algorithm [12]. Such an encoding scheme completely hides the secret in the stationary cover image.…”
Section: The Experimental Set-upmentioning
confidence: 99%
“…Although the Iterative Chaotic Map with Infinite Collapses in [11] potentially offers an infinite parameter space, the output time series swing over the values (-1,1) and it consequently may not be suitable for value normalization in parameter space where the previous value is zero. Moreover, other chaotic maps in [12][13][14][15][16] require complicated mathematical models with morethan-one parameter spaces, resulting in the complex process of parameter optimization. This paper therefore presents a one-dimensional sinusoidal chaotic map in combination with absolute-value nonlinearity given by…”
Section: Proposed Chaotic Map Using Absolute Sinusoidal Nonlinearitymentioning
confidence: 99%