Searcharxiv⌕ Search

arXiv · 2610.22921

MaskMerge: Structure-aware Token Merging for Efficient Instance Segmentation

Abstract

Token merging improves the efficiency of Vision Transformers by combining redundant tokens, but existing methods largely rely on feature similarity to determine which tokens to merge. This criterion is effective for semantic segmentation, yet can fail in instance segmentation, where adjacent objects of the same class often have highly similar features. We identify this failure mode as cross-instance token fusion. We introduce MaskMerge, an instance-aware token merging method that uses coarse intermediate mask predictions to constrain feature-based merging and preserve instance boundaries. We evaluate MaskMerge on two diverse instance segmentation domains characterized by high inter-instance visual similarity: PanNuke and iSAID. Against the SOTA token merging method ALGM, MaskMerge improves mAP from 30.1 to 32.1 on PanNuke while reducing computation from 229 to 153 GFLOPs and running 1.18x faster, and from 33.1 to 36.2 on iSAID while reducing computation from 198 to 182 GFLOPs and running 1.23x faster. Additionally, we also test it on Cityscapes and match ALGM's performance while using fewer FLOPs. The gains also transfer to an MAE pretrained backbone, demonstrating that instance-aware merging enables more aggressive compression when appearance similarity alone cannot reliably preserve object identity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bavesh Balaji, Letian Jiang, Alexander Wong, David Clausi, Sirisha Rambhatla. 2026-10-16. MaskMerge: Structure-aware Token Merging for Efficient Instance Segmentation. https://arxiv.org/abs/2610.22921

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

RAD: A Realistic Multi-View Benchmark for Pose-Agnostic Anomaly Detection

Anomaly detection is essential for robotic perception and industrial inspection, yet most benchmarks are collected under controlled conditions with fixed viewpoints and stable illumination. These settings do not reflect robotic deployment, where camera pose, lighting, and surface reflectance vary continuously. We present RAD (Realistic Anomaly Detection), a robot-captured multi-view benchmark for pose-agnostic anomaly detection. RAD contains 4,047 RGB images from 13 everyday object categories, captured from 68 viewpoints per object with a Franka robotic arm and an RGB-D camera under uncontrolled lighting. The dataset covers four realistic defect types: scratched, missing, stained, and squeezed, with pixel-level annotations for localization. We benchmark representative 2D feature-based methods, 3D reconstruction pipelines, and vision-language models under a realistic setting in which test poses are unknown. Results show a clear gap between performance on conventional benchmarks and performance on RAD. Strong 2D feature-embedding methods remain the most reliable at image-level detection, whereas 3D approaches are more competitive for pixel-level localization but remain vulnerable to reflective materials, geometric symmetry, and sparse viewpoint coverage. Vision-language models perform poorly in both classification and localization. RAD provides a challenging testbed for robust robotic inspection and highlights open problems in jointly modeling appearance, geometry, and viewpoint uncertainty. Our website and code are available at https://chang-xinhai.github.io/rad-website/.

cs.CV↗

Rethinking Negative Prompting for Concept Suppression: Unconditional Anchoring and Localized Guidance

Text-to-image diffusion models have rapidly transitioned from research prototypes to widely deployed tools. Along with their impressive capabilities, these models can also generate harmful or undesirable content (e.g., NSFW imagery), motivating practical mechanisms for removing such concepts. Negative prompting, which uses the negative-prompt prediction as the guidance anchor, is among the most widely used mechanisms for steering sampling trajectories away from unwanted concepts. However, for jailbreak prompts, it can fail in a regime we refer to as \emph{guidance collapse}, where the model's denoising predictions for the prompt and negative prompt become similar, so that the guidance difference driving negative prompting vanishes and the guided prediction degenerates to the negative-prompt prediction, undermining suppression. To fix this issue, we propose TraSCE (Trajectory Steering for ConcEpt Suppression), a training-free inference-time method that makes negative prompting reliable under guidance collapse. TraSCE combines two complementary components: (i) unconditional anchoring, which makes the fallback under guidance collapse a neutral unconditional prediction rather than the negative-prompt prediction, and (ii) an alignment-localized steering step, which deliberately induces this collapse for adversarial prompts and steers the sample to the unconditional fallback, while remaining minimally intrusive on benign prompts. We evaluate TraSCE on adversarial prompt benchmarks targeting nudity and violence, and further demonstrate its applicability to suppressing artistic styles and objects. Across these settings, TraSCE substantially improves the robustness of negative prompting to jailbreak prompts without any training, weight updates, or pre-collected concept-specific data (prompts or images), while keeping the impact on general image quality small.

cs.CV↗

GoDe: Gaussians on Demand for Backbone-Agnostic Progressive Compression

Splat-based radiance fields have rapidly diversified in primitive type, kernel support, and appearance parameterization. This diversity makes compression difficult: most codecs are single-rate, requiring a separately optimized model for each target bitrate, while progressive codecs remain tied to representation-specific assumptions that do not transfer across backbones. We introduce GoDe (Gaussians on Demand), a progressive compression framework whose central contribution is backbone agnosticism. It reorganizes any trained differentiable splat representation into a single scalable bitstream without modifying the backbone or re-deriving the compression structure for each new primitive type. GoDe builds a nested level-of-detail hierarchy via masked-gradient importance ranking, refines all levels with one quantization-aware fine-tuning stage, and stores the base layer and enhancement layers as progressive chunks compressed with shared entropy dictionaries. Any decoded prefix is directly renderable, so one training pipeline provides multiple rate-distortion operating points without per-rate retraining. Across five heterogeneous backbones and three standard benchmarks, GoDe achieves competitive rate-distortion performance while enabling faster rendering and substantially faster progressive decoding than existing methods. Project page: https://gaussians-on-demand.github.io/

cs.CV↗