Structured Discriminative Tensor Dictionary Learning for Unsupervised Domain Adaptation
Unsupervised Domain Adaptation (UDA) addresses the problem of performance degradation due to domain shift between training and testing sets, which is common in computer vision applications. Most existing UDA approaches are based on vector-form data although the typical format of data or features in visual applications is multi-dimensional tensor. Besides, current methods, including the deep network approaches, assume that abundant labeled source samples are provided for training. However, the number of labeled source samples are always limited due to expensive annotation cost in practice, making sub-optimal performance been observed. In this paper, we propose to seek discriminative representation for multi-dimensional data by learning a structured dictionary in tensor space. The dictionary separates domain-specific information and class-specific information to guarantee the representation robust to domains. In addition, a pseudo-label estimation scheme is developed to combine with discriminant analysis in the algorithm iteration for avoiding the external classifier design. We perform extensive results on different datasets with limited source samples. Experimental results demonstrates that the proposed method outperforms the state-of-the-art approaches.
Code (0)
등록된 구현이 없습니다.
Tasks
Dictionary LearningDomain AdaptationPseudo LabelUnsupervised Domain AdaptationSimilar Papers 제목 키워드 기반
Unsupervised Vehicle Re-Identification via Self-supervised Metric Learning using Feature Dictionary
The key challenge of unsupervised vehicle re-identification (Re-ID) is learning discriminative features from unlabelled vehicle images. Numerous methods using domain adaptation have achieved outstanding performance, but …
Domain AdaptationMetric LearningTripletUnsupervised Vehicle Re-Identification+1STARK: Structured Dictionary Learning Through Rank-one Tensor Recovery
In recent years, a class of dictionaries have been proposed for multidimensional (tensor) data representation that exploit the structure of tensor data by imposing a Kronecker structure on the dictionary underlying the d…
Dictionary LearningMinimax Lower Bounds for Kronecker-Structured Dictionary Learning
Dictionary learning is the problem of estimating the collection of atomic elements that provide a sparse representation of measured/collected signals or data. This paper finds fundamental limits on the sample complexity …
Dictionary LearningIdentifiability of Kronecker-structured Dictionaries for Tensor Data
This paper derives sufficient conditions for local recovery of coordinate dictionaries comprising a Kronecker-structured dictionary that is used for representing $K$th-order tensor data. Tensor observations are assumed t…
Category Contrast for Unsupervised Domain Adaptation in Visual Tasks
Instance contrast for unsupervised representation learning has achieved great success in recent years. In this work, we explore the idea of instance contrastive learning in unsupervised domain adaptation (UDA) and propos…
Contrastive LearningDomain AdaptationRepresentation LearningUnsupervised Domain Adaptation