Pith. sign in

REVIEW 3 major objections 8 minor 71 references

VLMs meet UDA: Boosting Transferability of Open Vocabulary Segmentation with Unsupervised Domain Adaptation

T0 review · 3 major / 8 minor · reviewed 2026-08-11 · deepseek-v4-flash

Pith's one-line read Unsupervised domain adaptation can boost open-vocabulary segmentation across domains that share no categories.

desk verdict First true UDA-OVSS integration with real target-private segmentation, but the 'no shared categories' claim is overstated: the benchmark still shares 16/19 classes and the SOTA margin is entirely target-private. read the letter →

arxiv 2412.09240 v1 pith:QBRTBJSH submitted 2024-12-12 cs.CV cs.AI

classification cs.CVcs.AI
keywords openvocabularysemanticsegmentationunsuperviseddomainadaptationvision-languagemodelsCLIPfine-tuningteacher-studentpseudo-labelscross-domainmixedsamplingpromptaugmentationsynthetic-to-realtransfer
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

This paper proposes that unsupervised domain adaptation (UDA) and open-vocabulary semantic segmentation should be used together rather than pursued separately. The claim is that UDA's unlabeled target data and teacher-student training give vision-language models the stability they need for fine-grained adaptation, while the model's open vocabulary removes UDA's closed-set limitation of only seeing categories present in the synthetic source. On that basis the authors build FROVSS, an open-vocabulary segmenter combining cost-volume embeddings with augmented prompts and layer-wise CLIP fine-tuning, and UDA-FROVSS, which wraps it in a teacher-student pipeline with cross-domain mixed sampling. The headline result is 61.5 mIoU on Synthia-to-Cityscapes, over 8 points above prior UDA state of the art, including correct segmentation of Cityscapes classes like truck and train that never appear in Synthia.

What carries the argument

The cost volume is the central object: for each patch and category prompt, the cosine similarity between dense CLIP visual features and text features, which the decoder refines into pixel-wise maps. Three supporting mechanisms carry the argument: robust text embeddings built by averaging many LLM-generated prompt variations per category; a fine-tuning scheme that freezes MLP layers, tunes spatial layers, and decays learning rates by a factor of $\beta$ from the last encoder layer backward; and a UDA loop in which a teacher with a frozen encoder and EMA-updated decoder produces target pseudo-labels, a student trains on source labels and cross-domain mixed samples, and a gamma schedule shifts pseudo-label trust from teacher to student over time.

What would settle it

Use the paper's own full-EMA variant as the control: updating the teacher encoder makes the model forget the target-private train class, dropping it to 0.1 mIoU in the paper's comparison while UDA-FROVSS reaches 60.2; any reproduction that preserves the frozen-encoder/EMA-decoder design yet still leaves train and truck near zero would falsify the claim that this design is what enables open-vocabulary transfer.

Watch

Extended reading notes

Core claim

The paper's central discovery, in the authors' own framing, is that UDA and VLM-based open-vocabulary segmentation are mutually reinforcing and can be combined into the first UDA framework that works without shared categories between source and target. The evidence is four-fold: the FROVSS decoder and prompt augmentation improve open-vocabulary segmentation on every benchmark tested; the layer-wise fine-tuning preserves CLIP's generalization; the teacher-student design with a frozen teacher encoder and EMA-updated teacher decoder lets the model learn target-private labels; and the full UDA-FROVSS pipeline sets a new state of the art on the Synthia-to-Cityscapes UDA benchmark while remaining open vocabulary. In the authors' words, the framework removes the need for shared categories; per-class results show that classes absent from the source (truck, train) are segmented at 80.3 and 60.2 mIoU respectively, whereas closed-set UDA baselines score zero on them.

Load-bearing premise

The load-bearing premise is that the teacher's pseudo-labels on unlabeled target images are reliable enough to supervise the student, especially for target-private categories that have no labeled examples anywhere in training.

Editorial extensions

If this is right

  • Open-vocabulary segmentation models can use large unlabeled target image collections to specialize to a domain without giving up their ability to name novel categories.
  • UDA systems no longer need to regenerate synthetic data or retrain when a new category appears; the open-vocabulary head can recognize it from the prompt alone.
  • The Synthia-to-Cityscapes setting becomes a usable UDA benchmark for open-vocabulary models, with target-private classes scored explicitly rather than ignored.
  • The FROVSS components (prompt augmentation and layer-wise fine-tuning) account for most of the observed UDA gains in the paper's ablation, so improving open-vocabulary capability is itself a route to better domain transfer.

Reading between the lines

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

  • A general recipe may follow: keep the pretrained vision-language geometry frozen and adapt a small spatially-aware head; the same split could be tested on open-vocabulary detection, panoptic segmentation, or monocular depth estimation.
  • The paper's Synthia-to-Cityscapes experiment still shares 16 of 19 classes between source and target, so 'no shared categories' is demonstrated only partially; a stronger test would use a source-target pair with zero overlap and check whether private classes emerge purely from teacher pseudo-labels.
  • The gamma decay schedule is an acknowledged patch for teacher encoder-decoder misalignment; re-aligning the teacher (for example by periodic reset or low-rank adapters) could remove the need for the schedule and is a natural next step.
  • Photometry-based prompt augmentations hurt performance in the paper's ablations, suggesting that the prompt-augmentation recipe is not uniformly beneficial and may need to be tuned per domain.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 8 minor

Summary. The paper proposes FROVSS, an open-vocabulary semantic segmentation (OVSS) model that combines a CLIP image encoder with a hybrid convolutional-transformer decoder, LLM-based prompt augmentation, and layer-wise learning-rate decay. It then introduces UDA-FROVSS, a UDA extension with a teacher-student setup in which the teacher's encoder is frozen while the decoder is updated by EMA, cross-domain image mixup, and confidence-weighted pseudo-label blending controlled by a gamma decay schedule. The authors report improvements on several OVSS benchmarks and a new state of the art of 61.5 mIoU on Synthia-to-Cityscapes, claiming this is the first UDA framework that adapts across domains without requiring shared categories. The central contribution is the integration of VLM-based open-vocabulary reasoning with standard UDA techniques to recognize target-private classes during adaptation.

Significance. If the central claim is accepted, the paper opens a valuable direction: adapting open-vocabulary models to unlabeled target domains while retaining the ability to segment categories absent from the source label set. The paper is honest about the teacher encoder-decoder misalignment (Sec. 4.4) and provides detailed ablations (Tables 10, 11). The cross-dataset OVSS experiments are extensive, and the prompt-augmentation analysis is a useful empirical contribution. However, the manuscript currently does not provide code, error bars, or multiple-seed runs, and the headline claim about disjoint label sets rests on only three target-private classes in a benchmark that shares 16 of 19 classes. The shared-class average on Synthia-to-Cityscapes is below prior closed-set UDA methods, so the SOTA margin is entirely attributable to target-private categories whose pseudo-label quality is not measured. These are fixable but load-bearing issues.

major comments (3)
  1. [Sec. 4.4 and Table 11] The central claim that UDA-FROVSS adapts "without requiring shared categories" is not directly demonstrated: the only UDA benchmark with target-private classes, Synthia-to-Cityscapes, shares 16 of 19 classes, and the three private classes (terrain, truck, train) are never separated out in the evaluation. Recomputing the shared-class average from Table 11, UDA-FROVSS scores 64.3 mIoU on the 16 shared classes, while DCF in Table 13 scores 69.3; thus the reported advantage over prior SOTA comes entirely from truck/train (terrain is 0.0 for both). The paper must report the shared-class breakdown and, ideally, run a fully disjoint label split before claiming the advertised generalization.
  2. [Sec. 3.3, Eqs. (10)-(12)] The pseudo-label schedule that enables learning of target-private categories is introduced as a patch for the acknowledged teacher encoder-decoder misalignment (Sec. 4.4), but no sensitivity analysis, no ablation on gamma_0, and no pseudo-label quality measure (e.g., precision/recall on a held-out target set) are provided. Since the method's headline capability depends on this schedule, its behavior under different gamma_0 values and different domain gaps should be characterized. As written, Eq. (12) is ambiguous and possibly missing parentheses: "gamma_{delta+1} <- (1/delta gamma_delta + 1)" should be clarified.
  3. [Sec. 4.1, Tables 10 and 13] The experimental evidence for the claimed SOTA margin lacks error bars, multiple seeds, and code release. Hyperparameters beta and mu are set via "initial exploration" (Sec. 4.1), and the ablation in Table 10 reports single-run numbers. The reported Synthia-to-Cityscapes advantage over DCF is 61.5 vs 58.4 mIoU, which is an absolute margin of 3.1; the paper's phrase "by over 8%" should specify whether this refers to relative improvement, and the reader needs to know the variance of these numbers before the superiority claim can be assessed.
minor comments (8)
  1. [Sec. 1] There are several typos in the introduction, including "class dviersity" and "Alltogether"; the text should be proofread.
  2. [Sec. 3.3, Eq. (12)] The gamma update rule as printed is notationally ambiguous; please add parentheses and define the intended recurrence clearly.
  3. [Sec. 4.4] The sentence "hence defining the combination of teacher and student labels described in equation 6 of the paper" should refer to the correct equation number, which appears to be Eq. (11) or (12), not Eq. (6).
  4. [Table 6] The row labels "Spatial[13]" and "Proposed" are unclear; please specify the exact fine-tuning protocol for each row (which layers are updated and how).
  5. [Table 7] The "OV" column uses checkmarks and crosses without explaining the criterion; clarify whether it denotes the ability to handle unseen categories at inference.
  6. [Sec. 2] "Covariant distribution shift" should be "covariate shift" in the related-work discussion.
  7. [Sec. 4.2 and Table 5] The photometry prompt augmentation is reported to not improve performance, yet the contributions section presents prompt augmentation as a generally beneficial strategy; the paper should temper the claim or explain why the photometry variant failed.
  8. [Sec. 4.2 and Table 4] The statement that prompt augmentation "exclusively during testing enhances the model's generality" is not uniformly supported: for the ADE-20-trained model, same-dataset performance drops from 53.4 to 53.0 and cross-dataset performance is mixed; the discussion should be more balanced.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: target-private recognition rests on frozen CLIP embeddings and external benchmarks, not on fitted inputs or load-bearing self-citation.

full rationale

The paper's derivation chain is self-contained and externally validated. FROVSS is benchmarked against CAT-Seg and other CLIP-based segmentators on COCO, ADE-20, Pascal-Context, and Pascal VOC using held-out validation sets, and UDA-FROVSS is evaluated on Synthia-to-Cityscapes against prior UDA methods (MM, DIGA, MIC, DCF). The target-private classes (truck, train) are obtained through the teacher's frozen CLIP image encoder and the always-frozen text encoder, so this capability is not a fitted parameter renamed as a prediction. The teacher decoder EMA (Eq. 10) and gamma-decay pseudo-label combination (Eqs. 11-12) are training heuristics, not re-statements of the evaluation metric. The self-citations ([2], [7], [33]) appear in background discussion of UDA and out-of-distribution detection and are not load-bearing for the central claim. The reviewer concern that the 'without shared categories' claim is only demonstrated on a 16/19 shared-class benchmark, and that the reported SOTA margin is concentrated in target-private classes, is a scope and benchmark-design objection rather than a circularity: no claimed result is shown to reduce by construction to its own inputs.

Assumptions & free parameters 5 free parameters · 6 assumptions · 0 invented entities

The central claims depend on standard CLIP pretraining assumptions, empirically motivated fine-tuning choices, and the reliability of pseudo-labels. No new physical or mathematical entities are introduced. Hyperparameters beta and mu are tuned by exploration, and several UDA hyperparameters (alpha, delta, gamma_0) are not reported. The method is an empirical architecture and training strategy, not a theoretical derivation.

free parameters (5)
  • beta (layer-wise learning rate decay) = 0.95
    Decay factor in Eq. (1), set 'through initial exploration' in Section 4.1. Directly controls how much each CLIP encoder layer is fine-tuned.
  • mu (pixel confidence threshold) = 0.96
    Threshold in Eq. (9) used to compute pseudo-label quality weight q, set 'through initial exploration' in Section 4.1.
  • gamma_0 (initial teacher weight) = not reported
    Initial value of gamma in Eq. (11)-(12) controlling the blend of teacher and student pseudo-labels; no value is given.
  • alpha (EMA decay) = not reported
    Coefficient in Eq. (10) for updating the teacher decoder; no value is specified.
  • delta (EMA time step) = not reported
    Time step in Eqs. (10) and (12); no value or schedule is specified.
assumptions (6)
  • domain assumption CLIP image and text encoders pretrained on web-scale data contain sufficient semantic knowledge for open-vocabulary pixel-level segmentation.
    Foundational assumption stated in Section 3: 'We initialize the training with a pre-trained VLM as it contains rich semantics learned from large-scale training.'
  • domain assumption Tuning only spatial-interaction layers (attention, positional embeddings) while freezing MLP layers suffices to transfer CLIP from image-level to pixel-level prediction.
    Stated in Section 3.1: 'guided by the insight that tuning layers responsible for spatial interaction suffices for transferring image-level representations to pixel-level [49], we freeze the MLP layers in the encoder.'
  • domain assumption Layer-wise decayed learning rate (Eq. 1) preserves pre-trained knowledge and improves fine-tuning.
    Proposed in Section 3.1, Eq. (1), motivated by [50, 51]; supported only by empirical ablations, not theoretical proof.
  • domain assumption A teacher with frozen encoder and EMA-updated decoder generates reliable pseudo-labels for the target domain, even as the decoder drifts from its encoder.
    Section 3.3 and 4.4; the paper acknowledges misalignment and compensates with gamma decay, but the reliability of pseudo-labels is load-bearing and untested in isolation.
  • domain assumption Cross-domain mixed sampling (DACS-style overlaying source instances on target images) enforces domain-invariant features.
    Section 3.3 following [47]; standard UDA assumption used without new justification.
  • domain assumption LLM-generated prompt augmentations and average text embeddings improve robustness of category recognition.
    Section 3.2; empirically motivated and validated only within this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of VLMs meet UDA: Boosting Transferability of Open Vocabulary Segmentation with Unsupervised Domain Adaptation." pith.science (2026). https://pith.science/paper/QBRTBJSH

@misc{pith2026241209240,
  author       = {Pith},
  title        = {Pith review of: VLMs meet UDA: Boosting Transferability of Open Vocabulary Segmentation with Unsupervised Domain Adaptation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QBRTBJSH}},
  note         = {Machine review of arXiv:2412.09240}
}
read the original abstract

Segmentation models are typically constrained by the categories defined during training. To address this, researchers have explored two independent approaches: adapting Vision-Language Models (VLMs) and leveraging synthetic data. However, VLMs often struggle with granularity, failing to disentangle fine-grained concepts, while synthetic data-based methods remain limited by the scope of available datasets. This paper proposes enhancing segmentation accuracy across diverse domains by integrating Vision-Language reasoning with key strategies for Unsupervised Domain Adaptation (UDA). First, we improve the fine-grained segmentation capabilities of VLMs through multi-scale contextual data, robust text embeddings with prompt augmentation, and layer-wise fine-tuning in our proposed Foundational-Retaining Open Vocabulary Semantic Segmentation (FROVSS) framework. Next, we incorporate these enhancements into a UDA framework by employing distillation to stabilize training and cross-domain mixed sampling to boost adaptability without compromising generalization. The resulting UDA-FROVSS framework is the first UDA approach to effectively adapt across domains without requiring shared categories.

Figures

Figures reproduced from arXiv: 2412.09240 by the authors.

Figure 1
Figure 1. State of the art for open vocabulary semantic segmentation underperforms when trained with small training sets. Results of CAT-Seg [13] trained on random subsets derived from three popular datasets with different amounts of im￾ages across three random seeds (maximum minimum range depicted by shadowed area). Performance eval￾uated in the COCO validation set [14]. specific data for effective fine-grained adaptation to… view at source ↗
Figure 2
Figure 2. Visual summary of contributions. In Figure 2a, we showcase the benefits of FROVSS in the standard OVSS setup (trained in the COCO dataset and evaluated in multiple datasets). Figures 2b and 2c illustrate the major challenge we tackle: training with task-specific datasets (Cityscapes in 2b and ADE in 2c) drastically reduces generalization of the model. To overcome such issue, our proposed combination of UDA and OVSS … view at source ↗
Figure 3
Figure 3. Proposed decoder for open vocabulary semantic segmentation, exemplified with the category: “car”. We guide segmentation by refining the similarities between dense features extracted from the image encoder and the text features (C). semble to generate robust text embeddings, these ro￾bust text embeddings can be applied during the train￾ing or the testing phase to improve performance. 3.1 Open Vocabulary Semantic Seg￾… view at source ↗
Figures from the paper (10 more)
Figure 4
Figure 4. Figure 4: Prompt augmentation pipeline. prompts for each category. These descriptions of￾fer additional detail on how each category is defined in the target dataset, enhancing specificity without compromising generalization to other datasets. Ad￾ditionally, we use LLMs [56] to g…
Figure 5
Figure 5. Figure 5: Overview of UDA-FROVSS, which combinines VLMs with UDA. Key Components are illustrated within delineated boxes: (1) Integration of a custom decoder alongside a fine-tuning strategy to effectively train the framework; (2) Adaptation of UDA techniques, incorporating a te…
Figure 6
Figure 6. Figure 6: compares the TSNE representation of the textual features employed. Notably, our robust text embeddings result in distinctly separated clusters for each class while maintaining logical inter-class re￾lationships. For instance, while rider and pedes￾trian categories are …
Figure 7
Figure 7. Figure 7: Qualitative comparison of model trained and evaluated with (first row) and without (second row) prompt augmentation on the ADE-20 dataset. The enhanced robust text embeddings allow the model to correctly seg￾ment the fence, wall and plant (first column), book (second c…
Figure 8
Figure 8. Figure 8: Visual performance comparison of CAT-seg and our model on the Mapillary dataset, both trained only with COCO. Our model presents better segmentation of the vegetation, building and traffic light [PITH_FULL_IMAGE:figures/full_fig_p013_8.png]
Figure 9
Figure 9. Figure 9: Visual performance comparison of CAT-seg (first row) and our model (second row) both trained and evaluated only with the Cityscapes dataset. We find that our model presents better segmentation of rider, bicycle, fence, light (first column), wall, pole, pedestrian (seco…
Figure 11
Figure 11. Figure 11: Example of the full teacher update against our UDA-FROVSS proposed teacher update. Our model remains capable of segmenting the target private train category after training. get private labels thus allowing the student to learn from those target private categories. How…
Figure 12
Figure 12. Figure 12: Performance comparison across five datasets against the state-of-the-art CAT-Seg [13] for Open Vocabulary Semantic Segmen￾tation (OVSS). UDA-FROVSS correspond to our proposal for UDA based on VLMs. The numbers ad￾jacent to dataset names indicate performance when train…
Figure 13
Figure 13. Figure 13: Examples of our UDA-enhanced model in the Synthia-to-Cityscapes setup. Re￾sults on the Cityscapes validation of the model trained with labeled Synthia data and unlabeled Cityscapes images. Segmenting the target private category: truck and train, and highly unpopulated…
Figure 14
Figure 14. Figure 14: Performance improvements driven by UDA on small and Synthetic datasets. In red is depicted the performance of models trained with only source data. Adaptation is performed independently to each analyzed dataset. UDA en￾hancements correlate with dataset similarity to t…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

71 extracted references · 66 canonical work pages

  1. [1]

    Class- conditional domain adaptation for semantic seg- mentation

    Wang Y, Li Y, Elder JH, Wu R, Lu H. Class- conditional domain adaptation for semantic seg- mentation. Computational Visual Media , 2024: 1–18

  2. [2]

    On exploring weakly supervised domain adaptation strate- gies for semantic segmentation using synthetic data

    Alcover-Couso R, SanMiguel JC, Escudero- Vinolo M, Garcia-Martin A. On exploring weakly supervised domain adaptation strate- gies for semantic segmentation using synthetic data. Multimedia Tools and Applications , 2023: 35879–35911. 17

  3. [3]

    Taming diffusion model for exemplar-based image translation

    Ma H, Yang J, Huang H. Taming diffusion model for exemplar-based image translation. Computa- tional Visual Media , 2024: 1–13

  4. [4]

    Learning layout generation for virtual worlds

    Cheng W, Shan Y. Learning layout generation for virtual worlds. Computational Visual Media , 2024: 1–16

  5. [5]

    Adap- tive sampling and reconstruction for gradient- domain rendering

    Liang Y, Liu T, Huo Y, Wang R, Bao H. Adap- tive sampling and reconstruction for gradient- domain rendering. Computational Visual Media, 2024: 1–18

  6. [6]

    Multi3D: 3D-aware multimodal image synthesis

    Zhou W, Yuan L, Mu T. Multi3D: 3D-aware multimodal image synthesis. Computational Vi- sual Media, 2024: 1–13

  7. [7]

    Biased Class disagreement: detection of out of distribution instances by using differ- ently biased semantic segmentation models

    Alcover-Couso R, SanMiguel JC, Escudero- Vi˜ nolo M. Biased Class disagreement: detection of out of distribution instances by using differ- ently biased semantic segmentation models. In Int. Conf. Comput. Vis. (ICCVW) , 2023, 4580– 4588

  8. [8]

    Cross-modal learning using privileged informa- tion for long-tailed image classification

    Li X, Zheng Y, Ma H, Qi Z, Meng X, Meng L. Cross-modal learning using privileged informa- tion for long-tailed image classification. Compu- tational Visual Media , 2024: 1–12

Show all 71 references
  1. [9]

    Don’t Stop Learning: Towards Continual Learning for the CLIP Model

    Ding Y, Liu L, Tian C, Yang J, Ding H. Don’t Stop Learning: Towards Continual Learning for the CLIP Model. ArXiv, 2022, abs/2207.09248

  2. [10]

    Generative Negative Text Replay for Continual Vision-Language Pretraining

    Yan S, Hong L, Xu H, Han J, Tuytelaars T, Li Z, He X. Generative Negative Text Replay for Continual Vision-Language Pretraining. ArXiv, 2022, abs/2210.17322

  3. [11]

    Extract Free Dense Labels from CLIP

    Zhou C, Loy CC, Dai B. Extract Free Dense Labels from CLIP. In Eur. Conf. Comput. Vis. (ECCV), 2022

  4. [12]

    CLiMB: A Continual Learn- ing Benchmark for Vision-and-Language Tasks

    Srinivasan T, Chang TY, Pinto-Alva L, Chochlakis G, Rostami M, Thoma- son J. CLiMB: A Continual Learn- ing Benchmark for Vision-and-Language Tasks. ArXiv, 2022, abs/2206.09059, doi: 10.48550/arXiv.2206.09059

  5. [13]

    CAT-Seg: Cost Aggre- gation for Open-Vocabulary Semantic Segmen- tation

    Cho S, Shin H, Hong S, An S, Lee S, Arnab A, Seo PH, Kim S. CAT-Seg: Cost Aggre- gation for Open-Vocabulary Semantic Segmen- tation. In IEEE Conf. Comput. Vis. Pattern Recog. (CVPR), 2024

  6. [14]

    COCO-Stuff: Thing and Stuff Classes in Context

    Holger Caesar VF Jasper Uijlings. COCO-Stuff: Thing and Stuff Classes in Context. In IEEE Conf. Comput. Vis. Pattern Recog. (CVPR) , 2018

  7. [15]

    Early Convolutions Help Transform- ers See Better

    Xiao T, Singh M, Mintun E, Darrell T, Dollar P, Girshick R. Early Convolutions Help Transform- ers See Better. In Adv. Neural Inform. Process. Syst. (NeurIPS), volume 34, 2021, 30392–30400

  8. [16]

    Incorporating Convolution Designs Into Visual Transformers

    Yuan K, Guo S, Liu Z, Zhou A, Yu F, Wu W. Incorporating Convolution Designs Into Visual Transformers. In IEEE Int. Conf. Comput. Vis. (ICCV), 2021, 579–588

  9. [17]

    Pyramid Geometric Consistency Learning For Seman- tic Segmentation

    Zhang X, Li Q, Quan Z, Yang W. Pyramid Geometric Consistency Learning For Seman- tic Segmentation. Pattern Recognition , 2023, 133: 109020, doi:https://doi.org/10.1016/j. patcog.2022.109020

  10. [18]

    Learning Trans- ferable Visual Models From Natural Language Supervision

    Radford A, Kim JW, Hallacy C, Ramesh A, Goh G, Agarwal S, Sastry G, Askell A, Mishkin P, Clark J, Krueger G, Sutskever I. Learning Trans- ferable Visual Models From Natural Language Supervision. In Int. Conf. Mach. Lear. (ICML) , volume 139, 2021, 8748–8763

  11. [19]

    SegCLIP: Patch Aggregation with Learnable Centers for Open-Vocabulary Semantic Segmentation

    Luo H, Bao J, Wu Y, He X, Li T. SegCLIP: Patch Aggregation with Learnable Centers for Open-Vocabulary Semantic Segmentation. Int. Conf. Mach. Lear. (ICML) , 2023

  12. [20]

    Open-Vocabulary Panop- tic Segmentation with MaskCLIP

    Ding Z, Wang J, Tu Z. Open-Vocabulary Panop- tic Segmentation with MaskCLIP. Int. Conf. Comput. Vis. (ICCV) , 2023

  13. [21]

    Open-Vocabulary Instance Segmentation via Robust Cross-Modal Pseudo-Labeling

    Huynh DT, Kuen J, nan Lin Z, Gu J, Elhami- far E. Open-Vocabulary Instance Segmentation via Robust Cross-Modal Pseudo-Labeling. IEEE Conf. Comput. Vis. Pattern Recog. (CVPR) , 2021: 7010–7021. 18

  14. [22]

    Collaborating Foundation models for Domain Generalized Semantic Segmentation

    Benigmim Y, Roy S, Essid S, Kalogeiton V, Lathuili` ere S. Collaborating Foundation models for Domain Generalized Semantic Segmentation. arXiv:2312.09788, 2023

  15. [23]

    Side Adapter Network for Open-Vocabulary Seman- tic Segmentation

    Xu M, Zhang Z, Wei F, Hu H, Bai X. Side Adapter Network for Open-Vocabulary Seman- tic Segmentation. In IEEE Conf. Comput. Vis. Pattern Recog. (CVPR), 2023

  16. [24]

    CLIP-SP: Vision-language model with adap- tive prompting for scene parsing

    Li J, Huang Y, Wu M, Zhang B, Ji X, Zhang C. CLIP-SP: Vision-language model with adap- tive prompting for scene parsing. Computational Visual Media, 2024: 741–752

  17. [25]

    Ex- ploring Visual Interpretability for Con- trastive Language-Image Pre-training

    Li Y, Wang H, Duan Y, Xu H, Li X. Ex- ploring Visual Interpretability for Con- trastive Language-Image Pre-training. arXiv:2209.07046, 2022

  18. [26]

    CLIP Surgery for Better Explainability with Enhancement in Open-Vocabulary Tasks

    Li Y, Wang H, Duan Y, Li X. CLIP Surgery for Better Explainability with Enhancement in Open-Vocabulary Tasks. arXiv:2304.05653, 2023

  19. [27]

    SemiVL: Semi-Supervised Semantic Segmen- tation with Vision-Language Guidance

    Hoyer L, Tan DJ, Naeem MF, Gool L V, Tombari F. SemiVL: Semi-Supervised Semantic Segmen- tation with Vision-Language Guidance. In Eur. Conf. Comput. Vis. (ECCV) , 2023

  20. [28]

    Open- vocabulary semantic segmentation with mask- adapted clip

    Liang F, Wu B, Dai X, Li K, Zhao Y, Zhang H, Zhang P, Vajda P, Marculescu D. Open- vocabulary semantic segmentation with mask- adapted clip. In IEEE Conf. Comput. Vis. Pat- tern Recog. (CVPR), 2023, 7061–7070

  21. [29]

    Decoupling Zero- Shot Semantic Segmentation

    Ding J, Xue N, Xia GS, Dai D. Decoupling Zero- Shot Semantic Segmentation. In IEEE Conf. Comput. Vis. Pattern Recog. (CVPR) , 2022, 11573–11582

  22. [30]

    A Simple Baseline for Open Vocab- ulary Semantic Segmentation with Pre-trained Vision-language Model

    Xu M, Zhang Z, Wei F, Lin Y, Cao Y, Hu H, Bai X. A Simple Baseline for Open Vocab- ulary Semantic Segmentation with Pre-trained Vision-language Model. Eur. Conf. Comput. Vis. (ECCV) , 2022

  23. [31]

    Discovering latent target subdomains for domain adaptive seman- tic segmentation via style clustering

    Wang S, Zhao X, Chen J. Discovering latent target subdomains for domain adaptive seman- tic segmentation via style clustering. Multimedia Tools and Applications , 2023: 3234–3243, doi: 10.1007/s11042-023-15620-6

  24. [32]

    Survey on Unsupervised Domain Adaptation for Semantic Segmentation for Vi- sual Perception in Automated Driving

    Schwonberg M, Niemeijer J, Term¨ ohlen JA, sch¨ afer JP, Schmidt NM, Gottschalk H, Fin- gscheidt T. Survey on Unsupervised Domain Adaptation for Semantic Segmentation for Vi- sual Perception in Automated Driving. IEEE Access, 2023, 11: 54296–54336

  25. [33]

    Per-Class Curriculum for Unsupervised Domain Adaptation in Se- mantic Segmentation

    Alcover-Couso R, SanMiguel JC, Escudero- Vi˜ nolo M, Caballeira P. Per-Class Curriculum for Unsupervised Domain Adaptation in Se- mantic Segmentation. In The Visual Computer , 2023, 1–19

  26. [34]

    Pseudo-Label : The Simple and Ef- ficient Semi-Supervised Learning Method for Deep Neural Networks

    Lee DH. Pseudo-Label : The Simple and Ef- ficient Semi-Supervised Learning Method for Deep Neural Networks. In Int. Conf. Mach. Lear. (ICML W), 2013

  27. [35]

    DAFormer: Im- proving Network Architectures and Training Strategies for Domain-Adaptive Semantic Seg- mentation

    Hoyer L, Dai D, Van Gool L. DAFormer: Im- proving Network Architectures and Training Strategies for Domain-Adaptive Semantic Seg- mentation. In IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR), 2022, 9924–9935

  28. [36]

    HRDA: Context- Aware High-Resolution Domain-Adaptive Se- mantic Segmentation

    Hoyer L, Dai D, Van Gool L. HRDA: Context- Aware High-Resolution Domain-Adaptive Se- mantic Segmentation. In IEEE Eur. Conf. Com- put. Vis. (ECCV) , 2022, 372–391

  29. [37]

    CDAC: Cross-domain Attention Consistency in Transformer for Domain Adaptive Seman- tic Segmentation

    Wang K, Kim D, Feris R, Saenko K, Betke M. CDAC: Cross-domain Attention Consistency in Transformer for Domain Adaptive Seman- tic Segmentation. In IEEE Conf. Comput. Vis. (ICCV), 2023

  30. [38]

    CoN- Mix for Source-free Single and Multi-target Do- main Adaptation

    Kumar V, Lal R, Patil H, Chakraborty A. CoN- Mix for Source-free Single and Multi-target Do- main Adaptation. In Wint. App. Comp. Vis. (WACV), 2023, 4178–4188

  31. [39]

    MIC: Masked Image Consistency for Context- Enhanced Domain Adaptation

    Hoyer L, Dai D, Wang H, Van Gool L. MIC: Masked Image Consistency for Context- Enhanced Domain Adaptation. In IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR) , 2023. 19

  32. [40]

    Mean teachers are bet- ter role models: Weight-averaged consistency targets improve semi-supervised deep learning results

    Tarvainen A, Valpola H. Mean teachers are bet- ter role models: Weight-averaged consistency targets improve semi-supervised deep learning results. In Adv. Neural Inform. Process. Syst. (NeurIPS), 2017

  33. [41]

    Research On Data Model Migration In Image Semantic Segmenta- tion Based On Deep Learning

    Guo W, Liu F, Song Y, Qin C. Research On Data Model Migration In Image Semantic Segmenta- tion Based On Deep Learning. Int. Conf. Mea- suring Technology and Mechatronics Automa- tion, 2022: 417–420

  34. [42]

    Rectifying Pseudo Label Learning via Uncertainty Estimation for Domain Adaptive Semantic Segmentation

    Zheng Z, Yang Y. Rectifying Pseudo Label Learning via Uncertainty Estimation for Domain Adaptive Semantic Segmentation. Int. J. Com- put. Vis. (IJCV) , 2020: 1–15

  35. [43]

    Characterizations of semantic do- mains for randomized algorithms

    Yamada S. Characterizations of semantic do- mains for randomized algorithms. Japan Journal of Applied Mathematics , 1989, 6: 111–146

  36. [44]

    Training Deep Networks with Synthetic Data: Bridging the Reality Gap by Domain Randomization

    Tremblay J, Prakash A, Acuna D, Brophy M, Jampani V, Anil C, To T, Cameracci E, Boo- choon S, Birchfield S. Training Deep Networks with Synthetic Data: Bridging the Reality Gap by Domain Randomization. IEEE Conf. Com- put. Vis. Pattern Recog. (CVPR W), 2018: 1082– 10828

  37. [45]

    Structured Domain Randomization: Bridg- ing the Reality Gap by Context-Aware Synthetic Data

    Prakash A, Boochoon S, Brophy M, Acuna D, Cameracci E, State G, Shapira O, Birchfield S. Structured Domain Randomization: Bridg- ing the Reality Gap by Context-Aware Synthetic Data. IEEE Int. Conf. Rob. Aut. (ICRA) , 2018: 7249–7255

  38. [46]

    Domain randomization for neural network classification

    Valtchev SZ, Wu J. Domain randomization for neural network classification. Journal of Big Data, 2020, 8

  39. [47]

    DACS: Domain Adaptation via Cross-domain Mixed Sampling

    Tranheden W, Olsson V, Pinto J, Svensson L. DACS: Domain Adaptation via Cross-domain Mixed Sampling. IEEE Winter Conf. App. Comp. Vis. (WACV) , 2020: 1378–1388

  40. [48]

    CLIP-Flow: Decoding images encoded in CLIP space

    Ma H, Li M, Yang J, Patashnik O, Lischinski D, Cohen-Or D, Huang H. CLIP-Flow: Decoding images encoded in CLIP space. Computational Visual Media, 2024: 1–12

  41. [49]

    Attention is All you Need

    Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser Lu, Polosukhin I. Attention is All you Need. In Adv. Neural Inform. Process. Syst. (NeurIPS) , volume 30, 2017

  42. [50]

    Universal Language Model Fine-tuning for Text Classification

    Howard J, Ruder S. Universal Language Model Fine-tuning for Text Classification. In ACL, 2018

  43. [51]

    Fast End-to- End Trainable Guided Filter

    Wu H, Zheng S, Zhang J, Huang K. Fast End-to- End Trainable Guided Filter. IEEE Conf. Com- put. Vis. Pattern Recog. (CVPR) , 2018: 1838– 1847

  44. [52]

    An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

    Dosovitskiy A, Beyer L, Kolesnikov A, Weis- senborn D, Zhai X, Unterthiner T, Dehghani M, Minderer M, Heigold G, Gelly S, Uszkoreit J, Houlsby N. An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale. In Int. Conf. Learn. Rep. (ICLR) , 2021

  45. [53]

    Convolu- tional neural network architecture for geometric matching

    Rocco I, Arandjelovi´ c R, Sivic J. Convolu- tional neural network architecture for geometric matching. In IEEE Conf. Comput. Vis. Pattern Recog. (CVPR), 2017

  46. [54]

    Cost Ag- gregation with 4D Convolutional Swin Trans- former for Few-Shot Segmentation

    Hong S, Cho S, Nam J, Lin S, Kim S. Cost Ag- gregation with 4D Convolutional Swin Trans- former for Few-Shot Segmentation. In ECCV, 2022, 108–126

  47. [55]

    The Cityscapes Dataset for Seman- tic Urban Scene Understanding

    Cordts M, Omran M, Ramos S, Rehfeld T, Enzweiler M, Benenson R, Franke U, Roth S, Schiele B. The Cityscapes Dataset for Seman- tic Urban Scene Understanding. In IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR) , 2016, 3212–3223

  48. [56]

    Language Models are Few-Shot Learners

    Brown TB, Mann B, Ryder N, Subbiah M, Ka- plan J, Dhariwal P, Neelakantan A, Shyam P, Sastry G, Askell A, et al.. Language Models are Few-Shot Learners. Adv. Neural Inform. Pro- cess. Syst. (NeurIPS) , 2020: 1877–1901

  49. [57]

    The Mapillary Vistas Dataset for Semantic Understanding of Street Scenes

    Neuhold G, Ollmann T, Rota Bul` o S, Kontschieder P. The Mapillary Vistas Dataset for Semantic Understanding of Street Scenes. In 20 IEEE Int. Conf. Comput. Vis. (ICCV) , 2017, 5000–5009

  50. [58]

    Domain randomization for trans- ferring deep neural networks from simulation to the real world

    Tobin J, Fong R, Ray A, Schneider J, Zaremba W, Abbeel P. Domain randomization for trans- ferring deep neural networks from simulation to the real world. IEEE Conf. Intell. Rob. Sys. (IROS), 2017: 23–30

  51. [59]

    Semantic understanding of scenes through the ade20k dataset

    Zhou B, Zhao H, Puig X, Xiao T, Fidler S, Bar- riuso A, Torralba A. Semantic understanding of scenes through the ade20k dataset. Int. Journal of Computer Vision , 2019, 127: 302–321

  52. [60]

    The Role of Con- text for Object Detection and Semantic Segmen- tation in the Wild

    Mottaghi R, Chen X, Liu X, Cho NG, Lee SW, Fidler S, Urtasun R, Yuille A. The Role of Con- text for Object Detection and Semantic Segmen- tation in the Wild. In IEEE Conf. Comput. Vis. Pattern Recog. (CVPR), 2014

  53. [61]

    The Pascal Visual Object Classes Challenge: A Retrospec- tive

    Everingham M, Eslami SMA, Van Gool L, Williams CKI, Winn J, Zisserman A. The Pascal Visual Object Classes Challenge: A Retrospec- tive. IJCV, 2015, 111(1): 98–136

  54. [62]

    The SYNTHIA Dataset: A Large Collection of Synthetic Images for Semantic Seg- mentation of Urban Scenes

    Ros G, Sellart L, Materzynska J, Vazquez D, Lopez AM. The SYNTHIA Dataset: A Large Collection of Synthetic Images for Semantic Seg- mentation of Urban Scenes. IEEE Conf. Com- put. Vis. Pattern Recog. (CVPR) , 2016: 3234– 3243

  55. [63]

    Swin Transformer V2: Scaling Up Capacity and Res- olution

    Liu Z, Hu H, Lin Y, Yao Z, Xie Z, Wei Y, Ning J, Cao Y, Zhang Z, Dong L, Wei F, Guo B. Swin Transformer V2: Scaling Up Capacity and Res- olution. In IEEE Conf. Comput. Vis. Pattern Recog. (CVPR), 2022

  56. [64]

    Segment Anything

    Kirillov A, Mintun E, Ravi N, Mao H, Rolland C, Gustafson L, Xiao T, Whitehead S, Berg AC, Lo WY, Dollar P, Girshick R. Segment Anything. In Int. Conf. Comput. Vis. (ICCV) , 2023, 4015– 4026

  57. [65]

    FreeSeg: Unified, Universal and Open-Vocabulary Image Segmentation

    Qin J, Wu J, Yan P, Li M, Yuxi R, Xiao X, Wang Y, Wang R, Wen S, Pan X, et al.. FreeSeg: Unified, Universal and Open-Vocabulary Image Segmentation. IEEE Conf. Comput. Vis. Pat- tern Recog. (CVPR), 2023

  58. [66]

    MasQCLIP for Open-Vocabulary Universal Image Segmenta- tion

    Xu X, Xiong T, Ding Z, Tu Z. MasQCLIP for Open-Vocabulary Universal Image Segmenta- tion. In Int. Conf. Comput. Vis. (ICCV) , 2023, 887–898

  59. [67]

    ZegCLIP: Towards Adapting CLIP for Zero-Shot Seman- tic Segmentation

    Zhou Z, Lei Y, Zhang B, Liu L, Liu Y. ZegCLIP: Towards Adapting CLIP for Zero-Shot Seman- tic Segmentation. In IEEE Conf. Comput. Vis. Pattern Recog. (CVPR), 2023, 11175–11185

  60. [68]

    Hierarchical Open-vocabulary Uni- versal Image Segmentation

    Wang X, Li S, Kallidromitis K, Kato Y, Kozuka K, Darrell T. Hierarchical Open-vocabulary Uni- versal Image Segmentation. In Adv. Neural In- form. Process. Syst. (NeurIPS) , 2023

  61. [69]

    Transferring Multi-Modal Domain Knowledge to Uni-Modal Domain for Urban Scene Segmenta- tion

    Liu P, Ge Y, Duan L, Li W, Luo H, Lv F. Transferring Multi-Modal Domain Knowledge to Uni-Modal Domain for Urban Scene Segmenta- tion. IEEE Transactions on Intelligent Trans- portation Systems, 2024: 11576–11589

  62. [70]

    DiGA: Distil To Generalize and Then Adapt for Domain Adaptive Semantic Segmentation

    Shen F, Gurram A, Liu Z, Wang H, Knoll A. DiGA: Distil To Generalize and Then Adapt for Domain Adaptive Semantic Segmentation. In IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR), 2023, 15866–15877

  63. [71]

    Transferring to Real- World Layouts: A Depth-aware Framework for Scene Adaptation

    Chen M, Zheng Z, Yang Y. Transferring to Real- World Layouts: A Depth-aware Framework for Scene Adaptation. In ACM Multimedia, 2024. 21

Pith tools

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