Pith. sign in

REVIEW 5 major objections 6 minor 43 references

Relation-Aware Meta-Learning for Zero-shot Sketch-Based Image Retrieval

T0 review · 5 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A quadruplet loss with a meta-learned margin lifts zero-shot sketch search

desk verdict A plausible new loss formulation with a genuinely unexplained meta-learning core: the adaptive margin has no training objective in the main text, so the central claim is unverifiable as submitted. read the letter →

arxiv 2412.00120 v1 pith:JP4PQELX submitted 2024-11-28 cs.CV cs.AI

Yang Liu , Jiale Du , Xinbo Gao , Jungong Han This is my paper · ORCID
classification cs.CVcs.AI
keywords zero-shotsketch-basedimageretrievalrelation-awarequadrupletlossmeta-learningadaptivemarginmetriclearningcross-modalexternalmemoryGRUrelationnetwork
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Sketch-based image retrieval lets a user find photos by drawing a rough sketch, but standard systems fail when the query's category was never seen in training. The paper argues that the root cause is twofold: triplet losses leave the embedding space unbalanced between sketch and photo modalities, and the metric-learning margin is a fixed number that cannot adapt to new categories. To address this, it introduces RAMLN, which uses a relation-aware quadruplet loss with two negative samples from different modalities and learns the loss margin through a memory-augmented meta-learning network. On the two standard benchmarks, TU-Berlin Extended and Sketchy, the method reports large improvements over existing methods without using semantic side information, including 0.649 mAP@all on TU-Berlin Extended.

What carries the argument

The engine of the method is the relation-aware quadruplet loss $$L_{qua}=D(x_a,x_p)-(1-\$\lambda$)D(x_a,x_{n1})-\$\lambda$ D(x_a,x_{n2})+R(x),$$ where $D$ is the squared Euclidean distance, $x_a$ is the anchor (a sketch or a photo), $x_p$ is the hardest positive, and $x_{n1},x_{n2}$ are negative samples from the other and from the anchor's own modality. A global inter-modal quadruplet and a local intra-modal quadruplet are combined, and hard mining selects the farthest positive and the closest negatives. The margin $R(x)$ is computed by a bidirectional GRU whose hidden states are pooled, then combined with a read from an external memory matrix through weighted keys, then passed through a linear layer with ReLU to produce two sigmoid-normalized scalars. A softmax cross-entropy classification head is added to the embedding to stabilize training and avoid local optima.

What would settle it

Train RAMLN on the standard seen split, then freeze the backbone and margin network and, on the unseen classes, replace each learned $R(x)$ with a grid-searched fixed margin; if the fixed margin matches or beats the learned one, the generalization claim fails. Additionally, run the same model with the external memory read replaced by a random vector; if accuracy does not drop materially, the memory is not doing the work assigned to it.

Watch

Extended reading notes

Core claim

The central claim is that replacing the standard triplet loss with a relation-aware quadruplet loss, and making the loss margin a learned function of the input rather than a fixed constant, yields an embedding in which unseen classes are well separated and sketches and photos of the same class are well merged. The quadruplet pairs an anchor with one positive and two negatives from different modalities, so the anchor is pushed away from the other modality and from its own modality at the same time; both sketches and photos serve as anchors. The margin $R(x)$ is produced by a GRU-based relation network that reads an external memory matrix and outputs two values, one for the inter-modal term and one for the intra-modal term. In the paper's experiments, RAMLN reaches 0.649 mAP@all and 0.719 Prec@100 on TU-Berlin Extended, and 0.695 mAP@200 on Sketchy-NO, surpassing all compared ViT-based methods that do not use semantic labels.

Load-bearing premise

The load-bearing premise is that margins learned from the seen classes will also be right for unseen classes, even though the margin network is trained only on seen data and the main text defers its meta-objective to the supplementary.

Editorial extensions

If this is right

  • On the two standard benchmarks, RAMLN outperforms every compared method that does not use semantic side information, including the strong ViT-based baselines.
  • The learned margin removes the need to hand-tune the margin hyper-parameter, adapting per category and per modality instead.
  • Using both sketches and photos as anchors closes the sketch-photo gap for unseen classes and improves inter-class separation.
  • Ablations show the classification loss and the quadruplet loss reinforce each other, and the meta-learned margin beats a fixed margin of 0.3.
  • Because no semantic text vectors are needed, the method is a cheaper alternative to semantic-augmented ZS-SBIR pipelines.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The main text does not specify a separate meta-objective for the margin network; if the margin is learned only by joint gradient descent, the claimed 'meta-learning' could reduce to ordinary training, and the gain might come mostly from the quadruplet geometry.
  • The external memory's contribution is not isolated in the ablations; replacing the memory read with a random vector would show whether stored features are actually load-bearing.
  • A direct transfer test, training on half of the seen classes and generating margins for the other half, would show whether margins generalize to categories the network has never seen.
  • If the margin network does generalize, the same two-negative, memory-guided loss could transfer to other cross-modal retrieval settings such as text-to-image or sketch-to-3D.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 6 minor

Summary. The manuscript proposes RAMLN for zero-shot sketch-based image retrieval (ZS-SBIR). It introduces a relation-aware quadruplet loss that uses two negative samples from different modalities to reduce the sketch–photo modality gap, a hard-mining variant based on Eq. (4), and a GRU-plus-external-memory module that predicts the quadruplet margin R(x), which the paper calls meta-learning. The training objective combines the quadruplet loss with a softmax classification loss. Experiments on TU-Berlin Extended and Sketchy (NO and Extended) report strong gains over prior work, e.g., 0.649 mAP@all and 0.719 Prec@100 on TU-Berlin Extended and 0.695 mAP@200 on Sketchy-NO, and the paper includes ablations and qualitative visualizations.

Significance. If fully supported, the paper would make a useful contribution to ZS-SBIR: an adaptive-margin quadruplet loss is a plausible way to handle the large intra-class sketch/photo spread, and the reported numbers are competitive with recent ViT-based methods. The paper is also reasonably thorough in its ablations and includes qualitative t-SNE and retrieval examples. However, the central meta-learning mechanism is not actually specified in the main text, the gradient derivation in Eq. (3) is incorrect, and the reported SOTA comparisons are internally inconsistent. These issues are load-bearing because the paper's novelty and the claimed transfer to unseen classes rest on the meta-learned margin. Without a meta-objective, the method is indistinguishable from a jointly trained margin predictor, and the empirical claims cannot be verified with the current text. The absence of code and error bars further limits reproducibility.

major comments (5)
  1. [Sec. 3.3, Algorithm 1] The meta-learning objective for the margin network is not defined. Equations (5), (6), and (8) use R(x) and m_t, but no loss, meta-train/meta-validation split, or update rule for the margin predictor appears in the main text; Algorithm 1 only updates θ with ∇θ(L_cls + λL_qua). The paper defers to the supplementary materials for "a detailed explanation of the margin optimization in meta-learning," but the core method must be self-contained. As written, the margin predictor is trained jointly on the seen classes, so the claim that it predicts optimal margins for unseen classes is unsupported; the method could be memorizing seen-class margins.
  2. [Eq. (3)] The gradient with respect to the negative sample is algebraically wrong. For L_tri = ||xa − xp||^2 − ||xa − xn||^2, the correct expression is −∂L_tri/∂xn = −2(xa − xn), not −2(xn − xp). Because the paper uses this gradient discussion to motivate the second negative in the quadruplet loss, the mathematical motivation is invalid as written.
  3. [Table 1 and Sec. 4.2] The claimed "8.0% and 17% improvement in mAP over ZSE on the two datasets" cannot be reproduced from Table 1. Against ZSE-Ret the TU-Berlin gain is 8.0 points but the Sketchy-NO gain is 19.1 points; against ZSE-RN the Sketchy-NO gain is 17.0 points but the TU-Berlin gain is 10.7 points. The sentence therefore mixes two different ZSE baselines. Similarly, the "9.2% and 8.0%" improvement over IVT matches only the TU-Berlin mAP@all and Sketchy-NO mAP@200 columns; on Sketchy Extended the gap is 0.7 points. State the comparison per baseline and per evaluation column.
  4. [Algorithm 1, Eqs. (5), (6), (10)] Hyperparameters β and φ are listed as inputs but never defined or used anywhere in the paper. The use of λ is also ambiguous: it balances the two negative terms inside Eqs. (5) and (6), but Algorithm 1 uses λ as the global weight on the entire quadruplet loss in the update rule, while Eq. (10) omits it entirely. These inconsistencies make the optimization objective non-reproducible.
  5. [Sec. 3.3, Eq. (8)] The memory-augmented margin predictor is underspecified. The read weights w_t^r(i), write weights w_t^w(i), keys k_t, and the memory update M_t(i) ← M_{t−1}(i) + w_t^w(i)k_t are not defined or normalized, and no formula connects m_t to R(x) beyond a verbal description. Since the memory is claimed to help unseen classes by recording uncommon seen-class information, these missing definitions block verification of the generalization mechanism.
minor comments (6)
  1. [Sec. 4.1] The text states that in TU-Berlin Extended "the number of photos is one-tenth that of sketches," but the set contains 204,070 photos and 20,000 sketches; the ratio is reversed.
  2. [Sec. 3.2] The phrase "hard positive pairs (the closest negative sample and anchor)" should read "hard negative pairs"; hard positives are the farthest positive pairs, as encoded by max in Eq. (4).
  3. [Sec. 3.2] The text says "quadratic loss" where "quadruplet loss" is meant, and "for simplify" should be "for simplicity."
  4. [Eq. (4)] The max/min in Eq. (4) do not specify the set of samples over which they are taken; define the batch-level search range.
  5. [Algorithm 1 / Eq. (1)] The learning rate is denoted μ, which conflicts with the triplet margin μ in Eq. (1); use separate symbols.
  6. [Table 2] All results are single runs with no standard deviations; given that several differences are small (e.g., 0.008 in mAP@all between rows 3 and 5), it is hard to judge whether the margin component helps significantly.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the learned margin is an empirical generalization claim; the missing meta-objective is a completeness defect, not a circular reduction.

full rationale

RAMLN's central mechanism is a learned margin R(x) produced by a GRU relation network with external memory, trained jointly with the embedding through the same quadruplet loss it regularizes, and then applied to unseen classes. This is a standard learned-hyperparameter/generalization claim rather than a circular one: the paper does not define R(x) in terms of the reported metrics, nor does it fit a ground-truth target and then rename the fit as a prediction. The absence from the main text of the meta-objective and update rule for the margin network is a real completeness and verifiability defect (the paper defers to supplementary, and Algorithm 1 never uses hyperparameters beta or phi), but missing support is not circularity under the stated rules. There are no load-bearing self-citations: the cited memory-augmented meta-learning work is independent prior art, and performance is compared against external baselines. The relation-aware quadruplet loss resembles SBTKNet's two-negative design, which is a novelty concern, not a circularity concern. No equation in the paper reduces to its own input by construction, so no specific circular reduction can be exhibited, and the score is 0.

Assumptions & free parameters 3 free parameters · 4 assumptions · 1 invented entities

The central claim rests on a learned margin (a fitted quantity) and several unstated assumptions, while the key meta-objective is deferred to a missing supplementary.

free parameters (3)
  • lambda (balancing weight) = not specified
    Balancing weight between the two negative terms in the quadruplet loss (Eqs. 5, 6). Chosen by hand; no value given in the main text.
  • beta, phi = not specified
    Listed as hyper-parameters in Algorithm 1 but never defined or assigned values in the main text.
  • Fixed margin mu = 0.3
    Used in the ablation baseline when the learned margin is disabled (Table 2).
assumptions (4)
  • domain assumption Euclidean distance squared is the proper metric for sketch-photo similarity
    Used throughout the loss definitions (Eq. 2 and Section 3.2); no justification given.
  • ad hoc to paper Two negative samples from different modalities improve inter-class separability
    Central motivation for the quadruplet loss (Section 3.2); asserted with intuition but no proof.
  • ad hoc to paper Hard-mining with min/max pairs (Eq. 4) speeds convergence and improves accuracy
    Adopted in Section 3.2 as a design choice; no comparison with random sampling.
  • ad hoc to paper The GRU/memory network can predict optimal margins for unseen classes
    The key meta-learning assumption (Section 3.3), not supported by analysis in the main text.
invented entities (1)
  • External memory matrix M_t
    purpose: Stores feature information to assist the relation network in predicting margin values (Section 3.3).
    A model component introduced in the paper; no external validation that it improves generalization beyond the reported results.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Relation-Aware Meta-Learning for Zero-shot Sketch-Based Image Retrieval." pith.science (2026). https://pith.science/paper/JP4PQELX

@misc{pith2026241200120,
  author       = {Pith},
  title        = {Pith review of: Relation-Aware Meta-Learning for Zero-shot Sketch-Based Image Retrieval},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JP4PQELX}},
  note         = {Machine review of arXiv:2412.00120}
}
read the original abstract

Sketch-based image retrieval (SBIR) relies on free-hand sketches to retrieve natural photos within the same class. However, its practical application is limited by its inability to retrieve classes absent from the training set. To address this limitation, the task has evolved into Zero-Shot Sketch-Based Image Retrieval (ZS-SBIR), where model performance is evaluated on unseen categories. Traditional SBIR primarily focuses on narrowing the domain gap between photo and sketch modalities. However, in the zero-shot setting, the model not only needs to address this cross-modal discrepancy but also requires a strong generalization capability to transfer knowledge to unseen categories. To this end, we propose a novel framework for ZS-SBIR that employs a pair-based relation-aware quadruplet loss to bridge feature gaps. By incorporating two negative samples from different modalities, the approach prevents positive features from becoming disproportionately distant from one modality while remaining close to another, thus enhancing inter-class separability. We also propose a Relation-Aware Meta-Learning Network (RAMLN) to obtain the margin, a hyper-parameter of cross-modal quadruplet loss, to improve the generalization ability of the model. RAMLN leverages external memory to store feature information, which it utilizes to assign optimal margin values. Experimental results obtained on the extended Sketchy and TU-Berlin datasets show a sharp improvement over existing state-of-the-art methods in ZS-SBIR.

Figures

Figures reproduced from arXiv: 2412.00120 by the authors.

Figure 1
Figure 1. (a) and (b) respectively illustrate the performance of the [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The overall structure of the proposed method. The image encoder extracts features from both sketches and photos in the embed [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 4
Figure 4. Top 7 image retrieval examples of TU-Berlin and [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figures from the paper (1 more)
Figure 3
Figure 3. Figure 3: T-SNE visualization of sketch and photo embeddings [PITH_FULL_IMAGE:figures/full_fig_p008_3.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

43 extracted references · 34 canonical work pages

  1. [1]

    Learning to learn by gradient descent by gradient descent

    Marcin Andrychowicz, Misha Denil, Sergio Gomez, Matthew W Hoffman, David Pfau, Tom Schaul, Brendan Shillingford, and Nando De Freitas. Learning to learn by gradient descent by gradient descent. Advances in neural information processing systems, 29, 2016. 3

    work page 2016

  2. [2]

    Progressive cross-modal semantic network for zero-shot sketch-based image retrieval

    Cheng Deng, Xinxun Xu, Hao Wang, Muli Yang, and Dacheng Tao. Progressive cross-modal semantic network for zero-shot sketch-based image retrieval. IEEE Transactions on Image Processing, 29:8892–8902, 2020. 7

    work page 2020

  3. [3]

    Doodle to search: Practical zero-shot sketch- based image retrieval

    Sounak Dey, Pau Riba, Anjan Dutta, Josep Llados, and Yi- Zhe Song. Doodle to search: Practical zero-shot sketch- based image retrieval. InProceedings of the IEEE/CVF Con- ference on Computer Vision and Pattern Recognition, pages 2179–2188, 2019. 2, 7

    work page 2019

  4. [4]

    Semantically tied paired cycle consistency for zero-shot sketch-based image retrieval

    Anjan Dutta and Zeynep Akata. Semantically tied paired cycle consistency for zero-shot sketch-based image retrieval. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 5089–5098, 2019. 2, 7

    work page 2019

  5. [5]

    Adaptive margin diversity regularizer for handling data imbalance in zero-shot sbir

    Titir Dutta, Anurag Singh, and Soma Biswas. Adaptive margin diversity regularizer for handling data imbalance in zero-shot sbir. In European Conference on Computer Vision, pages 349–364. Springer, 2020. 2

    work page 2020

  6. [6]

    How do humans sketch objects? ACM Transactions on graphics (TOG) , 31 (4):1–10, 2012

    Mathias Eitz, James Hays, and Marc Alexa. How do humans sketch objects? ACM Transactions on graphics (TOG) , 31 (4):1–10, 2012. 6

    2012

  7. [7]

    Learning to discover novel visual categories via deep transfer cluster- ing

    Kai Han, Andrea Vedaldi, and Andrew Zisserman. Learning to discover novel visual categories via deep transfer cluster- ing. In Proceedings of the IEEE/CVF International Confer- ence on Computer Vision, pages 8401–8409, 2019. 2

    work page 2019

  8. [8]

    In de- fense of the triplet loss for person re-identification

    Alexander Hermans, Lucas Beyer, and Bastian Leibe. In de- fense of the triplet loss for person re-identification. arXiv preprint arXiv:1703.07737, 2017. 6

    arXiv 2017

Show all 43 references
  1. [9]

    A performance evaluation of gradient field hog descriptor for sketch based image re- trieval

    Rui Hu and John Collomosse. A performance evaluation of gradient field hog descriptor for sketch based image re- trieval. Computer Vision and Image Understanding, 117(7): 790–806, 2013. 2

    2013

  2. [10]

    Variational interaction information max- imization for cross-domain disentanglement

    HyeongJoo Hwang, Geon-Hyeong Kim, Seunghoon Hong, and Kee-Eung Kim. Variational interaction information max- imization for cross-domain disentanglement. Advances in Neural Information Processing Systems , 33:22479–22491,

  3. [11]

    Augmented multimodality fusion for generalized zero- shot sketch-based visual retrieval

    Taotao Jing, Haifeng Xia, Jihun Hamm, and Zhengming Ding. Augmented multimodality fusion for generalized zero- shot sketch-based visual retrieval. IEEE Transactions on Im- age Processing, 31:3657–3668, 2022. 2

    2022

  4. [12]

    Adam: A method for stochastic optimization

    Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 ,

    arXiv

  5. [13]

    Semantic autoencoder for zero-shot learning

    Elyor Kodirov, Tao Xiang, and Shaogang Gong. Semantic autoencoder for zero-shot learning. In Proceedings of the IEEE conference on computer vision and pattern recogni- tion, pages 3174–3183, 2017. 7

    2017

  6. [14]

    Attribute- modulated generative meta learning for zero-shot learning

    Yun Li, Zhe Liu, Lina Yao, and Xiaojun Chang. Attribute- modulated generative meta learning for zero-shot learning. IEEE Transactions on Multimedia, 25:1600–1610, 2023. 3

    2023

  7. [15]

    Zero-shot everything sketch- based image retrieval, and in explainable style

    Fengyin Lin, Mingkang Li, Da Li, Timothy Hospedales, Yi- Zhe Song, and Yonggang Qi. Zero-shot everything sketch- based image retrieval, and in explainable style. arXiv preprint arXiv:2303.14348, 2023. 3, 7

    2023 arXiv

  8. [16]

    Deep sketch hashing: Fast free-hand sketch-based image retrieval

    Li Liu, Fumin Shen, Yuming Shen, Xianglong Liu, and Ling Shao. Deep sketch hashing: Fast free-hand sketch-based image retrieval. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 2862–2871,

  9. [17]

    Learning memory-guided normality for anomaly detection

    Hyunjong Park, Jongyoun Noh, and Bumsub Ham. Learning memory-guided normality for anomaly detection. In Pro- ceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 14372–14381, 2020. 3

    2020

  10. [18]

    Automatic differentiation in pytorch

    Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Al- ban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in pytorch. 2017. 6

    2017

  11. [19]

    Sketch3t: Test-time training for zero-shot sbir

    Aneeshan Sain, Ayan Kumar Bhunia, Vaishnav Potlapalli, Pinaki Nath Chowdhury, Tao Xiang, and Yi-Zhe Song. Sketch3t: Test-time training for zero-shot sbir. In Proceed- ings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 7462–7471, 2022. 7

    2022

  12. [20]

    The sketchy database: learning to retrieve badly drawn bunnies

    Patsorn Sangkloy, Nathan Burnell, Cusuh Ham, and James Hays. The sketchy database: learning to retrieve badly drawn bunnies. ACM Transactions on Graphics (TOG), 35(4):1–12,

  13. [21]

    Meta-learning with memory-augmented neural networks

    Adam Santoro, Sergey Bartunov, Matthew Botvinick, Daan Wierstra, and Timothy Lillicrap. Meta-learning with memory-augmented neural networks. In International con- ference on machine learning , pages 1842–1850. PMLR,

  14. [22]

    Zero- shot sketch-image hashing

    Yuming Shen, Li Liu, Fumin Shen, and Ling Shao. Zero- shot sketch-image hashing. In Proceedings of the IEEE Con- ference on Computer Vision and Pattern Recognition, pages 3598–3607, 2018. 1, 2, 6, 7

    2018

  15. [23]

    Deep spatial-semantic attention for fine- grained sketch-based image retrieval

    Jifei Song, Qian Yu, Yi-Zhe Song, Tao Xiang, and Timo- thy M Hospedales. Deep spatial-semantic attention for fine- grained sketch-based image retrieval. In Proceedings of the IEEE international conference on computer vision , pages 5551–5560, 2017. 2

    2017

  16. [24]

    Cross-modal attention alignment network with aux- iliary text description for zero-shot sketch-based image re- trieval

    Hanwen Su, Ge Song, Kai Huang, Jiyan Wang, and Ming Yang. Cross-modal attention alignment network with aux- iliary text description for zero-shot sketch-based image re- trieval. In Artificial Neural Networks and Machine Learning – ICANN 2024, pages 52–65, 2024. 7

    2024

  17. [25]

    Learning to learn: Meta-critic networks for sample efficient learning

    Flood Sung, Li Zhang, Tao Xiang, Timothy Hospedales, and Yongxin Yang. Learning to learn: Meta-critic networks for sample efficient learning. arXiv preprint arXiv:1706.09529,

    arXiv

  18. [26]

    Relationship-preserving knowledge distillation for zero- shot sketch based image retrieval

    Jialin Tian, Xing Xu, Zheng Wang, Fumin Shen, and Xin Liu. Relationship-preserving knowledge distillation for zero- shot sketch based image retrieval. InProceedings of the 29th ACM International Conference on Multimedia, pages 5473– 5481, 2021. 7

    2021

  19. [27]

    Tvt: Three-way vision transformer through multi- modal hypersphere learning for zero-shot sketch-based im- age retrieval

    Jialin Tian, Xing Xu, Fumin Shen, Yang Yang, and Heng Tao Shen. Tvt: Three-way vision transformer through multi- modal hypersphere learning for zero-shot sketch-based im- age retrieval. 2022. 7

    2022

  20. [28]

    Structure-aware semantic-aligned net- work for universal cross-domain retrieval

    Jialin Tian, Xing Xu, Kai Wang, Zuo Cao, Xunliang Cai, and Heng Tao Shen. Structure-aware semantic-aligned net- work for universal cross-domain retrieval. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval , pages...

  21. [29]

    Zero-shot sketch-based image retrieval with adaptive balanced discriminability and generalizability

    Jialin Tian, Xing Xu, Zuo Cao, Gong Zhang, Fumin Shen, and Yang Yang. Zero-shot sketch-based image retrieval with adaptive balanced discriminability and generalizability. In Proceedings of the 2023 ACM International Conference on Multimedia Retrieval, pages 407–415, 2023. 3

    2023

  22. [30]

    An efficient framework for zero- shot sketch-based image retrieval

    Osman Tursun, Simon Denman, Sridha Sridharan, Ethan Goan, and Clinton Fookes. An efficient framework for zero- shot sketch-based image retrieval. Pattern Recognition, 126: 108528, 2022. 2

    2022

  23. [31]

    Matching networks for one shot learning.Ad- vances in neural information processing systems , 29, 2016

    Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Daan Wierstra, et al. Matching networks for one shot learning.Ad- vances in neural information processing systems , 29, 2016. 3

    2016

  24. [32]

    Transferable coupled network for zero-shot sketch-based im- age retrieval

    Hao Wang, Cheng Deng, Tongliang Liu, and Dacheng Tao. Transferable coupled network for zero-shot sketch-based im- age retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021. 2, 7

    2021

  25. [33]

    Prototype-based selective knowledge distillation for zero-shot sketch based image retrieval

    Kai Wang, Yifan Wang, Xing Xu, Xin Liu, Weihua Ou, and Huimin Lu. Prototype-based selective knowledge distillation for zero-shot sketch based image retrieval. In Proceedings of the 30th ACM International Conference on Multimedia , pages 601–609, 2022. 7

    2022

  26. [34]

    Norm-guided adaptive visual embedding for zero-shot sketch-based image retrieval

    Wenjie Wang, Yufeng Shi, Shiming Chen, Qinmu Peng, Feng Zheng, and Xinge You. Norm-guided adaptive visual embedding for zero-shot sketch-based image retrieval. In IJ- CAI, pages 1106–1112, 2021. 7

    2021

  27. [35]

    Cross-domain alignment for zero-shot sketch- based image retrieval

    Xu Wang, Dezhong Peng, Peng Hu, Yunhong Gong, and Yong Chen. Cross-domain alignment for zero-shot sketch- based image retrieval. IEEE Transactions on Circuits and Systems for Video Technology, 2023. 7

    2023

  28. [36]

    Domain-smoothing network for zero-shot sketch- based image retrieval

    Zhipeng Wang, Hao Wang, Jiexi Yan, Aming Wu, and Cheng Deng. Domain-smoothing network for zero-shot sketch- based image retrieval. arXiv preprint arXiv:2106.11841 ,

    arXiv

  29. [37]

    Learning dynamic mem- ory networks for object tracking

    Tianyu Yang and Antoni B Chan. Learning dynamic mem- ory networks for object tracking. In Proceedings of the Eu- ropean conference on computer vision (ECCV) , pages 152– 167, 2018. 3

    2018

  30. [38]

    A zero-shot framework for sketch based image retrieval

    Sasi Kiran Yelamarthi, Shiva Krishna Reddy, Ashish Mishra, and Anurag Mittal. A zero-shot framework for sketch based image retrieval. In Proceedings of the European Conference on Computer Vision (ECCV), pages 300–317, 2018. 6, 7

    2018

  31. [39]

    Z. Yin, J. Yan, C. Xu, and C. Deng. Asymmetric mutual alignment for unsupervised zero-shot sketch-based image re- trieval. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 16504–16512, 2024. 7

    2024

  32. [40]

    Indicative vision transformer for end-to-end zero-shot sketch-based image retrieval

    Haoxiang Zhang, Deqiang Cheng, Qiqi Kou, Mujtaba Asad, and He Jiang. Indicative vision transformer for end-to-end zero-shot sketch-based image retrieval. Advanced Engineer- ing Informatics, 60:102398, 2024. 7

    2024

  33. [41]

    Zero-shot sketch-based image retrieval via graph convolution network

    Zhaolong Zhang, Yuejie Zhang, Rui Feng, Tao Zhang, and Weiguo Fan. Zero-shot sketch-based image retrieval via graph convolution network. InProceedings of the AAAI Con- ference on Artificial Intelligence, pages 12943–12950, 2020. 2

    2020

  34. [42]

    Learning to adapt invariance in memory for person re-identification

    Zhun Zhong, Liang Zheng, Zhiming Luo, Shaozi Li, and Yi Yang. Learning to adapt invariance in memory for person re-identification. IEEE transactions on pattern analysis and machine intelligence, 43(8):2723–2738, 2020. 3

    2020

  35. [43]

    Ocean: A dual learning approach for generalized zero-shot sketch-based image retrieval

    Jiawen Zhu, Xing Xu, Fumin Shen, Roy Ka-Wei Lee, Zheng Wang, and Heng Tao Shen. Ocean: A dual learning approach for generalized zero-shot sketch-based image retrieval. In 2020 IEEE International Conference on Multimedia and Expo (ICME), pages 1–6. IEEE, 2020. 2 10

    2020

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.