Hierarchical One Permutation Hashing: Efficient Multimedia Near Duplicate Detection

Abstract

With advances in multimedia technologies and the proliferation of smart phone, digital cameras, storage devices, there are a rapidly growing massive amount of multimedia data collected in many applications such as multimedia retrieval and management system, in which the data element is composed of text, image, video and audio. Consequently, the study of multimedia near duplicate detection has attracted significant concern from research organizations and commercial communities. Traditional solution minwish hashing (\minwise) faces two challenges: expensive preprocessing time and lower comparison speed. Thus, this work first introduce a hashing method called one permutation hashing (\oph) to shun the costly preprocessing time. Based on \oph, a more efficient strategy group based one permutation hashing (\goph) is developed to deal with the high comparison time. Based on the fact that the similarity of most multimedia data is not very high, this work design an new hashing method namely hi

Stats

• citations3
• S2 citations—
• github stars0
• HF likes0
• heat score4.52
• arxiv keyzhang2018hierarchical

Related papers

• Adaptive Asymmetric Label-guided Hashing For Multimedia Search (2022)0.00
• Transitive Hashing Network For Heterogeneous Multimedia Retrieval (2016)8.35
• Mmlsh: A Practical And Efficient Technique For Processing Approximate Nearest Neighbor Queries On Multimedia Data (2020)4.52
• Online Enhanced Semantic Hashing: Towards Effective And Efficient Retrieval For Streaming Multi-modal Data (2021)8.35
• Differentially Private One Permutation Hashing And Bin-wise Consistent Weighted Sampling (2023)0.00
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00
• CLIP Multi-modal Hashing For Multimedia Retrieval (2024)3.58
• Adaptive Confidence Multi-view Hashing For Multimedia Retrieval (2023)9.95