Please use this identifier to cite or link to this item:
|Title:||On preserving robustness-false alarm tradeoff in media hashing|
Locality preserving hash
Localized pairwise matching
|Source:||Roy, S.,Zhu, X.,Yuan, J.,Chang, E.-C. (2007). On preserving robustness-false alarm tradeoff in media hashing. Proceedings of SPIE - The International Society for Optical Engineering 6508 (PART 1). ScholarBank@NUS Repository.|
|Abstract:||This paper discusses one of the important issues in generating a robust media hash. Robustness of a media hashing algorithm is primarily determined by three factors, (1) robustness-false alarm tradeoff achieved by the chosen feature representation, (2) accuracy of the bit extraction step and (3) the distance measure used to measure similarity (dissimilarity) between two hashes. The robustness-false alarm tradeoff in feature space is measured by a similarity (dissimilarity) measure and it defines a limit on the performance of the hashing algorithm. The distance measure used to compute the distance between the hashes determines how far this tradeoff in the feature space is preserved through the bit extraction step. Hence the bit extraction step is crucial, in defining the robustness of a hashing algorithm. Although this is recognized as an important requirement by all, to our knowledge there is no work in the existing literature that elucidates the efficacy of their algorithm based on their effectiveness in improving this tradeoff compared to other methods. This paper specifically demonstrates the kind of robustness false alarm tradeoff achieved by existing methods and proposes a method for hashing that clearly improves this tradeoff. © 2007 SPIE-IS&T.|
|Source Title:||Proceedings of SPIE - The International Society for Optical Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.