.png){kind=icon}
.png){kind=icon}
Return
A steganographic method using Bernoulli's chaotic maps
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2015.12.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an alternative for building a data hiding algorithm into digital images. The method is based on chaos theory and the least significant bit technique for embedding a secret message in a image. Specifically the Bernoulli's chaotic maps are used, to perform the following processes: (i) encrypt the bits of the message before embedding them into the cover image, (ii) a random selection of the image's compositions (R,G or B) must be performed and the insertion of the secret message in a random way to (iii) rows and (iv) columns of the image. Several experimental results are shown under different evaluation criteria, such as entropy, autocorrelation, homogeneity, contrast, energy, peak signal-to-noise ratio, mean squared error and maximum absolute squared deviation. Experimental results show a good improvement in the peak-signal-to-noise-ratio and Image Fidelity value of the proposed algorithm in comparison to the results obtained from similar algorithms. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Steganographic method
Bernoulli map
Pixel substitution
Statistical analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W