用自适应分段初始化,让图像回归模型少用一半核函数,提速五成。
Adaptive Segmentation-Based Initialization for Steered Mixture of Experts Image Regression
- 按图像局部特征分段,智能分配核函数位置与参数。
- 相同效果下核函数减少50%,收敛速度提升超50%。
- 适合需高效训练的图像压缩、超分辨等应用。
核函数图像回归方法在图像压缩、光场重建、去噪和超分辨率等任务中表现出优异效率。但其参数估计常依赖梯度下降迭代优化,计算开销大。本文提出一种针对导向混合专家(SMoE)门控网络和带导向核的径向基函数(RBF)网络的自适应分段初始化方法。该方法将核函数分配至预计算的图像分段中,通过迭代优化与核稀疏化过程,为每段求解最优核数量、位置及导向参数。局部段信息被融合为全局初始化,用于后续迭代优化。实验表明,相比广泛使用的规则网格初始化、“先进”K-Means初始化及此前分段初始化方法,本方法在显著提升主观与客观质量的同时,大幅降低模型稀疏性:同等质量下,核函数数量约减少50%;整体运行时间节省最高达50%。分段初始化可高度并行化,理论上任务数等于图像分段数。仅使用4块并行GPU,初始化阶段即可实现50%的加速。
原文摘要 · Abstract (English)
Kernel image regression methods have shown to provide excellent efficiency in many image processing task, such as image and light-field compression, Gaussian Splatting, denoising and super-resolution. The estimation of parameters for these methods frequently employ gradient descent iterative optimization, which poses significant computational burden for many applications. In this paper, we introduce a novel adaptive segmentation-based initialization method targeted for optimizing Steered-Mixture-of Experts (SMoE) gating networks and Radial-Basis-Function (RBF) networks with steering kernels. The novel initialization method allocates kernels into pre-calculated image segments. The optimal number of kernels, kernel positions, and steering parameters are derived per segment in an iterative optimization and kernel sparsification procedure. The kernel information from "local" segments is then transferred into a "global" initialization, ready for use in iterative optimization of SMoE, RBF, and related kernel image regression methods. Results show that drastic objective and subjective quality improvements are achievable compared to widely used regular grid initialization, "state-of-the-art" K-Means initialization and previously introduced segmentation-based initialization methods, while also drastically improving the sparsity of the regression models. For same quality, the novel initialization results in models with around 50% reduction of kernels. In addition, a significant reduction of convergence time is achieved, with overall run-time savings of up to 50%. The segmentation-based initialization strategy itself admits heavy parallel computation; in theory, it may be divided into as many tasks as there are segments in the images. By accessing only four parallel GPUs, run-time savings of already 50% for initialization are achievable.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。