Approximate Nearest Neighbor Based Feature Quantization Algorithm for Robust Hashing

スポンサーリンク

概要

• 論文の詳細を見る

• In this letter, the problem of feature quantization in robust hashing is studied from the perspective of approximate nearest neighbor (ANN). We model the features of perceptually identical media as ANNs in the feature set and show that ANN indexing can well meet the robustness and discrimination requirements of feature quantization. A feature quantization algorithm is then developed by exploiting the random-projection based ANN indexing. For performance study, the distortion tolerance and randomness of the quantizer are analytically derived. Experimental results demonstrate that the proposed work is superior to state-of-the-art quantizers, and its random nature can provide robust hashing with security against hash forgery.

著者

• Luo Hao

  School Of Aeronautics And Astronautics Zhejiang Univ.

• LI Yue

  School of Electronic and Information Engineering, Tianjin University

関連論文

• Empirical-Statistics Analysis for Zero-Failure GaAs MMICs Life Testing Data
• Color Image Retrieval Based on Distance-Weighted Boundary Predictive Vector Quantization Index Histograms
• Strength-Strength and Strength-Degree Correlation Measures for Directed Weighted Complex Network Analysis
• A Tree-Structured Deterministic Small-World Network
• Approximate Nearest Neighbor Based Feature Quantization Algorithm for Robust Hashing
• Enhanced Side-Channel Cube Attacks on PRESENT

スポンサーリンク