Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing 2010
DOI: 10.1145/1924559.1924622
|View full text |Cite
|
Sign up to set email alerts
|

Computation of embedding capacity in reversible watermarking schemes

Abstract: This paper deals about embedding capacity computation for reversible watermarking schemes. The paper proposes a unique way of computing embedding capacity directly from the data set without actually embedding the watermark in the image. This computation is done based on the statistical parameters of the data set. We also demonstrate how to compute the capacity under distortion constraints. We also show how to enhance the capacity by using a multipass embedding scheme without substantially affecting the PSNR.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 11 publications
(22 reference statements)
0
6
0
Order By: Relevance
“…For obtaining higher embedding capacity, researchers devised multi-pass embedding technique, wherein watermarking is done in consecutive passes to the cover image and then to the watermarked image. The author has addressed this subject in [3]. All this techniques are based on Pixel-Pair approach.…”
Section: Proposed Methodologymentioning
confidence: 99%
See 1 more Smart Citation
“…For obtaining higher embedding capacity, researchers devised multi-pass embedding technique, wherein watermarking is done in consecutive passes to the cover image and then to the watermarked image. The author has addressed this subject in [3]. All this techniques are based on Pixel-Pair approach.…”
Section: Proposed Methodologymentioning
confidence: 99%
“…A theorem is proposed in this regard in [3]. Thus the over error after n passes of watermarking, would be (3∆) n .…”
Section: Difference Error Over Multipass Embeddingmentioning
confidence: 99%
“…the pixel pair (10,12), s [1] as (9,14), s [2] as (5,18) and so on. Similarly, i s[0] , i s [1] and i s [2] are 0,0 and φ respectively and η(i s[0] ), η(i s [1] ) and η(i s [2] ) are 1,1 and 0 respectively.…”
Section: Pixel Pair Tree Based Methodsmentioning
confidence: 99%
“…These techniques are location map based and hence require an additional step of data compression. Recently reversible contrast mapping (RCM) based methods [2,5,6] have been used to efficiently embed data without using a location map. Prediction based techniques [7,19] have also been suggested and they use information from the neighboring pixels to embed information.…”
Section: Past Workmentioning
confidence: 99%
See 1 more Smart Citation