Zhanzhan Gao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Zhanzhan Gao has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Guangming Tang
Information Science and Technology Institute, Zhengzhou, China
2 shared publications - Yifeng Sun
Information Science and Technology Institute, Zhengzhou, China
2 shared publications - Danmei Niu
Information Engineering College, Henan University of Science and Technology, Luoyang, China
1 shared publication - Haitao Song
Zhengzhou Information Science and Technology Institute, Zhengzhou, People’s Republic of China
1 shared publication
Latest Publications
- Open Access
- 8 April 2019
- Published by Wiley in Security and Communication Networks
- Vol. 2019, 1-13
Security Measure for Image Steganography Based on High Dimensional KL Divergence
Steganographic security is the research focus of steganography. Current steganography research emphasizes on the design of steganography algorithms, but the theoretical research about steganographic security measure is relatively lagging. This paper proposes a feasible image steganographic security measure based on high dimensional KL divergence. It is proved that steganographic security measure of higher dimensional KL divergence is more accurate. The correlation between neighborhood pixels is analyzed from the principle in imaging process and content characteristics, and it is concluded that 9-dimensional probability statistics are effective enough to be used as steganographic security measure. Then in order to reduce the computational complexity of high dimensional probability statistics and improve the feasibility of the security measure method, a security measure dimension reduction scheme is proposed by applying gradient to describe image textures. Experiments show that the proposed steganographic security measure method is feasible and effective and more accurate than measure method based on 4-dimensional probability statistics.
- 8 April 2019
- Published by Wiley in Security and Communication Networks
- Vol. 2019, 1-13
Open AccessSecurity Measure for Image Steganography Based on High Dimensional KL Divergence
Steganographic security is the research focus of steganography. Current steganography research emphasizes on the design of steganography algorithms, but the theoretical research about steganographic security measure is relatively lagging. This paper proposes a feasible image steganographic security measure based on high dimensional KL divergence. It is proved that steganographic security measure of higher dimensional KL divergence is more accurate. The correlation between neighborhood pixels is analyzed from the principle in imaging process and content characteristics, and it is concluded that 9-dimensional probability statistics are effective enough to be used as steganographic security measure. Then in order to reduce the computational complexity of high dimensional probability statistics and improve the feasibility of the security measure method, a security measure dimension reduction scheme is proposed by applying gradient to describe image textures. Experiments show that the proposed steganographic security measure method is feasible and effective and more accurate than measure method based on 4-dimensional probability statistics.
- 1 August 2012
- Published by Academy Publisher in Journal of Multimedia
- Vol. 7 (4)
Optimized LSB Matching Steganography Based on Fisher Information
This paper proposes an optimized LSB matching steganography based on Fisher Information. The embedding algorithm is designed to solve the optimization problem, in which Fisher information is the objective function and embedding transferring probabilities are variables to be optimized. Fisher information is the quadratic function of the embedding transferring probabilities, and the coefficients of quadratic term are determined by the joint probability distribution of cover elements. By modeling the groups of elements in a cover image as Gaussian mixture model, the joint probability distribution of cover elements for each cover image is obtained by estimating the parameters of Gaussian mixture distribution. For each sub-Gaussian distribution in Gaussian mixture distribution, the quadratic term coefficients of Fisher information are calculated, and the optimized embedding transferring probabilities are solved by quadratic programming. By maximum posteriori probability principle, cover pixels are classified as the categories corresponding to sub-Gaussian distributions. At last, in order to embed message bits, pixels chose to add or subtract one according to the optimized transferring probabilities of the category. The experiments show that the security performance of this new algorithm is better than the existing LSB matching.</p
- 1 August 2012
- Published by Academy Publisher in Journal of Multimedia
- Vol. 7 (4)
Optimized LSB Matching Steganography Based on Fisher Information
This paper proposes an optimized LSB matching steganography based on Fisher Information. The embedding algorithm is designed to solve the optimization problem, in which Fisher information is the objective function and embedding transferring probabilities are variables to be optimized. Fisher information is the quadratic function of the embedding transferring probabilities, and the coefficients of quadratic term are determined by the joint probability distribution of cover elements. By modeling the groups of elements in a cover image as Gaussian mixture model, the joint probability distribution of cover elements for each cover image is obtained by estimating the parameters of Gaussian mixture distribution. For each sub-Gaussian distribution in Gaussian mixture distribution, the quadratic term coefficients of Fisher information are calculated, and the optimized embedding transferring probabilities are solved by quadratic programming. By maximum posteriori probability principle, cover pixels are classified as the categories corresponding to sub-Gaussian distributions. At last, in order to embed message bits, pixels chose to add or subtract one according to the optimized transferring probabilities of the category. The experiments show that the security performance of this new algorithm is better than the existing LSB matching.</p