Benchmarking Feature Upsampling Methods for Vision Foundation Models using Interactive Segmentation

Volodymyr Havrylov, Haiwen Huang, Dan Zhang, Andreas Geiger
5/4/2025
cs.CVcs.AIcs.LG

Official code: havrylovv/iSegProbe (6 stars, MIT, last commit 2025-05-09).

Abstract

Vision Foundation Models (VFMs) are large-scale, pre-trained models that serve as general-purpose backbones for various computer vision tasks. As VFMs' popularity grows, there is an increasing interest in understanding their effectiveness for dense prediction tasks. However, VFMs typically produce low-resolution features, limiting their direct applicability in this context. One way to tackle this limitation is by employing a task-agnostic feature upsampling module that refines VFM features resolution. To assess the effectiveness of this approach, we investigate Interactive Segmentation (IS) as a novel benchmark for evaluating feature upsampling methods on VFMs. Due to its inherent multimodal input, consisting of an image and a set of user-defined clicks, as well as its dense mask output, IS creates a challenging environment that demands comprehensive visual scene understanding. Our benchmarking experiments show that selecting appropriate upsampling strategies significantly improves VFM features quality. The code is released at https://github.com/havrylovv/iSegProbe

View on arXivView PDF

Code Implementations(1)

MIT

Codebase for probing VFMs and Feature Upsamplers using Intractive Segmentation.

60Cython, PythonApr 23, 20251 years agoMIT
feature-upsamplinginteractive-segmentationprobingupsamplingvision-foundation-model

Similar Papers

Cite this paper

@article{havrylov2025benchmarking,
  title  = {Benchmarking Feature Upsampling Methods for Vision Foundation Models using Interactive Segmentation},
  author = {Volodymyr Havrylov and Haiwen Huang and Dan Zhang and Andreas Geiger},
  year   = {2025},
  eprint = {2505.02075},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.02075v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.02075.svg)](https://codeofpaper.com/paper/2505.02075)

Discussion