2017
DOI: 10.1109/tifs.2017.2699942
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Scale Difference Map Fusion for Tamper Localization Using Binary Ranking Hashing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 31 publications
(13 citation statements)
references
References 33 publications
0
13
0
Order By: Relevance
“…Note that the bm (u, v) should not be used in the embedding procedure. In our experiments, (u, v) is set to (3,1), based on experimental results. We preprocess to check whether the h is equal to l. If it is, the bits in the bm are all equal to '1' and the preprocessing should thus be conducted; otherwise, nothing should be done.…”
Section: Ambtc Compression and Preprocessing Phasementioning
confidence: 99%
See 4 more Smart Citations
“…Note that the bm (u, v) should not be used in the embedding procedure. In our experiments, (u, v) is set to (3,1), based on experimental results. We preprocess to check whether the h is equal to l. If it is, the bits in the bm are all equal to '1' and the preprocessing should thus be conducted; otherwise, nothing should be done.…”
Section: Ambtc Compression and Preprocessing Phasementioning
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 3 more Smart Citations