A Secure High-Capacity Video Steganography Using Bit Plane Slicing Through (7, 4) Hamming Code

Author(s):  
Ananya Banerjee ◽  
Biswapati Jana
IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 62361-62371 ◽  
Author(s):  
Hao-Tian Wu ◽  
Zhiyuan Yang ◽  
Yiu-Ming Cheung ◽  
Lingling Xu ◽  
Shaohua Tang

2012 ◽  
Vol 433-440 ◽  
pp. 5378-5383 ◽  
Author(s):  
Li Xian Wei ◽  
Peng Yang ◽  
Xiao Yuan Yang

Video steganographic algorithm has the advantage of large hiding capacity, but we neglect the security when seek the capacity. In order to balance the two aspects, both to meet the high capacity of improving the load of video carrier and can safely protect the secret information. This paper presents the error-correcting code which can effectively correct burst errors and use it in video steganography. The secret information is hidden in error-correcting code first and then integrated the code with secret information with the video carrier’s DCT coefficients to insert the secret information in video carrier. The experiment results show that: this algorithm not only has great visual and statistical invisibility, also the safety of secret information is more significant. And achieve the objective of effective protect the secret information.


PLoS ONE ◽  
2021 ◽  
Vol 16 (1) ◽  
pp. e0244691
Author(s):  
WAQAR ISHAQ ◽  
ELIYA BUYUKKAYA ◽  
MUSHTAQ ALI ◽  
ZAKIR KHAN

The vertical collaborative clustering aims to unravel the hidden structure of data (similarity) among different sites, which will help data owners to make a smart decision without sharing actual data. For example, various hospitals located in different regions want to investigate the structure of common disease among people of different populations to identify latent causes without sharing actual data with other hospitals. Similarly, a chain of regional educational institutions wants to evaluate their students’ performance belonging to different regions based on common latent constructs. The available methods used for finding hidden structures are complicated and biased to perform collaboration in measuring similarity among multiple sites. This study proposes vertical collaborative clustering using a bit plane slicing approach (VCC-BPS), which is simple and unique with improved accuracy, manages collaboration among various data sites. The VCC-BPS transforms data from input space to code space, capturing maximum similarity locally and collaboratively at a particular bit plane. The findings of this study highlight the significance of those particular bits which fit the model in correctly classifying class labels locally and collaboratively. Thenceforth, the data owner appraises local and collaborative results to reach a better decision. The VCC-BPS is validated by Geyser, Skin and Iris datasets and its results are compared with the composite dataset. It is found that the VCC-BPS outperforms existing solutions with improved accuracy in term of purity and Davies-Boulding index to manage collaboration among different data sites. It also performs data compression by representing a large number of observations with a small number of data symbols.


Sign in / Sign up

Export Citation Format

Share Document