Hiding data in images by simple LSB substitution

Chan, Chi-Shiang; Cheng, L.

doi:10.1016/j.patcog.2003.08.007

Cited by 1,402 publications

(739 citation statements)

References 7 publications

Supporting

Mentioning

733

Contrasting

Unclassified

Order By: Relevance

“…The data-hiding methods which employs two pixels as an embedding unit for hiding a message digit SB in a B-ary notational system is termed as pixel pair matching (PPM). The OPAP scheme proposed by Chi-Kwon Chan and L.M Cheng [4,5], was developed scheme modifies the embedded bits in order to improve the overall visibility of the stego image. This scheme is an improvement over the LSB based algorithm…”

Section: Embedding Techniquesmentioning

confidence: 99%

A Survey of Recent Embedding Techniques and Security Measures in Steganography

Kali¹

2014

IOSRJVSP

View full text Add to dashboard Cite

Section: Embedding Techniquesmentioning

confidence: 99%

A Survey of Recent Embedding Techniques and Security Measures in Steganography

Kali¹

2014

IOSRJVSP

View full text Add to dashboard Cite

“…To analysis study the performance and comparisons between the state-of-the-art algorithms will be modified the algorithms of pixel adjustment process (PAP) are based in the LSB techniques are proposed [9], [11], [13], [14], after that will be applying the modification algorithms of PAP by the our embedding algorithm of the FOBCB set-of-the-MSB 6 [15], the Max-of embedding errors in the MSB 6 by directly replacement of embedding watermark bits=2 n-1 =32. Moreover there is a trade-off between the embedding errors in the LSB and MSB, where the embedding errors are growth up as =2 n-1 .…”

Section: Proposed Modified Previous Workmentioning

confidence: 99%

“…We modified the Chi-Kwong-L. M. Cheng [13] scheme using optimal pixel adjustment process (OPAP) the proposed embedding algorithm in the k, means capacity of embedding data bit in k-LSB n of the cover image, where the Max-embedding errors growth up respectively from {1, 3, 7and 15 Max } depending in the value of k, then will be applying the OPAP algorithm in the MSB 6 without using k of capacity. Thus the embedding errors in MSB 6 =32 are greater than with compared by using a capacity of k bits in (LSB 1, 2, 3, 4 ) are equal 15.…”

Section: B Pap-algorithm-2mentioning

confidence: 99%

“…Theoretical analysis: from the Chi-K.scheme(OPAP) [13] the algorithm minimized the embedding error from (2 k -1) to 2 k-1 . Theoretically, can be calculated the number of embedding errors "i" are start from "1" to=2 k-1 , can be derived by:…”

Section: B Pap-algorithm-2mentioning

confidence: 99%

“…(5,10) the averg.WMSE can be derived by: Eq.(3.11). Furthermore by using the same algorithm in [13] by modified the algorithm called PAP-algorithm-3 set-of-MSB n where n=k, in this modification the embed watermark bit adjust only embeds one bit in each pixel of the cover image, the Max-of-embedding errors=2 n-1 =32, by applying the PAP-algorithm-3, the embedding errors are always great constant to the Max-level in all cases=2 n-1 . Theoretically the WMSE are constant WMSE * =(2 n-1 ) 2 , after applying the PAP-algorithm-3, from Eqs(5, 7) calculated the PSNR worst .…”

mentioning

confidence: 99%

See 2 more Smart Citations

A New Novel Fidelity Digital Watermarking Adaptively Pixel Based on Medial Pyramid of Embedding Error in Spatial Domain and Robust

Aliwa¹,

Eltobely²,

Fahmy³

et al. 2013

IJCTE

View full text Add to dashboard Cite

Abstract-Digital watermarking refers to techniques that are used to protect digital data by imperceptibly embedding watermark into the original data in such a way that always remains present. In particular, digital watermarking techniques in frequency domain have been widely recognized to be more prevalent than others, but in recent years the techniques in spatial domain they are becoming generally abandoned. One of the problems in digital watermarking is that the three requirements of robustness capacity and imperceptibility, that are must be satisfied but they almost conflict with each other, accordingly there are trade-off between fidelity and robustness. In this paper, we proposed a new novel fidelity and robust watermark embedding method that satisfies the requirements and statement problem, called adaptively pixel adjustment process based on medial pyramid of embedding error, applying in the falling-off-boundary in corners board of the cover image set of the Most Significant Bit '6' blind in spatial domain. In addition, the paper provides a theoretical analysis and modified algorithms of previous works. Theoretically, the proposed technique proves the effectiveness of the technique in the average of worst case and minimizing the number of embedding error to the half. Experimental results of the proposed technique was applied on the different benchmark of six gray scale images and two quantum of watermark bit embedded are compared with previous works and was found better. Moreover in all different benchmark of six test images the watermarks were extracted from watermark degrading, removal and geometric transformations attacks to an acceptable degree.Index Terms-Fidelity, digital watermarking, imperceptible, spatial domain, LSB & MSB, benchmark. I. INTRODUCTIONDigital watermarking is a technique which allows an individual to add hidden copyright or other messages to digital audio, video, or image signals [1], [2]. The important watermarking characteristics are exhibit. Imperceptibility: means that the perceived quality of the host image should not be distorted by the presence of the watermark [3]. Fidelity: refers to the term imperceptible as it is referred in the literature of watermarks [4]. Capacity: knowing how much information can reliably be hidden in the signal [2] and refers Manuscript received November 21, 2012; revised January 24, 2013. Mehemed Bashir Aliwa, Tarek El-Ahmady El-Tobely, Mahmoud M. Fahmy, and Mohamed EL Said Nasr are with the Faculty of Engineering-TANTA University, in Egypt (e-mail: aliwa97@hotmail.com, tarekeltobely@yahoo.com, mfn-288@ hotmail.com, menasr2001@hotmail.com).Mohamed Hashem Abd El-Aziz is with the Faculty of Computers and Information Sciences-Ain Shams University, in Egypt (e-mail: mhashem100@yahoo.com).to the bit size of a payload that a watermark access unit can carry [5] or how many marks can be added simultaneously [6], [7]. Data payload: refers to the amount of information stored in the watermark [4]. Robustness: The ability of the watermark to survive normal ...

show abstract

Steganography and Steganalysis

Thom¹,

Anh²

2019

Cyber Security in Parallel and Distributed Computing

View full text Add to dashboard Cite

Hiding data in images by simple LSB substitution

Cited by 1,402 publications

References 7 publications

A Survey of Recent Embedding Techniques and Security Measures in Steganography

A Survey of Recent Embedding Techniques and Security Measures in Steganography

A New Novel Fidelity Digital Watermarking Adaptively Pixel Based on Medial Pyramid of Embedding Error in Spatial Domain and Robust

Steganography and Steganalysis

Contact Info

Product

Resources

About