Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Advanced Computer Theory and Engineering, 4th (ICACTE 2011)
By
Yi Xie
Yi Xie
Search for other works by this author on:
ISBN:
9780791859933
No. of Pages:
840
Publisher:
ASME Press
Publication date:
2011

Perceptual image hashing is an emerging solution for multimedia content authentication. Due to most perceptual image hashing techniques focus on the robustness but ignore their sensitivity to trivial tampering area, such techniques might not work well when malicious attack is perceptually insignificant. Through experiments we found that some state-of-the-art image hash algorithms could not distinguish small malicious distortion and some authentic distortion. So we propose a novel method about detection of trivial image tampering via unmatched feature points clustering in this paper. First, we extract SURF (Speeded Up Robust Features) feature points but do not use its original descriptor, we use BRIEF (Binary Robust Independent Elementary Features) descriptor which is more simple and fast. Then we make a clustering to the unmatched feature points after matching, and analyze the density of the clusters. Finally, by comparing the density and a pre-defined threshold, we can correctly determine whether an image is attacked or not. The experimental results show that, compared to V. Monga's algorithm which the TPR(true positive ratio) reaches 89%, but the FPR(false positive ratio) reaches 50%, the TPR of the proposed algorithm reaches 88%, but the FPR is only 15%.

Abstract
Keywords
1 Introduction
2 Problem of Current Techniques
3 Proposed Method
4 Experimental Results
5 Conclusion
6 References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal