Push for Quantization: Deep Fisher Hashing
원문 초록
Current massive datasets demand light-weight access for analysis. Discrete hashing methods are thus beneficial because they map high-dimensional data to compact binary codes that are efficient to store and process, while preserving semantic similarity. To optimize powerful deep learning methods for image hashing, gradient-based methods are required. Binary codes, however, are discrete and thus have no continuous derivatives. Relaxing the problem by solving it in a continuous space and then quantizing the solution is not guaranteed to yield separable binary codes. The quantization needs to be included in the optimization. In this paper we push for quantization: We optimize maximum class separability in the binary space. We introduce a margin on distances between dissimilar image pairs as measured in the binary space. In addition to pair-wise distances, we draw inspiration from Fisher's Linear Discriminant Analysis (Fisher LDA) to maximize the binary distances between classes and at the same time minimize the binary distance of images within the same class. Experiments on CIFAR-10, NUS-WIDE and ImageNet100 demonstrate compact codes comparing favorably to the current state of the art.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
FA: Forced Prompt Learning of Vision-Language Models for Out-of-Distribution Detection
ImpliRet: Benchmarking the Implicit Fact Retrieval Challenge
Inv-Entropy: A Fully Probabilistic Framework for Uncertainty Quantification in Language Models
Trend-Aware Fashion Recommendation with Visual Segmentation and Semantic Similarity
KNN-Defense: Defense against 3D Adversarial Point Clouds using Nearest-Neighbor Search
IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theory
토론
이 논문과 연결된 포럼 글이 아직 없습니다.