relation: https://khub.utp.edu.my/scholars/19334/
title: RelaHash: Deep Hashing with Relative Position
creator: Minh, P.V.T.
creator: Viet, N.D.D.
creator: Son, N.T.
creator: Anh, B.N.
creator: Jaafar, J.
description: Deep hashing has been widely used as a solution to encoding binary hash code for approximating nearest neighbor problem. It has been showing superior performance in terms of its ability to index high-level features by learning compact binary code. Many recent state-of-the-art deep hashing methods often use multiple loss terms at once, thus introducing optimization difficulty and may result in sub-optimal hash codes. OrthoHash was proposed to replace those losses with just a single loss function. However, the quantization error minimization problem in OrthoHash is still not addressed effectively. In this paper, we take one step further -propose a single-loss model that can effectively minimize the quantization error without explicit loss terms. Specifically, we introduce a new way to measure the similarity between the relaxed codes with centroids, called relative similarity. The relative similarity is the similarity between the relative position representation of continuous codes and the normalized centroids. The resulting model outperforms many state-of-the-art deep hashing models on popular benchmark datasets. © 2013 IEEE.
publisher: Institute of Electrical and Electronics Engineers Inc.
date: 2023
type: Article
type: PeerReviewed
identifier:   Minh, P.V.T. and Viet, N.D.D. and Son, N.T. and Anh, B.N. and Jaafar, J.  (2023) RelaHash: Deep Hashing with Relative Position.  IEEE Access, 11.  pp. 30094-30108.  ISSN 21693536     
relation: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85151499420&doi=10.1109%2fACCESS.2023.3259104&partnerID=40&md5=1b1f8c2f5ad5699144d6233747043778
relation: 10.1109/ACCESS.2023.3259104
identifier: 10.1109/ACCESS.2023.3259104