{"title":"Similarity Measurement Based on Non-linear Hash Coding","authors":"Jinjin Zhu, Yaping Cai","doi":"10.1145/3424978.3425103","DOIUrl":null,"url":null,"abstract":"We propose an algorithm named non-linear deep hash (NLDH) to encode the object in the image into a series of compact binary codes through a structure called a non-linear hash coding module. Based on this, then, we propose a retrieval algorithm for similar images based on these binary codes in the image. This algorithm adopts the strategy from coarse-to-fine. Then the image level similarity calculation is carried out to complete the search of the most similar images. Finally, experiments were carried out on the Oxford buildings dataset and ancient painting image dataset in this paper. The experimental results show that our proposed algorithm has a higher retrieval ability than the ordinary deep hash method, and the retrieval accuracy and recall rate are greatly improved.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3424978.3425103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We propose an algorithm named non-linear deep hash (NLDH) to encode the object in the image into a series of compact binary codes through a structure called a non-linear hash coding module. Based on this, then, we propose a retrieval algorithm for similar images based on these binary codes in the image. This algorithm adopts the strategy from coarse-to-fine. Then the image level similarity calculation is carried out to complete the search of the most similar images. Finally, experiments were carried out on the Oxford buildings dataset and ancient painting image dataset in this paper. The experimental results show that our proposed algorithm has a higher retrieval ability than the ordinary deep hash method, and the retrieval accuracy and recall rate are greatly improved.