Robust lossless data hiding using chaotic sequence and statistical quantity histogram

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

. In order to solve the security problem of robust lossless data hiding, A method to cover up detectable traces is proposed based on chaotic sequence and statistical quantity histogram. The proposed method divides a original image into non-overlapping blocks and selects a smaller block in each block by using chaotic sequence. Then calculates the statistical quantity of each selected block as a robust parameter and shifts it by appropriate thresholds. Finally, secret information can be hidden into blocks by modifying robust parameter values. With our proposed method, the embedding trace of secret information is concealed. Experimental results show that the proposed method can achieve high performances in security, robustness and visual quality.

Cite

CITATION STYLE

APA

Li, X., Zhang, J., & Zhou, Q. (2019). Robust lossless data hiding using chaotic sequence and statistical quantity histogram. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 271, pp. 461–468). Springer Verlag. https://doi.org/10.1007/978-3-030-14657-3_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free