Papers › Puzzle-CAM: Improved localization via matching partial and full features
Puzzle-CAM: Improved localization via matching partial and full features
Sanghyun Jo, In-Jae Yu
Weakly-supervised semantic segmentation (WSSS) is introduced to narrow the gap for semantic segmentation performance from pixel-level supervision to image-level supervision. Most advanced approaches are based on class activation maps (CAMs) to generate pseudo-labels to train the segmentation network. The main limitation of WSSS is that the process of generating pseudo-labels from CAMs that use an image classifier is mainly focused on the most discriminative parts of the objects. To address this issue, we propose Puzzle-CAM, a process that minimizes differences between the features from separate patches and the whole image. Our method consists of a puzzle module and two regularization terms to discover the most integrated region in an object. Puzzle-CAM can activate the overall region of an object using image-level supervision without requiring extra parameters. % In experiments, Puzzle-CAM outperformed previous state-of-the-art methods using the same labels for supervision on the PASCAL VOC 2012 test dataset. In experiments, Puzzle-CAM outperformed previous state-of-the-art methods using the same labels for supervision on the PASCAL VOC 2012 dataset. Code associated with our experiments is available at https://github.com/OFRIN/PuzzleCAM.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_citation_path(paper_1="2101.11253", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2101.11253")
Code
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.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Weakly-Supervised Semantic Segmentation | PASCAL VOC 2012 test | Puzzle-CAM (ResNeSt-269) | Mean IoU | 72.2 | #22 of 60 | Archive leaderboard | report |
| Weakly-Supervised Semantic Segmentation | PASCAL VOC 2012 test | Puzzle-CAM (ResNeSt-101) | Mean IoU | 67.7 | #55 of 60 | Archive leaderboard | report |
| Weakly-Supervised Semantic Segmentation | PASCAL VOC 2012 val | Puzzle-CAM (ResNeSt-269) | Mean IoU | 71.9 | #22 of 73 | Archive leaderboard | report |
| Weakly-Supervised Semantic Segmentation | PASCAL VOC 2012 val | Puzzle-CAM (ResNeSt-101) | Mean IoU | 66.9 | #64 of 73 | 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.
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