atlas

Research map / Detection and segmentation / Open-set and few-shot detection

Learning Hierarchical Image Segmentation For Recognition and By Recognition

ICLR 2024 · Detection and segmentation › Open-set and few-shot detection · approach: Interactive and referring segmentation · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes CAST, a ViT variant using SEEDS superpixel tokens and graph pooling that learns hierarchical part-whole segmentation purely from image-level recognition objectives (self-supervised MoCo or supervised), matching or beating ViT, HSG, SAM on segmentation and classification with lower compute.

Problem

Vision models trained on image-level recognition do not produce consistent hierarchical part-whole segmentation, while segmentation models are trained separately with pixel labels and cannot be directly used for recognition.

Approach

Replace ViT square patches with superpixel segment tokens and insert graph pooling modules that progressively merge segments fine-to-coarse, so the segmentation hierarchy is an internal byproduct of the recognition model trained only with image-level objectives; test-time entropy minimization can further refine segmentation.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use CAST's hierarchical segment tokens and graph pooling instead of ViT tokensCAST-B vs. ViT-B · PartImageNet object segmentationregion mIoU: 25.34 -> 29.66Helped
use CAST instead of SAM-HPartImageNet segmentation · PartImageNet object segmentationregion mIoU: 21.97 -> 29.66Helped
use CAST instead of HSG for hierarchical parsingCAST-S · DensePose 1-label parsingF-score: 26.2 -> 33.2Helped
replace ViT patches and fixed token counts with superpixels and hierarchical token poolingCAST-S · PASCAL-VOC before tuningregion mIoU: 30.9 -> 38.4Helped
use CAST instead of ViTImageNet-100 linear probing · ImageNet-100top-1 accuracy: 78.1 -> 79.9Helped
use CAST instead of ViTImageNet-100 classification · ImageNet-100GFLOPS: 4.7 -> 3.4Helped
replace Graph Pooling with Random Sampling (ablation)CAST-S · ImageNet-100 linear probingaccuracy: 79.9 -> 55.8Hurt
replace Graph Pooling with K-Means (ablation)CAST-S · ImageNet-100 linear probingaccuracy: 79.9 -> 73.9Hurt
replace Graph Pooling with ToMe (ablation)CAST-S · ImageNet-100 linear probingaccuracy: 79.9 -> 78.1Hurt
use Farthest Point Sampling rather than Random Sampling for centroid initialization (ablation)CAST-S · ImageNet-100 linear probingaccuracy: 71.2 -> 79.9Helped
use token granularities 196, 64, 32, 16 rather than 196, 32, 16, 8 (ablation)CAST-S · ImageNet-100 linear probingaccuracy: 78.8 -> 79.9Helped
use SEEDS rather than SLIC superpixels (ablation)CAST · ImageNet-1K classificationtop-1 accuracy: 65.6 -> 68.1Helped

Surprising findings

Limitations

Experimental setup

Datasets: ImageNet-1K ImageNet-100 COCO PartImageNet DensePose PASCAL VOC ADE20K PASCAL-Context

Benchmarks: PartImageNet DensePose PASCAL VOC ADE20K PASCAL-Context ImageNet-1K ImageNet-100

Metrics: region mIoU boundary F-score precision recall F-score top-1 linear probing accuracy GFLOPS

Baselines: ViT SAM HSG Swin Transformer GroupViT ToMe FINCH

Builds on: Vision Transformer MoCo DeiT SEEDS superpixels Segmenter

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy