darrenzzhang / ipm22-olgh

Learning Ordinal Constraint Binary Codes for Fast Similarity Search

Ordinal-Preserving Latent Graph Hashing (OLGH)

The details can be found in the IPM 2022 paper.

This code has successfully been evaluated on Matlab.

Resources:

We supply the Cifar10 and Caltech256 datasets, which can be downloaded from the Dataset link.

Citation:

If you find our approach useful in your research, please consider citing:

Zheng Zhang, Chi Man Pun, ``Learning Ordinal Constraint Binary Codes for Fast Similarity Search," Under the consideration of Information Processing & Management (IPM), 2022.

@article{zhang2019binary,  
  title={Learning Ordinal Constraint Binary Codes for Fast Similarity Search},  
  author={Zhang, Zheng and Pun, Chi Man},  
  journal={Information Processing and Management},  
  volume={59},  
  number={3},  
  pages={1--21},  
  year={2022},  
  publisher={Elsevier}  
}