2013
DOI: 10.1117/1.jei.22.4.043007
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive image steganography using contourlet transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
10
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 43 publications
0
10
0
Order By: Relevance
“…These techniques have a lower payload but they are more robust against statistical attacks. Some examples of transform domain techniques are the discrete wavelength transform technique [23], discrete Fourier transform technique [24], discrete cosine transform techniques [25,26], and contourlet transform technique [27].The simplest and most basic spatial domain steganographic method is LSB substitution, which hides secret data inside a cover image. With this method, the least significant bits of the carrier image pixels are replaced with the secret data bits.…”
mentioning
confidence: 99%
“…These techniques have a lower payload but they are more robust against statistical attacks. Some examples of transform domain techniques are the discrete wavelength transform technique [23], discrete Fourier transform technique [24], discrete cosine transform techniques [25,26], and contourlet transform technique [27].The simplest and most basic spatial domain steganographic method is LSB substitution, which hides secret data inside a cover image. With this method, the least significant bits of the carrier image pixels are replaced with the secret data bits.…”
mentioning
confidence: 99%
“…7e that the best partition, the one with minimal distortion and thus it creates the best route for data embedding, is the 7th partition with the distortion value of 2. On the other hand, if the dynamic blocking and searching for the best partition ideas proposed in this paper are not used, the distortion value will be equal to 6, because in this case the sequence (12,5,17,26,41,3,9,12,15,8,17,6) will be obtained by traversing the pixels of the block shown in Fig. 7a in a raster scan manner.…”
Section: An Illustration Of Finding the Best Partitionmentioning
confidence: 94%
“…The modulus distance is d=(9 -7) mod 16=2 and b x 2 ; b y 2 ð Þ = (2, 0). Therefore, we replace (7,8) by (7+2, 8+0)= (9,8). In the data extraction procedure the secret digit can be obtained using the extraction function f. Following the example, the secret digit is computed as follows: s B =f (9, 8)=(9+ 6×8) mod 16=9.…”
Section: Hong and Chen's Methodsmentioning
confidence: 99%
See 2 more Smart Citations