Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2009 International Conference on Computer Engineering and Technology 2009
DOI: 10.1109/iccet.2009.40
|View full text |Cite
|
Sign up to set email alerts
|

Lossless Data Hiding Scheme Based on Adjacent Pixel Difference

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 29 publications
(15 citation statements)
references
References 6 publications
0
12
0
Order By: Relevance
“…the impossibility of recovering the secret bits without errors, owing to the use of log 2 , which is also used in the extraction that produces floating point values, and since in the 2x2 blocks, the leading value (i.e., block(1,1)) is left unaltered, thus this would lead to the destruction of the natural strong correlation between adjacent pixels which would advertise a nonnatural process involvement Histogram-based data hiding is another commonly used data hiding scheme. Li et al [35] propose lossless data hiding using the difference value of adjacent pixels. It is classified under ' 1 ' data embedding algorithms.…”
Section: Steganography In the Image Spatial Domainmentioning
confidence: 99%
“…the impossibility of recovering the secret bits without errors, owing to the use of log 2 , which is also used in the extraction that produces floating point values, and since in the 2x2 blocks, the leading value (i.e., block(1,1)) is left unaltered, thus this would lead to the destruction of the natural strong correlation between adjacent pixels which would advertise a nonnatural process involvement Histogram-based data hiding is another commonly used data hiding scheme. Li et al [35] propose lossless data hiding using the difference value of adjacent pixels. It is classified under ' 1 ' data embedding algorithms.…”
Section: Steganography In the Image Spatial Domainmentioning
confidence: 99%
“…For instance, instead of proposing an embedding technique, a spatial domain technique in producing a fingerprinted secret sharing steganography for robustness against image cropping attacks is used in [10]. In addition, another used data hiding scheme histogram-based data hiding, given in [11], proposed lossless data hiding, using the difference value of adjacent pixels. Moreover, an alphabet punctuation for hiding messages is exploited in [12].…”
Section: Discrete Fourier Transform (Dft) Methods Discrete Cosine Tranmentioning
confidence: 99%
“…Data hiding in spatial domain has a very large impact in data hiding area. [14], [15], [16], [17] all belong to this category. A problem with these methods is that they often require a sequence generator to locate pixels that hide data and therefore they have a weak resistance to intentional attack.…”
Section: Related Workmentioning
confidence: 96%