2016
DOI: 10.1007/s11042-016-3757-8
|View full text |Cite
|
Sign up to set email alerts
|

Lossless visible watermarking based on adaptive circular shift operation for BTC-compressed images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(16 citation statements)
references
References 13 publications
0
16
0
Order By: Relevance
“…Many reversible visible watermarking schemes are proposed in the past [9][10][11][12][13][14]. Hu and Jeon [9] proposed a scheme by modifying one significant bit plane of the pixels to achieve watermark visibility.…”
Section: Literature Surveymentioning
confidence: 99%
See 1 more Smart Citation
“…Many reversible visible watermarking schemes are proposed in the past [9][10][11][12][13][14]. Hu and Jeon [9] proposed a scheme by modifying one significant bit plane of the pixels to achieve watermark visibility.…”
Section: Literature Surveymentioning
confidence: 99%
“…Once exceeded, the watermarked image cannot be recovered perfectly. In the scheme of [12] by Mohammad et al, the pixel circular shift operation is utilized to embed the watermark into the block truncation codingcompressed (BTC-compressed) image. According to the parity of the bit plane, the watermark signal can be extracted reversibly.…”
Section: Literature Surveymentioning
confidence: 99%
“…BTC is first proposed by Delp and Mitchell in 1979 for data compression [40]. As a simple and fast lossy compression technique, BTC has been widely employed in many applications such as image compression, image watermarking, image retrieval, and so on [41][42][43][44]. It performs standard moments preserving quantization during image coding so that it can achieve both acceptable image quality and low storage space.…”
Section: Block Truncation Codingmentioning
confidence: 99%
“…Many reversible visible watermarking schemes are proposed in the past [5][6][7][8][9][10]. Hu and Jeon [5] proposed a scheme by modifying one significant bit plane of the pixels to achieve watermark visibility.…”
Section: Introductionmentioning
confidence: 99%
“…Once exceeded, the watermarked image cannot be recovered perfectly. In the scheme of [8] by Mohammad et al, the pixel circular shift operation is utilized to embed the watermark into the block truncation coding-compressed (BTC-compressed) image. According to the parity of the bit plane, the watermark signal can be extracted reversibly.…”
Section: Introductionmentioning
confidence: 99%