2015
DOI: 10.1109/tmm.2015.2432672
|View full text |Cite
|
Sign up to set email alerts
|

Secure and Robust Two-Phase Image Authentication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(10 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…Here, h is the high quantization level and l is the low quantization level. A bitmap (bm) for the current block is generated based on the following rules: (1) If the pixel belongs to the subgroup, G S0 , its corresponding position in the bitmap is marked '0'; (2) if the pixel belongs to the subgroup, G S1 , its corresponding position in the bitmap is marked '1'. The generation rule for the bitmap is described as follows:…”
Section: Ambtc Compressionmentioning
confidence: 99%
See 3 more Smart Citations
“…Here, h is the high quantization level and l is the low quantization level. A bitmap (bm) for the current block is generated based on the following rules: (1) If the pixel belongs to the subgroup, G S0 , its corresponding position in the bitmap is marked '0'; (2) if the pixel belongs to the subgroup, G S1 , its corresponding position in the bitmap is marked '1'. The generation rule for the bitmap is described as follows:…”
Section: Ambtc Compressionmentioning
confidence: 99%
“…Step 4. Extract the first seven bits of bm as the first cover vector, CV 1 = cv 1 1 , cv 1 2 , cv 1 3 , cv 1 4 , cv 1 5 , cv 1 6 , cv 1 7 = (bm (1,1) , bm (1,2) , bm (1,3) , bm (1,4) , bm (2,1) , bm (2,2) , bm (2,3) ). Extract the last seven bits of bm as the second cover vector, CV 2 = cv 2 1 , cv 2 2 , cv 2 3 , cv 2 4 , cv 2 5 , cv 2 6 , cv 2 7 = (bm (3,2) , bm (3,3) , bm (3,4) , bm (4, 1) , bm (4,2) , bm (4,3) , bm (4,4) ).…”
Section: The Matrix Encoding Based Data Hidingmentioning
confidence: 99%
See 2 more Smart Citations
“…So far, several identification schemes and image hash functions have been developed for authenticating images [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. They can be broadly classified into two types according to a difference in extracted features: compression method-depended type, to which the proposed scheme corresponds, and compression methodindependent type.…”
Section: Introductionmentioning
confidence: 99%