TY - GEN
T1 - Data Communication Security Based on Novel Reversible Mean Shift Steganography Algorithm
AU - Wang, Xiang
AU - Wang, Tao
AU - Zhao, Zongmin
AU - Du, Pei
AU - Wang, Weike
AU - Tian, Yuntong
AU - Hao, Qiang
AU - Zhang, Zhun
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/3/6
Y1 - 2019/3/6
N2 - With the popularity of node data to the sink-node in wireless sensor networks (WSNs), it is vital to protect the privacy of data and enable the sink-node to easily manage the data at the same time. Under such demands, reversible data steganography in encrypted images attracts more and more researchers' attention. In this paper, we propose a novel reversible mean shift steganography algorithm for improving the security of data communication in WSNs. The algorithm first calculates the l, α, and β sub-components after removing the l component of the original image. At the same time, we use mean shift clustering algorithm to calculate the 3-dimensional regional maximum points based on l, α, and β components and mark them. Finally, the secret information is encoded and hidden in the corresponding extreme points of the Bit plane 0 of the sub-components, and then scrambled with the key. The extensive experimental results show that the proposed algorithm has little influence on the original image, and the histogram is almost the same, and the average error bit ratio (EBR) is only 0.164%.
AB - With the popularity of node data to the sink-node in wireless sensor networks (WSNs), it is vital to protect the privacy of data and enable the sink-node to easily manage the data at the same time. Under such demands, reversible data steganography in encrypted images attracts more and more researchers' attention. In this paper, we propose a novel reversible mean shift steganography algorithm for improving the security of data communication in WSNs. The algorithm first calculates the l, α, and β sub-components after removing the l component of the original image. At the same time, we use mean shift clustering algorithm to calculate the 3-dimensional regional maximum points based on l, α, and β components and mark them. Finally, the secret information is encoded and hidden in the corresponding extreme points of the Bit plane 0 of the sub-components, and then scrambled with the key. The extensive experimental results show that the proposed algorithm has little influence on the original image, and the histogram is almost the same, and the average error bit ratio (EBR) is only 0.164%.
UR - https://www.scopus.com/pages/publications/85063793236
U2 - 10.1109/ICCE.2019.8661908
DO - 10.1109/ICCE.2019.8661908
M3 - 会议稿件
AN - SCOPUS:85063793236
T3 - 2019 IEEE International Conference on Consumer Electronics, ICCE 2019
BT - 2019 IEEE International Conference on Consumer Electronics, ICCE 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Conference on Consumer Electronics, ICCE 2019
Y2 - 11 January 2019 through 13 January 2019
ER -