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

Rongkai Ma

dblp:289/1938 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2023
0000-0001-8574-6239ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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
4 papers
Transfer learning and domain adaptation · 54% Representation and self-supervised learning · 18% Video understanding and tracking · 15%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
few-shot classification
1.122022
Rethinking Generalization in Few-Shot Classification · NeurIPS 2022
Adaptive Poincaré Point to Set Distance for Few-Shot Classification · AAAI 2022
Computer vision › Video understanding and tracking
multi-object tracking
0.712023
Looking Beyond Two Frames: End-to-End Multi-Object Tracking Using Spatial and Temporal Transformers · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Machine learning › Transfer learning and domain adaptation › few-shot learning
few-shot image classification
0.612022
Learning Instance and Task-Aware Dynamic Kernels for Few-Shot Learning · ECCV (20) 2022
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.612022
Learning Instance and Task-Aware Dynamic Kernels for Few-Shot Learning · ECCV (20) 2022
Machine learning › Learning theory
generalization
0.612022
Rethinking Generalization in Few-Shot Classification · NeurIPS 2022
Machine learning › Representation and self-supervised learning › representation learning
metric learning
0.612022
Adaptive Poincaré Point to Set Distance for Few-Shot Classification · AAAI 2022
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › masked modeling
masked image modeling
0.212022
Rethinking Generalization in Few-Shot Classification · NeurIPS 2022

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

transformer · 0.7temporal attention · 0.7spatial attention · 0.7vision transformer · 0.6tangent bundle weighting · 0.6poincaré point-to-set distance · 0.6meta-learning · 0.6dynamic convolution · 0.6
YearPublicationVenuePosition
2023 Looking Beyond Two Frames: End-to-End Multi-Object Tracking Using Spatial and Temporal Transformers
abstract
Tracking a time-varying indefinite number of objects in a video sequence over time remains a challenge despite recent advances in the field. Most existing approaches are not able to properly handle multi-object tracking challenges such as occlusion, in part because they ignore long-term temporal information. To address these shortcomings, we present MO3TR: a truly end-to-end Transformer-based online multi-object tracking (MOT) framework that learns to handle occlusions, track initiation and termination without the need for an explicit data association module or any heuristics. MO3TR encodes object interactions into long-term temporal embeddings using a combination of spatial and temporal Transformers, and recursively uses the information jointly with the input data to estimate the states of all tracked objects over time. The spatial attention mechanism enables our framework to learn implicit representations between all the objects and the objects to the measurements, while the temporal attention mechanism focuses on specific parts of past information, allowing our approach to resolve occlusions over multiple frames. Our experiments demonstrate the potential of this new approach, achieving results on par with or better than the current state-of-the-art on multiple MOT metrics for several popular multi-object tracking benchmarks.
Tianyu Zhu 0001, Markus Hiller, Mahsa Ehsanpour, Rongkai Ma, Tom Drummond, Ian D. Reid 0001, Seyed Hamid Rezatofighi
IEEE Trans. Pattern Anal. Mach. Intell.4
2022 Adaptive Poincaré Point to Set Distance for Few-Shot Classification
abstract
Learning and generalizing from limited examples, i.e., few-shot learning, is of core importance to many real-world vision applications. A principal way of achieving few-shot learning is to realize an embedding where samples from different classes are distinctive. Recent studies suggest that embedding via hyperbolic geometry enjoys low distortion for hierarchical and structured data, making it suitable for few-shot learning. In this paper, we propose to learn a context-aware hyperbolic metric to characterize the distance between a point and a set associated with a learned set to set distance. To this end, we formulate the metric as a weighted sum on the tangent bundle of the hyperbolic space and develop a mechanism to obtain the weights adaptively, based on the constellation of the points. This not only makes the metric local but also dependent on the task in hand, meaning that the metric will adapt depending on the samples that it compares. We empirically show that such metric yields robustness in the presence of outliers and achieves a tangible improvement over baseline models. This includes the state-of-the-art results on five popular few-shot classification benchmarks, namely mini-ImageNet, tiered-ImageNet, Caltech-UCSD Birds-200-2011(CUB), CIFAR-FS, and FC100.
Rongkai Ma, Pengfei Fang, Tom Drummond, Mehrtash Harandi
AAAI1
2022 Learning Instance and Task-Aware Dynamic Kernels for Few-Shot Learning
Rongkai Ma, Pengfei Fang, Gil Avraham, Tianyu Zhu 0001, Tom Drummond, Mehrtash Harandi
ECCV (20)1
2022 Rethinking Generalization in Few-Shot Classification
abstract
Single image-level annotations only correctly describe an often small subset of an image’s content, particularly when complex real-world scenes are depicted. While this might be acceptable in many classification scenarios, it poses a significant challenge for applications where the set of classes differs significantly between training and test time. In this paper, we take a closer look at the implications in the context of few-shot learning. Splitting the input samples into patches and encoding these via the help of Vision Transformers allows us to establish semantic correspondences between local regions across images and independent of their respective class. The most informative patch embeddings for the task at hand are then determined as a function of the support set via online optimization at inference time, additionally providing visual interpretability of ‘what matters most’ in the image. We build on recent advances in unsupervised training of networks via masked image modelling to overcome the lack of fine-grained labels and learn the more general statistical structure of the data while avoiding negative image-level annotation influence, aka supervision collapse. Experimental results show the competitiveness of our approach, achieving new state-of-the-art results on four popular few-shot classification benchmarks for 5-shot and 1-shot scenarios.
Markus Hiller, Rongkai Ma, Mehrtash Harandi, Tom Drummond
NeurIPS2
2021 Learning Online for Unified Segmentation and Tracking Models
abstract
Tracking requires building a discriminative model for the target in the inference stage. An effective way to achieve this is online learning, which can comfortably outperform models that are only trained offline. Recent research shows that visual tracking benefits significantly from the unification of visual tracking and segmentation due to its pixel-level discrimination. However, it imposes a great challenge to perform online learning for such a unified model. A segmentation model cannot easily learn from prior information given in the visual tracking scenario. In this paper, we propose TrackMLP: a novel meta-learning method optimized to learn from only partial information to resolve the imposed challenge. Our model is capable of extensively exploiting limited prior information hence possesses much stronger target-background discriminability than other online learning methods. Empirically, we show that our model achieves state-of-the-art performance and tangible improvement over competing models. Our model achieves improved average overlaps of 66.0%,67.1%, and 68.5% in VOT2019, VOT2018, and VOT2016 datasets, which are 6.4%, 7.3%, and 6.4% higher than our baseline. Code will be made publicly available.
Tianyu Zhu 0001, Mehrtash Harandi, Rongkai Ma, Tom Drummond
IJCNN3