Papers › SimpleClick: Interactive Image Segmentation with Simple Vision Transformers

SimpleClick: Interactive Image Segmentation with Simple Vision Transformers

20 Oct 2022ICCV 2023 1arXiv:2210.11006archive 2025-07-28

Qin Liu, Zhenlin Xu, Gedas Bertasius, Marc Niethammer

Click-based interactive image segmentation aims at extracting objects with a limited user clicking. A hierarchical backbone is the de-facto architecture for current methods. Recently, the plain, non-hierarchical Vision Transformer (ViT) has emerged as a competitive backbone for dense prediction tasks. This design allows the original ViT to be a foundation model that can be finetuned for downstream tasks without redesigning a hierarchical backbone for pretraining. Although this design is simple and has been proven effective, it has not yet been explored for interactive image segmentation. To fill this gap, we propose SimpleClick, the first interactive segmentation method that leverages a plain backbone. Based on the plain backbone, we introduce a symmetric patch embedding layer that encodes clicks into the backbone with minor modifications to the backbone itself. With the plain backbone pretrained as a masked autoencoder (MAE), SimpleClick achieves state-of-the-art performance. Remarkably, our method achieves 4.15 NoC@90 on SBD, improving 21.8% over the previous best result. Extensive evaluation on medical images demonstrates the generalizability of our method. We further develop an extremely tiny ViT backbone for SimpleClick and provide a detailed computational analysis, highlighting its suitability as a practical annotation tool.

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="2210.11006")

Code

Syntology Ran 2 of 3 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 2 samples from 1 repository, 1 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

uncbiag/simpleclick officialmentioned in papermentioned on GitHubpytorchMIT report
yihanhu-2022/diffmatte 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

3 samples harvested; 2 ran; 0 honoured the contract we drafted; 1 has 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 · our draft was wrong
1ran
1unverified

Licence: 1 of the 3 samples is 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 uncbiag/simpleclick. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “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.

handle_exception uncbiag/simpleclick/interactive_demo/canvas.py official repository ran MIT (permissive) · 954d2116dbc85a7b · report
split_points_by_order uncbiag/simpleclick/isegm/model/is_model.py official repository unverified MIT (permissive) · 8bb23b71c17a0a25 · report
get_predictor_and_zoomin_params identical code first harvested elsewhere ran · our draft was wrong licence of this copy not recorded · fca7b0a20cde7062 · report

Tasks

Image SegmentationInteractive SegmentationSegmentationSemantic Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Interactive Segmentation Berkeley SimpleClick (ViT-H, C+L) NoC@90 1.75 #4 of 14 Archive leaderboard report
Interactive Segmentation Berkeley SimpleClick (ViT-H, SBD) NoC@90 2.09 #5 of 14 Archive leaderboard report
Interactive Segmentation DAVIS SimpleClick (ViT-H, C+L) NoC@85 3.41 #4 of 15 Archive leaderboard report
Interactive Segmentation DAVIS SimpleClick (ViT-H, C+L) NoC@90 4.70 #4 of 15 Archive leaderboard report
Interactive Segmentation DAVIS SimpleClick (ViT-H, SBD) NoC@85 4.20 #7 of 15 Archive leaderboard report
Interactive Segmentation DAVIS SimpleClick (ViT-H, SBD) NoC@90 5.34 #7 of 15 Archive leaderboard report
Interactive Segmentation GrabCut SimpleClick (ViT-L, C+L) NoC@85 1.32 #2 of 18 Archive leaderboard report
Interactive Segmentation GrabCut SimpleClick (ViT-L, C+L) NoC@90 1.40 #2 of 18 Archive leaderboard report
Interactive Segmentation GrabCut SimpleClick (ViT-H, SBD) NoC@85 1.32 #4 of 18 Archive leaderboard report
Interactive Segmentation GrabCut SimpleClick (ViT-H, SBD) NoC@90 1.44 #4 of 18 Archive leaderboard report
Interactive Segmentation SBD SimpleClick NoC@85 2.51 #2 of 14 Archive leaderboard report
Interactive Segmentation SBD SimpleClick NoC@90 4.15 #2 of 14 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

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformerVision Transformer

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