Composite hashing with multiple information sources
2011pp. 225–234
Citations Over TimeTop 10% of 2011 papers
Abstract
Similarity search applications with a large amount of text and image data demands an efficient and effective solution. One useful strategy is to represent the examples in databases as compact binary codes through semantic hashing, which has attracted much attention due to its fast query/search speed and drastically reduced storage requirement. All of the current semantic hashing methods only deal with the case when each example is represented by one type of features. However, examples are often described from several different information sources in many real world applications. For example, the characteristics of a webpage can be derived from both its content part and its associated links.
Related Papers
- → Fast nearest neighbor search in high-dimensional space(2002)156 cited
- → Robust Hash for Detecting and Localizing Image Tampering(2007)104 cited
- → Privacy and Robust Hashes(2019)5 cited
- → Does Secure Time-Stamping Imply Collision-Free Hash Functions?(2007)5 cited
- → Privacy and Robust Hashes(2020)1 cited