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

High capacity data hiding based on interpolated image

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
48
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 75 publications
(49 citation statements)
references
References 22 publications
1
48
0
Order By: Relevance
“…Consequently, (e i ,e j ) can be obtained as follows. 1 If s= f 2 (e i , e j ), e i = b k and e j = b k ; 2 If s= f 2 (e i +1, e j ), e i = b k +1 and e j = b k ; 3 If s= f 2 (e i -1, e j ), e i = b k -1 and e j = b k ; 4 If s= f 2 (e i , e j +1), e i = b k and e j = b k +1; 5 If s= f 1 (e i , e j -1), e i = b k and e j = b k -1; 6 If s= f 1 (e i +1, e j +1), e i = b k +1 and e j = b k +1; 7 If s= f 1 (e i +1, e j -1), e i = b k +1 and e j = b k -1; 8 If s= f 1 (e i -1, e j +1), e i = b k -1 and e j = b k +1; By the same way, secret data can be embedded into other pairs. Overall, if b k is only expanded leftward or rightward, two secret bits can be embedded into a pair of errors.…”
Section: Expanding Both Leftward and Rightwardmentioning
confidence: 99%
See 1 more Smart Citation
“…Consequently, (e i ,e j ) can be obtained as follows. 1 If s= f 2 (e i , e j ), e i = b k and e j = b k ; 2 If s= f 2 (e i +1, e j ), e i = b k +1 and e j = b k ; 3 If s= f 2 (e i -1, e j ), e i = b k -1 and e j = b k ; 4 If s= f 2 (e i , e j +1), e i = b k and e j = b k +1; 5 If s= f 1 (e i , e j -1), e i = b k and e j = b k -1; 6 If s= f 1 (e i +1, e j +1), e i = b k +1 and e j = b k +1; 7 If s= f 1 (e i +1, e j -1), e i = b k +1 and e j = b k -1; 8 If s= f 1 (e i -1, e j +1), e i = b k -1 and e j = b k +1; By the same way, secret data can be embedded into other pairs. Overall, if b k is only expanded leftward or rightward, two secret bits can be embedded into a pair of errors.…”
Section: Expanding Both Leftward and Rightwardmentioning
confidence: 99%
“…Image encryption converts a meaningful original image into an unrecognized one to prevent information leakage [3,4]. Different from image encryption, image data hiding modifies the pixel values of a cover image imperceptibly to embed secret data into the cover image so that the transmission of stego-image does not attract attacker's interest [5][6][7][8][9].…”
Section: Introductionmentioning
confidence: 99%
“…This method is the first efficient algorithm for optimizing classification trees which can help our problem, see more about spatial interpolation of ViSAR frames and its pre-processing in [7,8]. In addition, many similar works exist that are about interpolation-based data embedding and histogram processing [9][10][11][12][13][14][15][16][17]; readers can follow them. Also, more information about interpolators can be found in [4,[18][19][20].…”
Section: Introductionmentioning
confidence: 99%
“…For Lena image, the payload and quality through Jana [6] scheme were 130,000 bits and 50.60 PSNR dB respectively. Some researcher has been focused on interpolation based data hiding techniques [2,10,12,15,16,18,29,[32][33][34][35][36][37]. [23] and [3] are focused on watermarking and image authentication based data hiding techniques respectively.…”
Section: Introductionmentioning
confidence: 99%