paper-with-me

Papers

Hash Function Learning via Codewords

2015-08-13 · Yinjie Huang, Michael Georgiopoulos, Georgios C. Anagnostopoulos

In this paper we introduce a novel hash learning framework that has two main distinguishing features, when compared to past approaches. First, it utilizes codewords in the Hamming space as ancillary means to accomplish its hash learning task. These codewords, which are inferred from the data, attempt to capture similarity aspects of the data's hash codes. Secondly and more importantly, the same framework is capable of addressing supervised, unsupervised and, even, semi-supervised hash learning tasks in a natural manner. A series of comparative experiments focused on content-based image retrieval highlights its performance advantages.

📄 PDF Abstract BibTeX arXiv:1508.03285

Code (1)

yinjiehuang/StarSHL 공식 구현

Tasks

Content-Based Image RetrievalImage RetrievalRetrieval

Similar Papers 제목 키워드 기반

Learning Hash Function through Codewords

2019-02-22 · Yinjie Huang, Michael Georgiopoulos, Georgios C. Anagnostopoulos

In this paper, we propose a novel hash learning approach that has the following main distinguishing features, when compared to past frameworks. First, the codewords are utilized in the Hamming space as ancillary techniqu…

Content-Based Image RetrievalImage RetrievalRetrieval

K-Nearest Neighbors Hashing

2019-06-01 · CVPR 2019 6 · Xiangyu He, Peisong Wang, Jian Cheng

Hashing based approximate nearest neighbor search embeds high dimensional data to compact binary codes, which enables efficient similarity search and storage. However, the non-isometry sign() function makes it hard to pr…

Compressed Hashing

2013-06-01 · CVPR 2013 6 · Yue Lin, Rong Jin, Deng Cai, Shuicheng Yan 외

Recent studies have shown that hashing methods are effective for high dimensional nearest neighbor search. A common problem shared by many existing hashing methods is that in order to achieve a satisfied performance, a l…

compressed sensing

Spectral Hashing

2008-12-01 · NeurIPS 2008 12 · Yair Weiss, Antonio Torralba, Rob Fergus

Semantic hashing seeks compact binary codes of datapoints so that the Hamming distance between codewords correlates with semantic similarity. Hinton et al. used a clever implementation of autoencoders to find such codes.…

graph partitioningSemantic SimilaritySemantic Textual Similarity

Orthonormal Product Quantization Network for Scalable Face Image Retrieval

2021-07-01 · Ming Zhang, Xuefei Zhe, Hong Yan

Existing deep quantization methods provided an efficient solution for large-scale image retrieval. However, the significant intra-class variations like pose, illumination, and expressions in face images, still pose a cha…

Deep HashingFace Image RetrievalImage RetrievalInformativeness+2