arXiv:2503.03228cs.CV2025-03AAAI

同一网络动态调整路径,实现不同算力下的高效图像抠图。

Path-Adaptive Matting for Efficient Inference Under Various Computational Cost Constraints

  • 根据图像内容和算力限制,动态选择网络路径。
  • 在五个数据集上均保持竞争力,适配多种计算成本。
  • 在线学习路径标签,无需预设路径,灵活高效。

本文提出一种新型图像抠图方法——路径自适应抠图(Path-Adaptive Matting, PAM),旨在单一网络下实现不同计算成本约束(特别是FLOP限制)下的高效推理。现有抠图方法未探索可扩展架构或路径学习策略,难以应对该挑战。为此,我们建立双层优化框架,联合优化抠图网络与路径估计器。设计路径自适应架构,引入路径选择层与可学习连接层,实现统一网络内的最优路径估计与高效推理。进一步提出性能感知的路径学习策略,通过采样少量先验最优路径并结合网络预测生成在线路径标签,实现鲁棒高效的在线路径学习。在五个图像抠图数据集上的实验表明,PAM在多种计算成本约束下均表现出色。

原文摘要 · Abstract (English)

In this paper, we explore a novel image matting task aimed at achieving efficient inference under various computational cost constraints, specifically FLOP limitations, using a single matting network. Existing matting methods which have not explored scalable architectures or path-learning strategies, fail to tackle this challenge. To overcome these limitations, we introduce Path-Adaptive Matting (PAM), a framework that dynamically adjusts network paths based on image contexts and computational cost constraints. We formulate the training of the computational cost-constrained matting network as a bilevel optimization problem, jointly optimizing the matting network and the path estimator. Building on this formalization, we design a path-adaptive matting architecture by incorporating path selection layers and learnable connect layers to estimate optimal paths and perform efficient inference within a unified network. Furthermore, we propose a performance-aware path-learning strategy to generate path labels online by evaluating a few paths sampled from the prior distribution of optimal paths and network estimations, enabling robust and efficient online path learning. Experiments on five image matting datasets demonstrate that the proposed PAM framework achieves competitive performance across a range of computational cost constraints.

图像抠图动态路径高效推理FLOP约束

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