2017
DOI: 10.1016/j.sigpro.2017.02.008
|View full text |Cite
|
Sign up to set email alerts
|

Robust image hashing with multidimensional scaling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
45
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 71 publications
(45 citation statements)
references
References 33 publications
0
45
0
Order By: Relevance
“…This method has poor hash length, AUC and computational efficiency because of its sensitive behavior against content changing manipulations. A multidimensional scaling (MDS) image hashing presented in [25] with high robustness because of its higher values of AUC than others but it has very poor results in terms of computational time and especially hash length because of the limitation of very rich featured hash. Results are also presented in Table 5 and Table 6.…”
Section: Review Of Image Hashing Shows That Researchers Have Worked Omentioning
confidence: 99%
See 3 more Smart Citations
“…This method has poor hash length, AUC and computational efficiency because of its sensitive behavior against content changing manipulations. A multidimensional scaling (MDS) image hashing presented in [25] with high robustness because of its higher values of AUC than others but it has very poor results in terms of computational time and especially hash length because of the limitation of very rich featured hash. Results are also presented in Table 5 and Table 6.…”
Section: Review Of Image Hashing Shows That Researchers Have Worked Omentioning
confidence: 99%
“…Area under ROC curve (AUC) is a measure of the efficiency of ROC. Table 5 illustrates the comparison of AUC and hash length of proposed method with some latest schemes [14,[23][24][25]. We provided the hash length in both binary bits and decimal digits for K = 21 .…”
Section: Receiver Operating Characteristicsmentioning
confidence: 99%
See 2 more Smart Citations
“…The scheme extracts significant features by using a wavelet based feature detection algorithm and uses an iterative procedure to obtain a set of feature points. Tang et al [19] extract a rotation-invariant feature matrix and compress the matrix with multidimensional scaling to generate an image hash. Tang et al [20] construct three-order tensor from an image and decompose the tensor to generate an image hash.…”
Section: Related Workmentioning
confidence: 99%