mlsanityData to 7 Oct 2026

BDA-SketRet: Bi-Level Domain Adaptation for Zero-Shot SBIR

arXiv 2201.06570 ↗First posted 17 Jan 2022cs.CV cs.IR cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

The efficacy of zero-shot sketch-based image retrieval (ZS-SBIR) models is governed by two challenges. The immense distributions-gap between the sketches and the images requires a proper domain alignment. Moreover, the fine-grained nature of the task and the high intra-class variance of many categories necessitates a class-wise discriminative mapping among the sketch, image, and the semantic spaces. Under this premise, we propose BDA-SketRet, a novel ZS-SBIR framework performing a bi-level domain adaptation for aligning the spatial and semantic features of the visual data pairs progressively. In order to highlight the shared features and reduce the effects of any sketch or image-specific artifacts, we propose a novel symmetric loss function based on the notion of information bottleneck for aligning the semantic features while a cross-entropy-based adversarial loss is introduced to align the spatial feature maps. Finally, our CNN-based model confirms the discriminativeness of the shared latent space through a novel topology-preserving semantic projection network. Experimental results on the extended Sketchy, TU-Berlin, and QuickDraw datasets exhibit sharp improvements over the literature.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 28 of its 56 references that are in the map. First posted on arXiv 17 Jan 2022.

Builds on

28 of 56 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  5. 2017Squeeze-and-Excitation Networkscited by 4,763
  6. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  7. 2016Enriching Word Vectors with Subword Informationcited by 1,578
  8. 2018ImageNet-trained CNNs are biased towards texture; increasing shape bias improves accuracy and robustnesscited by 1,430
  9. 2016Deep Variational Information Bottleneckcited by 915
  10. 2015Deep Learning and the Information Bottleneck Principlecited by 793
  11. 2017Feature Generating Networks for Zero-Shot Learningcited by 257
  12. 2017Zero-Shot Learning -- The Good, the Bad and the Uglycited by 254
16 more
  1. 2018Auto-Encoding Scene Graphs for Image Captioningcited by 254
  2. 2020Learning Robust Representations via Multi-View Information Bottleneckcited by 189
  3. 2018Rethinking Knowledge Graph Propagation for Zero-Shot Learningcited by 87
  4. 2019Doodle to Search: Practical Zero-Shot Sketch-based Image Retrievalcited by 79
  5. 2018A Zero-Shot Framework for Sketch-based Image Retrievalcited by 70
  6. 2017Deep Sketch Hashing: Fast Free-hand Sketch-Based Image Retrievalcited by 68
  7. 2019Semantically Tied Paired Cycle Consistency for Zero-Shot Sketch-based Image Retrievalcited by 57
  8. 2018Zero-Shot Sketch-Image Hashingcited by 43
  9. 2019Semantic-Aware Knowledge Preservation for Zero-Shot Sketch-Based Image Retrievalcited by 40
  10. 2021An Efficient Framework for Zero-Shot Sketch-Based Image Retrievalcited by 15
  11. 2020Stacked Adversarial Network for Zero-Shot Sketch based Image Retrievalcited by 11
  12. 2020Progressive Domain-Independent Feature Decomposition Network for Zero-Shot Sketch-Based Image Retrievalcited by 10
  13. 2020Semantically Tied Paired Cycle Consistency for Any-Shot Sketch-based Image Retrievalcited by 10
  14. 2019Semi-Heterogeneous Three-Way Joint Embedding Network for Sketch-Based Image Retrievalcited by 9
  15. 2021CrossATNet - A Novel Cross-Attention Based Framework for Sketch-Based Image Retrievalcited by 9
  16. 2019Open Cross-Domain Visual Searchcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 4; 2025: 0; 2026: 1.

8 papers.