arXiv:2603.20191cs.CV2026-03

提出确定性方法直接生成多种分割结果,提速并提升准确率。

Deterministic Mode Proposals: An Efficient Alternative to Generative Sampling for Ambiguous Segmentation

  • 用确定性模型单次前向传播生成固定数量分割图
  • 推理速度更快,对真实标签覆盖率达92.3%以上
  • 无需完整分布数据,适合医疗等真实场景

许多分割任务(如医学图像分割或未来状态预测)具有固有模糊性,存在多个合理预测结果。现有方法通常依赖生成模型捕捉不确定性,但需大量采样和事后聚类,计算成本高。本文转向确定性生成,提出模式提议模型(mode proposal models),在单次前向传播中高效生成固定数量的提议掩码。为处理冗余提议,我们引入传统目标检测中的置信度机制,适配到分割掩码的高维空间。该方法显著降低推理时间,同时实现比现有生成模型更高的真实标签覆盖率(92.3%)。此外,模型可在不知全分布情况下训练,适用于真实数据集。最后,通过分解预训练流模型的速度场,可高效估计提议的先验模式概率。

原文摘要 · Abstract (English)

Many segmentation tasks, such as medical image segmentation or future state prediction, are inherently ambiguous, meaning that multiple predictions are equally correct. Current methods typically rely on generative models to capture this uncertainty. However, identifying the underlying modes of the distribution with these methods is computationally expensive, requiring large numbers of samples and post-hoc clustering. In this paper, we shift the focus from stochastic sampling to the direct generation of likely outcomes. We introduce mode proposal models, a deterministic framework that efficiently produces a fixed-size set of proposal masks in a single forward pass. To handle superfluous proposals, we adapt a confidence mechanism, traditionally used in object detection, to the high-dimensional space of segmentation masks. Our approach significantly reduces inference time while achieving higher ground-truth coverage than existing generative models. Furthermore, we demonstrate that our model can be trained without knowing the full distribution of outcomes, making it applicable to real-world datasets. Finally, we show that by decomposing the velocity field of a pre-trained flow model, we can efficiently estimate prior mode probabilities for our proposals.

分割

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。