Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kaibin Tian

dblp:289/6123 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0002-3291-1146ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 5 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Vision and language · 50% Efficient and distributed learning · 50%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 88% Data integration and cleaning · 12%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
cross-modal distillation
0.812024
Holistic Features are Almost Sufficient for Text-to-Video Retrieval · CVPR 2024
Computer vision › Vision and language
cross-modal retrieval
0.812024
Towards Efficient and Effective Text-to-Video Retrieval with Coarse-to-Fine Visual Representation Learning · AAAI 2024
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.812024
Holistic Features are Almost Sufficient for Text-to-Video Retrieval · CVPR 2024
Computer vision › Vision and language › video-text retrieval
text-to-video retrieval
0.812024
Holistic Features are Almost Sufficient for Text-to-Video Retrieval · CVPR 2024
Information retrieval
multimedia analysis and retrieval
0.812024
Towards Efficient and Effective Text-to-Video Retrieval with Coarse-to-Fine Visual Representation Learning · AAAI 2024
Information retrieval › cross-modal retrieval
text-to-video retrieval
0.812024
Towards Efficient and Effective Text-to-Video Retrieval with Coarse-to-Fine Visual Representation Learning · AAAI 2024
Multimedia analysis and retrieval
video captioning
0.712023
ChinaOpen: A Dataset for Open-world Multimodal Learning · ACM Multimedia 2023

Methods — techniques the papers use, named apart from their topics

text-gated interaction · 1.5pearson constraint · 1.5coarse-to-fine representation learning · 1.5text-based data cleaning · 1.3multimodal learning · 1.3generative video-to-text transformer · 1.3content-based data cleaning · 1.3knowledge distillation · 0.8attention aggregation · 0.8CLIP · 0.8
YearPublicationVenuePosition
2026 Co-teaching for Unsupervised Domain Expansion
Hailan Lin, Qijie Wei, Kaibin Tian, Ruixiang Zhao, Xirong Li 0001
MMM (1)3
2024 Towards Efficient and Effective Text-to-Video Retrieval with Coarse-to-Fine Visual Representation Learning
abstract
In recent years, text-to-video retrieval methods based on CLIP have experienced rapid development. The primary direction of evolution is to exploit the much wider gamut of visual and textual cues to achieve alignment. Concretely, those methods with impressive performance often design a heavy fusion block for sentence (words)-video (frames) interaction, regardless of the prohibitive computation complexity. Nevertheless, these approaches are not optimal in terms of feature utilization and retrieval efficiency. To address this issue, we adopt multi-granularity visual feature learning, ensuring the model's comprehensiveness in capturing visual content features spanning from abstract to detailed levels during the training phase. To better leverage the multi-granularity features, we devise a two-stage retrieval architecture in the retrieval phase. This solution ingeniously balances the coarse and fine granularity of retrieval content. Moreover, it also strikes a harmonious equilibrium between retrieval effectiveness and efficiency. Specifically, in training phase, we design a parameter-free text-gated interaction block (TIB) for fine-grained video representation learning and embed an extra Pearson Constraint to optimize cross-modal representation learning. In retrieval phase, we use coarse-grained video representations for fast recall of top-k candidates, which are then reranked by fine-grained video representations. Extensive experiments on four benchmarks demonstrate the efficiency and effectiveness. Notably, our method achieves comparable performance with the current state-of-the-art methods while being nearly 50 times faster.
Kaibin Tian, Yanhua Cheng, Xinglin Hou, Quan Chen 0006, Han Li 0005
AAAI1
2024 Holistic Features are Almost Sufficient for Text-to-Video Retrieval
abstract
For text-to-video retrieval (T2VR), which aims to retrieve unlabeled videos by ad-hoc textual queries, CLIP-based methods currently lead the way. Compared to CLIP4Clip which is efficient and compact, state-of-the-art models tend to compute video-text similarity through fine-grained cross-modal feature interaction and matching, putting their scalability for large-scale T2VR applications into doubt. We propose TeachCLIP, enabling a CLIP4Clip based student network to learn from more advanced yet computationally intensive models. In order to create a learning channel to convey fine-grained cross-modal knowledge from a heavy model to the student, we add to CLIP4Clip a simple Attentionalframe-Feature Aggregation (AFA) block, which by design adds no extra storage /computation overhead at the retrieval stage. Frame-text relevance scores calculated by the teacher network are used as soft labels to supervise the attentive weights produced by AFA. Extensive experiments on multiple public datasets justify the viability of the proposed method. TeachCLIP has the same efficiency and compact-ness as CLIP4Clip, yet has near-SOTA effectiveness.
Kaibin Tian, Ruixiang Zhao, Zijie Xin, Bangxiang Lan, Xirong Li 0001
CVPR1
2023 ChinaOpen: A Dataset for Open-world Multimodal Learning
abstract
This paper introduces ChinaOpen, a dataset sourced from Bilibili, a popular Chinese video-sharing website, for open-world multimodal learning. While the state-of-the-art multimodal learning networks have shown impressive performance in automated video annotation and cross-modal video retrieval, their training and evaluation are primarily conducted on YouTube videos with English text. Their effectiveness on Chinese data remains to be verified. In order to support multimodal learning in the new context, we construct ChinaOpen-50k, a webly annotated training set of 50k Bilibili videos associated with user-generated titles and tags. Both text-based and content-based data cleaning are performed to remove low-quality videos in advance. For a multi-faceted evaluation, we build ChinaOpen-1k, a manually labeled test set of 1k videos. Each test video is accompanied with a manually checked user title and a manually written caption. Besides, each video is manually tagged to describe objects / actions / scenes shown in the visual content. The original user tags are also manually checked. Moreover, with all the Chinese text translated into English, ChinaOpen-1k is also suited for evaluating models trained on English data. In addition to ChinaOpen, we propose Generative Video-to-text Transformer (GVT) for Chinese video captioning. We conduct an extensive evaluation of the state-of-the-art single-task / multi-task models on the new dataset, resulting in a number of novel findings and insights.
Aozhu Chen, Chengbo Dong, Kaibin Tian, Ruixiang Zhao, Xun Liang 0001, Zhanhui Kang, Xirong Li 0001
ACM Multimedia4
2021 Unsupervised Domain Expansion for Visual Categorization
abstract
Expanding visual categorization into a novel domain without the need of extra annotation has been a long-term interest for multimedia intelligence. Previously, this challenge has been approached by unsupervised domain adaptation (UDA). Given labeled data from a source domain and unlabeled data from a target domain, UDA seeks for a deep representation that is both discriminative and domain-invariant. While UDA focuses on the target domain, we argue that the performance on both source and target domains matters, as in practice which domain a test example comes from is unknown. In this article, we extend UDA by proposing a new task called unsupervised domain expansion (UDE), which aims to adapt a deep model for the target domain with its unlabeled data, meanwhile maintaining the model’s performance on the source domain. We propose Knowledge Distillation Domain Expansion (KDDE) as a general method for the UDE task. Its domain-adaptation module can be instantiated with any existing model. We develop a knowledge distillation-based learning mechanism, enabling KDDE to optimize a single objective wherein the source and target domains are equally treated. Extensive experiments on two major benchmarks, i.e., Office-Home and DomainNet, show that KDDE compares favorably against four competitive baselines, i.e., DDC, DANN, DAAN, and CDAN, for both UDA and UDE tasks. Our study also reveals that the current UDA models improve their performance on the target domain at the cost of noticeable performance loss on the source domain.
Kaibin Tian, Dayong Ding, Gang Yang 0001, Xirong Li 0001
ACM Trans. Multim. Comput. Commun. Appl.2