2002
DOI: 10.1016/s0167-8655(02)00122-8
|View full text |Cite
|
Sign up to set email alerts
|

BPCS steganography using EZW lossy compressed images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
32
0
1

Year Published

2004
2004
2018
2018

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 75 publications
(33 citation statements)
references
References 8 publications
0
32
0
1
Order By: Relevance
“…The author in the experimental section does not show how resilient the algorithm is to different image processing attacks, e.g., rotation, additive noise, cropping, and compression. Indeed, the ABCDE algorithm provides an improvement over a former method known as BPCS (Bit Plane Complexity Segmentation) [69]; which, in turn, was introduced to compensate for the drawback of the traditional LSB manipulation techniques of data hiding [70]. The computational complexity of the algorithm to find a phase key that passes the threshold is time consuming and there is no guarantee that it will always evolve into an optimal solution [71].…”
Section: Adaptive Steganographymentioning
confidence: 99%
“…The author in the experimental section does not show how resilient the algorithm is to different image processing attacks, e.g., rotation, additive noise, cropping, and compression. Indeed, the ABCDE algorithm provides an improvement over a former method known as BPCS (Bit Plane Complexity Segmentation) [69]; which, in turn, was introduced to compensate for the drawback of the traditional LSB manipulation techniques of data hiding [70]. The computational complexity of the algorithm to find a phase key that passes the threshold is time consuming and there is no guarantee that it will always evolve into an optimal solution [71].…”
Section: Adaptive Steganographymentioning
confidence: 99%
“…J.Spaulding et al proposed BPCS (bit plane complexity segmentation) for the compensation of the discrepancies of the custom LSB procedures of substitution of embedding data. [60]. in a book Wayner describes the noise and calls it "life in noise" also points to how much useful the data embedding is while in noise.…”
Section: Adaptive Image Steganographymentioning
confidence: 99%
“…The complexity of each subsection of a bit-plane is defined as the number of non-edge transitions from 1 to 0 and 0 to 1 [8]. BPCS is another substitution type method, but rather than replacing specific bits.…”
Section: Bit-plane Complexity Segmentation (Bpcs)mentioning
confidence: 99%