Local and global structure preserving hashing for fast digital fingerprint tracing

Abstract

Digital fingerprinting is a promising approach to protect multimedia contents from unauthorized redistribution. Whereas, large scale and high dimensionality make existing fingerprint detection methods fail to trace the traitors efficiently. To handle this problem, we propose a novel local and global structure preserving hashing to conduct fast fingerprint detection. This is the first work that introduces hash-based similarity search method to perform fingerprint detection. Applying the hashing method, we obtain a neighborhood-preserving low-dimensional representation (e. g. hash code) for each fingerprint. Through hash codes, we can find the nearest neighbors of the extracted fingerprint, thereby tracing the real traitors within a small range. Preserving the local structure facilitates to find the nearest neighbors of the query fingerprint efficiently, and preserving the global structure ensures hash codes of fingerprints as discriminative as possible. These properties make the proposed approach efficient to trace the real traitors. Extensive experiments demonstrate that the proposed approach outperforms traditional linear scan detection methods in term of efficiency.