Clustering-based Image-Text Graph Matching for Domain Generalization
Nokyung Park, Daewon Chae, Jeongyong Shim, Sangpil Kim, Eun-Sol Kim, Jinkyu Kim
TL;DR
The paper tackles domain generalization for image classification by introducing a clustering-based image-text graph matching framework that enforces both global and local alignment between multimodal graphs. Visual and textual inputs are encoded as graphs, with local regions and words clustered to form semantically meaningful units that are matched across modalities, promoting domain-invariant representations. The approach yields state-of-the-art performance on CUB-DG and competitive results on DomainBed, supported by extensive ablations, t-SNE visualizations, and GradCAM analyses that highlight improved cross-domain clustering and attention. By grounding visual encoders in human-described textual knowledge and leveraging clustering-based graph matching, the method enhances generalization to unseen domains with diverse styles and backgrounds, including few-shot settings.
Abstract
Learning domain-invariant visual representations is important to train a model that can generalize well to unseen target task domains. Recent works demonstrate that text descriptions contain high-level class-discriminative information and such auxiliary semantic cues can be used as effective pivot embedding for domain generalization problems. However, they use pivot embedding in a global manner (i.e., aligning an image embedding with sentence-level text embedding), which does not fully utilize the semantic cues of given text description. In this work, we advocate for the use of local alignment between image regions and corresponding textual descriptions to get domain-invariant features. To this end, we first represent image and text inputs as graphs. We then cluster nodes within these graphs and match the graph-based image node features to the nodes of textual graphs. This matching process is conducted both globally and locally, tightly aligning visual and textual semantic sub-structures. We experiment with large-scale public datasets, such as CUB-DG and DomainBed, and our model achieves matched or better state-of-the-art performance on these datasets. The code is available at: https://github.com/noparkee/Graph-Clustering-based-DG
