Papers › Bridge the Points: Graph-based Few-shot Segment Anything Semantically

Bridge the Points: Graph-based Few-shot Segment Anything Semantically

9 Oct 2024arXiv:2410.06964archive 2025-07-28

Anqi Zhang, Guangyu Gao, Jianbo Jiao, Chi Harold Liu, Yunchao Wei

The recent advancements in large-scale pre-training techniques have significantly enhanced the capabilities of vision foundation models, notably the Segment Anything Model (SAM), which can generate precise masks based on point and box prompts. Recent studies extend SAM to Few-shot Semantic Segmentation (FSS), focusing on prompt generation for SAM-based automatic semantic segmentation. However, these methods struggle with selecting suitable prompts, require specific hyperparameter settings for different scenarios, and experience prolonged one-shot inference times due to the overuse of SAM, resulting in low efficiency and limited automation ability. To address these issues, we propose a simple yet effective approach based on graph analysis. In particular, a Positive-Negative Alignment module dynamically selects the point prompts for generating masks, especially uncovering the potential of the background context as the negative reference. Another subsequent Point-Mask Clustering module aligns the granularity of masks and selected points as a directed graph, based on mask coverage over points. These points are then aggregated by decomposing the weakly connected components of the directed graph in an efficient manner, constructing distinct natural clusters. Finally, the positive and overshooting gating, benefiting from graph-based granularity alignment, aggregate high-confident masks and filter out the false-positive masks for final prediction, reducing the usage of additional hyperparameters and redundant mask generation. Extensive experimental analysis across standard FSS, One-shot Part Segmentation, and Cross Domain FSS datasets validate the effectiveness and efficiency of the proposed approach, surpassing state-of-the-art generalist models with a mIoU of 58.7% on COCO-20i and 35.2% on LVIS-92i. The code is available in https://andyzaq.github.io/GF-SAM/.

PaperPDFCodeCode 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="2410.06964")

Code

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

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

ANDYZAQ/GF-SAM officialmentioned 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

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

Licence: 0 of the 4 samples 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 ANDYZAQ/GF-SAM. “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.

MaybeToTensor ANDYZAQ/GF-SAM/matcher/GFSAM.py official repository ran · metamorphic tier: invariant fingerprinted MIT (permissive) · 4d4aaffd0b403a6d · report
make_normalize_transform ANDYZAQ/GF-SAM/matcher/GFSAM.py official repository ran · our draft was wrong MIT (permissive) · ad3befe6bda5ddf5 · report
GFSAM ANDYZAQ/GF-SAM/matcher/GFSAM.py official repository unverified MIT (permissive) · c6286467a5a914a4 · report
batch_iterator ANDYZAQ/GF-SAM/matcher/GFSAM.py official repository unverified MIT (permissive) · 57dab3bfa3c4491d · report

Tasks

Few-Shot Semantic SegmentationSemantic Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Few-Shot Semantic Segmentation COCO-20i (1-shot) GF-SAM (DINOv2) Mean IoU 58.7 #2 of 85 Archive leaderboard report
Few-Shot Semantic Segmentation COCO-20i (5-shot) GF-SAM (DINOv2) Mean IoU 66.8 #2 of 81 Archive leaderboard report
Few-Shot Semantic Segmentation FSS-1000 (1-shot) GF-SAM (DINOv2) Mean IoU 88 #13 of 24 Archive leaderboard report
Few-Shot Semantic Segmentation FSS-1000 (5-shot) GF-SAM (DINOv2) Mean IoU 88.9 #11 of 22 Archive leaderboard report
Few-Shot Semantic Segmentation PASCAL-5i (1-Shot) GF-SAM (DINOv2) Mean IoU 72.1 #5 of 105 Archive leaderboard report
Few-Shot Semantic Segmentation PASCAL-5i (5-Shot) GF-SAM (DINOv2) Mean IoU 82.6 #2 of 96 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

AttentionDINODense ConnectionsLayer NormalizationLinear LayerMulti-Head AttentionResidual ConnectionSAMSoftmaxVision 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