Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3343031.3350927acmconferencesArticle/Chapter ViewAbstractPublication PagesmmConference Proceedingsconference-collections
research-article

Deep Hashing by Discriminating Hard Examples

Published: 15 October 2019 Publication History

Abstract

This paper tackles a rarely explored but critical problem within learning to hash, i.e., to learn hash codes that effectively discriminate hard similar and dissimilar examples, to empower large-scale image retrieval. Hard similar examples refer to image pairs from the same semantic class that demonstrate some shared appearance but have different fine-grained appearance. Hard dissimilar examples are image pairs that come from different semantic classes but exhibit similar appearance. These hard examples generally have a small distance due to the shared appearance. Therefore, effective encoding of the hard examples can well discriminate the relevant images within a small Hamming distance, enabling more accurate retrieval in the top-ranked returned images. However, most existing hashing methods cannot capture this key information as their optimization is dominated byeasy examples, i.e., distant similar/dissimilar pairs that share no or limited appearance. To address this problem, we introduce a novel Gamma distribution-enabled and symmetric Kullback-Leibler divergence-based loss, which is dubbed dual hinge loss because it works similarly as imposing two smoothed hinge losses on the respective similar and dissimilar pairs. Specifically, the loss enforces exponentially variant penalization on the hard similar (dissimilar) examples to emphasize and learn their fine-grained difference. It meanwhile imposes a bounding penalization on easy similar (dissimilar) examples to prevent the dominance of the easy examples in the optimization while preserving the high-level similarity (dissimilarity). This enables our model to well encode the key information carried by both easy and hard examples. Extensive empirical results on three widely-used image retrieval datasets show that (i) our method consistently and substantially outperforms state-of-the-art competing methods using hash codes of the same length and (ii) our method can use significantly (e.g., 50%-75%) shorter hash codes to perform substantially better than, or comparably well to, the competing methods.

References

[1]
Galen Andrew, Raman Arora, Jeff Bilmes, and Karen Livescu. 2013. Deep canonical correlation analysis. In ICML. 1247--1255.
[2]
Xiao Bai, Cheng Yan, Haichuan Yang, Lu Bai, Jun Zhou, and Edwin Robert Hancock. 2018. Adaptive hash retrieval with kernel based similarity. Pattern Recognition, Vol. 75 (2018), 136--148.
[3]
Xiao Bai, Haichuan Yang, Jun Zhou, Peng Ren, and Jian Cheng. 2014. Data-dependent hashing based on p-stable distribution. IEEE Transactions on Image Processing, Vol. 23, 12 (2014), 5033--5046.
[4]
Yue Cao, Bin Liu, Mingsheng Long, Jianmin Wang, and MOE KLiss. 2018a. HashGAN: Deep Learning to Hash with Pair Conditional Wasserstein GAN. In CVPR . 1287--1296.
[5]
Yue Cao, Mingsheng Long, Bin Liu, Jianmin Wang, and MOE KLiss. 2018c. Deep Cauchy Hashing for Hamming Space Retrieval. In CVPR. 1229--1237.
[6]
Yue Cao, Mingsheng Long, Jianmin Wang, Qiang Yang, and Philip S. Yu. 2016. Deep Visual-Semantic Hashing for Cross-Modal Retrieval. In SIGKDD . 1445--1454.
[7]
Zhangjie Cao, Mingsheng Long, Chao Huang, and Jianmin Wang. 2018b. Transfer Adversarial Hashing for Hamming Space Retrieval. In AAAI. 6698--6075.
[8]
Zhangjie Cao, Mingsheng Long, Jianmin Wang, and S Yu Philip. 2017. HashNet: Deep Learning to Hash by Continuation. In ICCV. 5609--5618.
[9]
Tat-Seng Chua, Jinhui Tang, Richang Hong, Haojie Li, Zhiping Luo, and Yantao Zheng. 2009. NUS-WIDE: a real-world web image database from National University of Singapore. In ICMR . 48.
[10]
Cheng Deng, Zhaojia Chen, Xianglong Liu, Xinbo Gao, and Dacheng Tao. 2018. Triplet-based deep hashing network for cross-modal retrieval. IEEE Transactions on Image Processing, Vol. 27, 8 (2018), 3893--3903.
[11]
Kun Ding, Bin Fan, Chunlei Huo, Shiming Xiang, and Chunhong Pan. 2017. Cross-Modal Hashing via Rank-Order Preserving. IEEE Transactions on Multimedia, Vol. 19, 3 (2017), 571--585.
[12]
Yunchao Gong, Svetlana Lazebnik, Albert Gordo, and Florent Perronnin. 2013. Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 35, 12 (2013), 2916--2929.
[13]
Jie Gui, Tongliang Liu, Zhenan Sun, Dacheng Tao, and Tieniu Tan. 2018. Fast supervised discrete hashing. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 40, 2 (2018), 490--496.
[14]
Yanbin Hao, Tingting Mu, Richang Hong, Meng Wang, Ning An, and John Y Goulermas. 2017. Stochastic multiview hashing for large-scale near-duplicate video retrieval. IEEE Transactions on Multimedia, Vol. 19, 1 (2017), 1--14.
[15]
Kun He, Fatih Cakir, Sarah Adel Bargal, and Stan Sclaroff. 2018. Hashing as tie-aware learning to rank. In CVPR. 4023--4032.
[16]
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. 2016. Deep residual learning for image recognition. In CVPR. 770--778.
[17]
Qing-Yuan Jiang and Wu-Jun Li. 2016. Deep cross-modal hashing. In CVPR. 3232--3240.
[18]
Levent Karacan, Aykut Erdem, and Erkut Erdem. 2015. Image matting with KL-divergence based sparse sampling. In ICCV. 424--432.
[19]
Alex Krizhevsky and Geoffrey Hinton. 2009. Learning multiple layers of features from tiny images. In Techreport .
[20]
Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. 2012. ImageNet classification with deep convolutional neural networks. In NIPS . 1097--1105.
[21]
Brian Kulis and Trevor Darrell. 2009. Learning to hash with binary reconstructive embeddings. In NIPS . 1042--1050.
[22]
Hanjiang Lai, Yan Pan, Ye Liu, and Shuicheng Yan. 2015. Simultaneous feature learning and hash coding with deep neural networks. In CVPR . 3270--3278.
[23]
Kai Li, Guo Jun Qi, Jun Ye, and Kien A. Hua. 2017. Linear Subspace Ranking Hashing for Cross-Modal Retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 39, 9 (2017), 1825--1838.
[24]
Wu Jun Li, Sheng Wang, and Wang Cheng Kang. 2016. Feature learning based deep supervised hashing with pairwise labels. In IJCAI . 1711--1717.
[25]
Jie Lin, Zechao Li, and Jinhui Tang. 2017. Discriminative Deep Hashing for Scalable Face Image Retrieval. In IJCAI . 2266--2272.
[26]
Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollár, and C Lawrence Zitnick. 2014. Microsoft coco: Common objects in context. In ECCV. 740--755.
[27]
Venice Erin Liong, Jiwen Lu, Gang Wang, Pierre Moulin, and Jie Zhou. 2015. Deep hashing for compact binary codes learning. In CVPR. 2475--2483.
[28]
Li Liu, Fumin Shen, Yuming Shen, Xianglong Liu, and Ling Shao. 2017c. Deep sketch hashing: Fast free-hand sketch-based image retrieval. In CVPR . 2862--2871.
[29]
Wei Liu, Jun Wang, Rongrong Ji, Yu-Gang Jiang, and Shih-Fu Chang. 2012. Supervised hashing with kernels. In CVPR. 2074--2081.
[30]
Xianglong Liu, Cheng Deng, Bo Lang, Dacheng Tao, and Xuelong Li. 2015a. Query-adaptive reciprocal hash tables for nearest neighbor search. IEEE Transactions on Image Processing, Vol. 25, 2 (2015), 907--919.
[31]
Xianglong Liu, Junfeng He, and Shih-Fu Chang. 2017a. Hash bit selection for nearest neighbor search. IEEE Transactions on Image Processing, Vol. 26, 11 (2017), 5367--5380.
[32]
Xianglong Liu, Lei Huang, Cheng Deng, Bo Lang, and Dacheng Tao. 2016. Query-adaptive hash code ranking for large-scale multi-view visual search. IEEE Transactions on Image Processing, Vol. 25, 10 (2016), 4514--4524.
[33]
Xianglong Liu, Lei Huang, Cheng Deng, Jiwen Lu, and Bo Lang. 2015b. Multi-view complementary hash tables for nearest neighbor search. In CVPR . 1107--1115.
[34]
Xianglong Liu, Zhujin Li, Cheng Deng, and Dacheng Tao. 2017b. Distributed adaptive binary quantization for fast nearest neighbor search. IEEE Transactions on Image Processing, Vol. 26, 11 (2017), 5324--5336.
[35]
Fumin Shen, Chunhua Shen, Wei Liu, and Heng Tao Shen. 2015. Supervised discrete hashing. In CVPR. 37--45.
[36]
Fumin Shen, Yan Xu, Li Liu, Yang Yang, Zi Huang, and Heng Tao Shen. 2018. Unsupervised Deep Hashing with Similarity-Adaptive and Discrete Optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 40, 12 (2018), 3034--3044.
[37]
Fumin Shen, Yang Yang, Li Liu, Wei Liu, Dacheng Tao, and Heng Tao Shen. 2017. Asymmetric binary coding for image search. IEEE Transactions on Multimedia, Vol. 19, 9 (2017), 2022--2032.
[38]
Antonio Torralba, Rob Fergus, and Yair Weiss. 2008. Small codes and large image databases for recognition. In CVPR. 1--8.
[39]
Jun Wang, Sanjiv Kumar, and Shih-Fu Chang. 2012. Semi-supervised hashing for large-scale search. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 34, 12 (2012), 2393--2406.
[40]
Miao Xie, Jiankun Hu, Song Guo, and Albert Y Zomaya. 2017. Distributed Segment-Based Anomaly Detection With Kullback-Leibler Divergence in Wireless Sensor Networks. IEEE Transactions on Information Forensics and Security, Vol. 12, 1 (2017), 101--110.
[41]
X. Xu, F. Shen, Y. Yang, H. T. Shen, and X. Li. 2017. Learning Discriminative Binary Codes for Large-scale Cross-modal Retrieval. IEEE Transactions on Image Processing, Vol. 26, 5 (2017), 2494--2507.
[42]
Haichuan Yang, Xiao Bai, Jun Zhou, Peng Ren, Zhihong Zhang, and Jian Cheng. 2014. Adaptive object retrieval with kernel reconstructive hashing. In CVPR . 1947--1954.
[43]
Han Zhu, Mingsheng Long, Jianmin Wang, and Yue Cao. 2016. Deep Hashing Network for efficient similarity retrieval. In AAAI. 2415--2421.
[44]
Bohan Zhuang, Guosheng Lin, Chunhua Shen, and Ian Reid. 2016. Fast training of triplet-based deep binary embedding networks. In CVPR . 5955--5964.

Cited By

View all
  • (2024)FedCAFE: Federated Cross-Modal Hashing with Adaptive Feature EnhancementProceedings of the 32nd ACM International Conference on Multimedia10.1145/3664647.3681319(9670-9679)Online publication date: 28-Oct-2024
  • (2024)Unsupervised Deep Triplet Hashing for Image RetrievalIEEE Signal Processing Letters10.1109/LSP.2024.340435031(1489-1493)Online publication date: 2024
  • (2023)Complex Scenario Image Retrieval via Deep Similarity-aware HashingACM Transactions on Multimedia Computing, Communications, and Applications10.1145/362401620:4(1-24)Online publication date: 13-Sep-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
MM '19: Proceedings of the 27th ACM International Conference on Multimedia
October 2019
2794 pages
ISBN:9781450368896
DOI:10.1145/3343031
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 October 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. deep hashing
  2. hard examples
  3. hinge loss
  4. image retrieval

Qualifiers

  • Research-article

Funding Sources

  • National Natural Science Foundation of China
  • State Key Lab. of Software Development Environment and Jiangxi and Qingdao Research Institute of Beihang University

Conference

MM '19
Sponsor:

Acceptance Rates

MM '19 Paper Acceptance Rate 252 of 936 submissions, 27%;
Overall Acceptance Rate 2,145 of 8,556 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)9
  • Downloads (Last 6 weeks)2
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)FedCAFE: Federated Cross-Modal Hashing with Adaptive Feature EnhancementProceedings of the 32nd ACM International Conference on Multimedia10.1145/3664647.3681319(9670-9679)Online publication date: 28-Oct-2024
  • (2024)Unsupervised Deep Triplet Hashing for Image RetrievalIEEE Signal Processing Letters10.1109/LSP.2024.340435031(1489-1493)Online publication date: 2024
  • (2023)Complex Scenario Image Retrieval via Deep Similarity-aware HashingACM Transactions on Multimedia Computing, Communications, and Applications10.1145/362401620:4(1-24)Online publication date: 13-Sep-2023
  • (2023)DANCE: Learning A Domain Adaptive Framework for Deep HashingProceedings of the ACM Web Conference 202310.1145/3543507.3583445(3319-3330)Online publication date: 30-Apr-2023
  • (2023)HHF: Hashing-Guided Hinge Function for Deep Hashing RetrievalIEEE Transactions on Multimedia10.1109/TMM.2022.322259825(7428-7440)Online publication date: 2023
  • (2023)Hash Bit Selection With Reinforcement Learning for Image RetrievalIEEE Transactions on Multimedia10.1109/TMM.2022.321347625(6678-6687)Online publication date: 2023
  • (2023)Deep Learning for Approximate Nearest Neighbour Search: A Survey and Future DirectionsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.322068335:9(8997-9018)Online publication date: 1-Sep-2023
  • (2023)Toward Effective Domain Adaptive RetrievalIEEE Transactions on Image Processing10.1109/TIP.2023.324277732(1285-1299)Online publication date: 2023
  • (2023)Feature Prediction Diffusion Model for Video Anomaly Detection2023 IEEE/CVF International Conference on Computer Vision (ICCV)10.1109/ICCV51070.2023.00509(5504-5514)Online publication date: 1-Oct-2023
  • (2023)Deep cross-modal hashing with fine-grained similarityApplied Intelligence10.1007/s10489-023-05028-y53:23(28954-28973)Online publication date: 19-Oct-2023
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media