Papers › Self-Supervised Transformers for Unsupervised Object Discovery using Normalized Cut

Self-Supervised Transformers for Unsupervised Object Discovery using Normalized Cut

23 Feb 2022CVPR 2022 1arXiv:2202.11539archive 2025-07-28

Yangtao Wang, Xi Shen, Shell Hu, Yuan Yuan, James Crowley, Dominique Vaufreydaz

Transformers trained with self-supervised learning using self-distillation loss (DINO) have been shown to produce attention maps that highlight salient foreground objects. In this paper, we demonstrate a graph-based approach that uses the self-supervised transformer features to discover an object from an image. Visual tokens are viewed as nodes in a weighted graph with edges representing a connectivity score based on the similarity of tokens. Foreground objects can then be segmented using a normalized graph-cut to group self-similar regions. We solve the graph-cut problem using spectral clustering with generalized eigen-decomposition and show that the second smallest eigenvector provides a cutting solution since its absolute value indicates the likelihood that a token belongs to a foreground object. Despite its simplicity, this approach significantly boosts the performance of unsupervised object discovery: we improve over the recent state of the art LOST by a margin of 6.9%, 8.1%, and 8.1% respectively on the VOC07, VOC12, and COCO20K. The performance can be further improved by adding a second stage class-agnostic detector (CAD). Our proposed method can be easily extended to unsupervised saliency detection and weakly supervised object detection. For unsupervised saliency detection, we improve IoU for 4.9%, 5.2%, 12.9% on ECSSD, DUTS, DUT-OMRON respectively compared to previous state of the art. For weakly supervised object detection, we achieve competitive performance on CUB and ImageNet.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2202.11539")

Code

Syntology Ran 1 of 1 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 1 ran · fixture could not drive it.

By repository: community (archive-listed): 1 sample from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

YangtaoWANG95/TokenCut mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

1 sample harvested; 1 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · fixture could not drive it

Licence: 0 of the 1 sample are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from YangtaoWANG95/TokenCut. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

mask_color_compose YangtaoWANG95/TokenCut/unsupervised_saliency_detection/get_saliency.py community (archive-listed) ran · fixture could not drive it MIT (permissive) · 9eb48bfcce51ff49 · report

Tasks

ObjectObject DetectionObject DiscoverySaliency DetectionSingle-object discoveryUnsupervised Saliency DetectionWeakly Supervised Object DetectionWeakly-Supervised Object Localizationobject-detection

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Single-object discovery COCO_20k TokenCut + CAD CorLoc 62.6 #4 of 10 Archive leaderboard report
Single-object discovery COCO_20k TokenCut CorLoc 58.8 #5 of 10 Archive leaderboard report
Unsupervised Saliency Detection DUT-OMRON TokenCut Accuracy 89.7 #3 of 3 Archive leaderboard report
Unsupervised Saliency Detection DUT-OMRON TokenCut IoU 61.8 #3 of 3 Archive leaderboard report
Unsupervised Saliency Detection DUT-OMRON TokenCut maximal F-measure 69.7 #3 of 3 Archive leaderboard report
Unsupervised Saliency Detection DUTS TokenCut Accuracy 91.4 #3 of 3 Archive leaderboard report
Unsupervised Saliency Detection DUTS TokenCut IoU 62.4 #3 of 3 Archive leaderboard report
Unsupervised Saliency Detection DUTS TokenCut maximal F-measure 75.5 #3 of 3 Archive leaderboard report
Unsupervised Saliency Detection ECSSD TokenCut Accuracy 93.4 #3 of 3 Archive leaderboard report
Unsupervised Saliency Detection ECSSD TokenCut IoU 77.2 #3 of 3 Archive leaderboard report
Unsupervised Saliency Detection ECSSD TokenCut maximal F-measure 87.4 #3 of 3 Archive leaderboard report
Weakly-Supervised Object Localization CUB TokenCut Top-1 Localization Accuracy 72.9 #1 of 1 Archive leaderboard report
Weakly-Supervised Object Localization CUB-200-2011 TokenCut Top-1 Localization Accuracy 72.9 #7 of 10 Archive leaderboard report
Weakly-Supervised Object Localization ImageNet TokenCut GT-known localization accuracy 65.4 #4 of 6 Archive leaderboard report
Weakly-Supervised Object Localization ImageNet TokenCut Top-1 Localization Accuracy 52.3 #4 of 6 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Spectral Clustering

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections