CFP last date
20 January 2025
Reseach Article

Data Hiding in Images using Majority Vote Parity Check

by Jyoti Rao, Kalpana More, Swati Nikam
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 86 - Number 4
Year of Publication: 2014
Authors: Jyoti Rao, Kalpana More, Swati Nikam
10.5120/14971-3160

Jyoti Rao, Kalpana More, Swati Nikam . Data Hiding in Images using Majority Vote Parity Check. International Journal of Computer Applications. 86, 4 ( January 2014), 8-13. DOI=10.5120/14971-3160

@article{ 10.5120/14971-3160,
author = { Jyoti Rao, Kalpana More, Swati Nikam },
title = { Data Hiding in Images using Majority Vote Parity Check },
journal = { International Journal of Computer Applications },
issue_date = { January 2014 },
volume = { 86 },
number = { 4 },
month = { January },
year = { 2014 },
issn = { 0975-8887 },
pages = { 8-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume86/number4/14971-3160/ },
doi = { 10.5120/14971-3160 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:03:19.446068+05:30
%A Jyoti Rao
%A Kalpana More
%A Swati Nikam
%T Data Hiding in Images using Majority Vote Parity Check
%J International Journal of Computer Applications
%@ 0975-8887
%V 86
%N 4
%P 8-13
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Internet as a complete does not use safe links, thus data in transit may be vulnerable to interception as well. The significant of reducing a chance of the data being detected during the conduction is being a problem now days. Some way out to be discussed is how to pass data in a manner that the very existence of the message is unknown in order to prevent interest of the possible attacker. This approach of data hiding can be extended to copyright protection for digital media. This paper present a comparative study of majority vote parity check method and tree-based parity check. Result shows that Majority vote strategy results in least distortion for finding a stego object.

References
  1. Chung- Li Hou, ChangChun Lu, Shi-Chun Tsai, and wen- Guey Tzeng. , " An Optimal Data Hiding Scheme With Tree-Based Parity Check", IEEE Trans. On Image processing, vol. 20, No. 3, March 2011.
  2. J. Fridrich, M. Goljan, P. Lisonek, and D. Soukal, "Writing on wet paper", IEEE Trans. Signal Process. , vol. 53, no. 10, pp. 3923-3935, Oct. 2005.
  3. J. Fridrich, M. Goljan, and D. Soukal,"Efficient wetpaper codes",in Proc. 7th Int. Workshop Inf. Hiding (IHW 05), Lecture Notes in Computer Science 2005, vol. 3727, pp. 204-218.
  4. J. Fridrich and D. Soukal,"Matrix embedding for large payloads",IEEE Trans. Inf. Forensics Security, vol. 1, no. 3, pp. 390-395, Sep. 2006.
  5. W. Zhang, X. Zhang, and S. Wang," Maximizing steganographic embedding efficiency by Combining hamming codes and wet paper codes",in Proc. Int. Workshop Inf. Hiding (IH 08), 2008, vol. LNCS 5284.
  6. J. Fridrich, "Asymptotic behavior of the ZZW embedding construction", IEEE Trans. Inf. Forensics Security, vol. 4, no. 1, pp. 151-154, Mar. 2009.
  7. R. Y. M. Li, O. C. Au, K. K. Lai, C. K. Yuk, and S. - Y. Lam, "Data hiding with tree based parity check", in Proc. IEEE Int. Conf. Multimedia and Expo (ICME 07), 2007, pp. 635-638.
  8. A. Westfeldl, "F5: A steganographic algorithm, high capacity despite better steganalysis", in Proc. 4th Int. Workshop Inf. Hiding„ 2001, vol. LNCS 2137, pp. 289-302.
  9. W. Zhang and S. Li,"A coding problem in steganography", Designs, Codes Cryptogr. , vol. 46, no. 1, pp. 68-81, 2008.
Index Terms

Computer Science
Information Sciences

Keywords

Majority vote Steganography Image processing Least significant bit (LSB).