The advent of foundation models have enabled a new era in zero-shot classification. Yet, key challenges persist. Despite their impressive generalization power that leverages the immense pre-training k...
arXiv:2607. 09104v1 Announce Type: cross Abstract: While the growing availability of image data has driven significant advances, labeling datasets remains costly and time-consuming.
By Camila Piscioneri Magalh\~aes, Lucas Pascotti Valem
License Plate Recognition (LPR) systems are critical tools in traffic monitoring, security enforcement, and urban mobility management. Traditional LPR systems often rely on a multi-stage pipeline involving object detection using You Only Look Once (YOLO) and Optical Character Recognition (OCR), which suffer from limitations such as high resource demands, poor performance in unstructured environments, and the need for large annotated datasets.
arXiv:2609.36648v1 Announce Type: new
Abstract: Vision-language pre-training has reshaped image clustering, giving rise to language-assisted image clustering (LaIC), which leverages textual semantics...
By Yuanwei Hu, Bo Peng, Yuheng Jia, Xinting Hu, Yadan Luo, Wenjie Zhu
arXiv:2609.12552v1 Announce Type: new
Abstract: Open-vocabulary detection accepts any class list at inference, and promptable segmentation returns regions without class names: the taxonomy has left t...
By Ma\"elic Neau
arXiv:2609.36302v1 Announce Type: new
Abstract: While foundation models have revolutionized natural language processing and computer vision by leveraging universal vocabularies, Graph Machine Learnin...
By Ben Finkelshtein, Andr\'{e} Linhares, Petar Veli\v{c}kovi\'{c}, Bryan Perozzi, Mikhail Galkin
The paper investigates whether pretrained image models can generalize to unseen datasets by clustering their embeddings. Using encoders trained only on ImageNet‑1k, both supervised and self‑supervised, the authors evaluate clustering performance on out‑of‑domain images. They find that supervised encoders perform better within the training domain, while self‑supervised encoders excel far outside it, and that fine‑tuning self‑supervised models reverses this trend. Additionally, the study shows that the silhouette score in UMAP‑reduced space correlates strongly with clustering accuracy, offering a proxy metric when labels are unavailable.
By Scott C. Lowe, Joakim Bruslund Haurum, Sageev Oore, Thomas B. Moeslund, Graham W. Taylor
arXiv:2508. 12745v2 Announce Type: replace-cross Abstract: Image set classification (ISC), which can be viewed as a task of comparing similarities between sets consisting of unordered heterogeneous images with variable quantities and qualities, has attracted growing research attention in recent years.
By Xizhan Gao, Wei Hu
arXiv:2607. 06254v1 Announce Type: cross Abstract: Deepfake image detection is currently served by three fundamentally different paradigms: commercial APIs, zero-shot vision-language models (LLMs), and open-source detectors.
By Sharayu N. Deshmukh, Md Rashidunnabi, Nelton Tiago Gemo, Kurundkar G. D., Mahamune M. R., Nilesh K. Deshmukh
arXiv:2608.29929v1 Announce Type: new
Abstract: Vehicle attribute recognition is an important task in intelligent transportation systems, particularly when Automatic License Plate Recognition (ALPR)...
By Alexandre V. Delazeri, Gabriel E. Lima, Eduil Nascimento Jr, Rayson Laroca, David Menotti
The paper presents a semi‑supervised framework that uses open‑vocabulary object detectors to generate region proposals and semantic representations, builds an object‑level similarity graph, and propagates probabilistic labels to assign soft, uncertainty‑aware annotations to previously unlabeled objects. Experiments on four detection benchmarks show that high‑quality soft labels can be produced with only a small fraction of manual annotations, and models trained on these semi‑automatically annotated datasets achieve performance comparable to fully manually annotated models. On COCO, the method reaches 40.5% AP, nearly matching the 40.9% AP of a fully annotated model while incurring only 1% of the labeling cost.
By Jonathan Klees, Timo Heller, Matthias Rottmann
JEPAMatch introduces a new semi‑supervised learning framework that replaces traditional output‑thresholding with explicit geometric shaping of latent representations. By combining the FlexMatch loss with a latent‑space regularization inspired by LeJEPA, the method encourages isotropic Gaussian structure in the embedding space, mitigating class imbalance and noisy pseudo‑labels. Experiments on CIFAR‑100, STL‑10, and Tiny‑ImageNet show consistent performance gains and faster convergence compared to existing FixMatch‑based baselines.
By Ali Aghababaei-Harandi, Aude Sportisse, Massih-Reza Amini