三进制哈希
Ternary Hashing
摘要：
本文提出了一种新的三进制哈希编码学习哈希方法，它提供了一个原则上更有效的编码方案，性能优于那些国家的最先进的二进制哈希同行。在学习/编码和测试/查询两个阶段，分别采用Kleene逻辑和Kukasiewicz逻辑来计算三值汉明距离（THD）。我们的工作表明，在标准二进制机器上有效地实现了三进制逻辑，所提出的三进制哈希与二进制哈希方法相比，检索平均平均精度（mAP）的一致改进范围从1%到5.9%，如CIFAR 10，NUS-WIDE和ImageNet 100数据集所示。
英文摘要：
This paper proposes a novel ternary hash encoding for learning to hash methods, which provides a principled more efficient coding scheme with performances better than those of the state-of-the-art binary hashing counterparts. Two kinds of axiomatic ternary logic, Kleene logic and Łukasiewicz logic are adopted to calculate the Ternary Hamming Distance (THD) for both the learning/encoding and testing/querying phases. Our work demonstrates that, with an efficient implementation of ternary logic on standard binary machines, the proposed ternary hashing is compared favorably to the binary hashing methods with consistent improvements of retrieval mean average precision (mAP) ranging from 1\% to 5.9\% as shown in CIFAR10, NUS-WIDE and ImageNet100 datasets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
