Portrait of Lukas Knobel

Lukas Knobel

ELLIS PhD candidate

Fundamental AI Lab, University of Technology Nuremberg, Germany

Visiting the Visual Geometry Group (VGG), University of Oxford, UK.

Self-supervised & representation learning for images and video

[ ABOUT ]

I am an ELLIS PhD candidate in the Fundamental AI Lab at the University of Technology Nuremberg, supervised by Yuki Asano. I am co-supervised by Andrew Zisserman (Visual Geometry Group) at the University of Oxford. Previously, I worked as a Machine Learning Scientist at TNO in the Netherlands. My academic background includes an MSc in Artificial Intelligence from the University of Amsterdam and a Bachelor’s in Computer Engineering, completed in collaboration with Airbus. My research focuses on self-supervised learning for vision and multimodal foundation models.

[ LATEST NEWS ]

19 Oct 2026

I started my research visit to the Visual Geometry Group (VGG) at the University of Oxford, working with my co-supervisor Andrew Zisserman as part of my ELLIS PhD program.

24 Sep 2026

Our paper "I Have a Stream: Making Self-Supervised Learning Work on Continuous Video" has been accepted at NeurIPS2026!

14 Apr 2026

Together with the Fundamental AI Lab, I spent 10 days in Japan visiting research groups as part of the JST ASPIRE program. In Tokyo, I presented my ongoing work at the ASPIRE workshop and research discussions at institutes including AIST, Sakana AI, and Sony AI.

21 Feb 2026

Our paper "Franca: Nested Matryoshka Clustering for Scalable Visual Representation Learning" has been accepted at CVPR2026!

10 Feb 2025

I've been admitted to the ELLIS PhD program, jointly supervised by Yuki Asano (University of Technology Nuremberg, Germany) and Andrew Zisserman (University of Oxford, UK).

[ SELECTED PUBLICATIONS ]

2026 I Have a Stream: Making Self-Supervised Learning Work on Continuous Video Ivan Martinović, Lukas Knobel, and Yuki M. Asano NeurIPS 2026 Abs | PDF | Project
Self-supervised learning draws inspiration from infant visual development, yet standard training pipelines bear little resemblance to it: images are independently sampled and globally shuffled across epochs. We study self-supervised learning from continuous video streams, where frames are consumed in temporal order using strict sliding-window batches, without global reshuffling or multi-epoch replay. To this end, we construct WT++, a 95-hour urban walking-tour video dataset for streaming pretraining. Combined with a comprehensive evaluation suite we find that contrastive and distillation-based methods struggle in this setting, while MAE is more robust but still falls short of standard i.i.d. pretraining. We find that high inter-batch similarity, caused by sliding-window consumption across consecutive batches, does not explain this gap. The main challenge is high intra-batch similarity, where frames within each batch are near-duplicates. To mitigate this, we propose StreamMAE, which preserves the core MAE reconstruction objective while adapting the input pipeline with stream-aware regularization and motion-biased crop selection. StreamMAE outperforms streaming baselines, matches i.i.d. MAE trained on the same video data, remains competitive with ImageNet-pretrained MAE, and scales positively as the pretraining stream grows from 12 to 95 hours.
2026 Self-Supervised Learning of Structured Dynamics from Videos Lukas Knobel, Andrew Zisserman, and Yuki M. Asano Preprint Abs | PDF | Project
Understanding motion in video is a fundamental challenge for visual learning, as frame-to-frame change entangles two sources of dynamics: camera motion and object motion. This decomposition has remained underexplored in representation learning, partly because these factors are tightly coupled in natural videos and difficult to supervise separately. Yet recovering it is important for learning robust motion representations that separate meaningful object dynamics from camera-induced variation. We study whether such structured motion representations can be recovered from frozen features of a pretrained image vision transformer. We propose the Structured Dynamics Model (SDM), which explicitly separates the dominant source of temporal change from residual dynamics through future-feature prediction, rather than representing video change with a single entangled latent or with unstructured, spatially dense transition tokens. Training combines self-supervised learning on real video with weak supervision of scene dynamics on synthetic Kubric data. We evaluate SDM on ProbeMotion, a new evaluation suite spanning synthetic and real videos with camera motion, object motion, and combined dynamics. SDM outperforms backbone baselines using global CLS or average-pooled features, and compares favorably to strongly supervised representations such as VGGT on several probes, despite using substantially weaker supervision. These results suggest that pretrained image models can be readily repurposed into structured video-dynamics representations, providing a useful inductive bias for learning and analyzing latent video dynamics.
2026 Franca: Nested matryoshka clustering for scalable visual representation learning Shashanka Venkataramanan*, Valentinos Pariza*, Mohammadreza Salehi, Lukas Knobel, Spyros Gidaris, Elias Ramzi, Andrei Bursuc, and Yuki M. Asano CVPR 2026 Abs | PDF | Code
We present Franca (pronounced Fran-ka): free one; the first fully open-source (data, code, weights) vision foundation model that matches and in many cases surpasses the performance of state-of-the-art proprietary models, e.g., DINOv2, CLIP, SigLIPv2, etc. Our approach is grounded in a transparent training pipeline inspired by Web-SSL and uses publicly available data: ImageNet-21K and a subset of ReLAION-2B. Beyond model release, we tackle critical limitations in SSL clustering methods. While modern models rely on assigning image features to large codebooks via clustering algorithms like Sinkhorn-Knopp, they fail to account for the inherent ambiguity in clustering semantics. To address this, we introduce a parameter-efficient, multi-head clustering projector based on nested Matryoshka representations. This design progressively refines features into increasingly fine-grained clusters without increasing the model size, enabling both performance and memory efficiency. Additionally, we propose a novel positional disentanglement strategy that explicitly removes positional biases from dense representations, thereby improving the encoding of semantic content. This leads to consistent gains on several downstream benchmarks, demonstrating the utility of cleaner feature spaces. Our contributions establish a new standard for transparent, high-performance vision models and open a path toward more reproducible and generalizable foundation models for the broader AI community.
2024 Learning to Count without Annotations Lukas Knobel, Tengda Han*, and Yuki M. Asano* CVPR 2024 Abs | PDF | Code
While recent supervised methods for reference-based object counting continue to improve the performance on benchmark datasets, they have to rely on small datasets due to the cost associated with manually annotating dozens of objects in images. We propose UnCounTR, a model that can learn this task without requiring any manual annotations. To this end, we construct "Self-Collages", images with various pasted objects as training samples, that provide a rich learning signal covering arbitrary object types and counts. Our method builds on existing unsupervised representations and segmentation techniques to successfully demonstrate for the first time the ability of reference-based counting without manual supervision. Our experiments show that our method not only outperforms simple baselines and generic models such as FasterRCNN and DETR, but also matches the performance of supervised counting models in some domains.

→ full list

[ CONTACT ]