针对边缘场景重建,提出按需采样传输的高效协同建模方法。
STT-GS: Sample-Then-Transmit Edge Gaussian Splatting with Joint Client Selection and Power Control
- 先采样后传输:用少量图像预测各客户端贡献,指导资源分配。
- 低采样率下精准预测(如10%),显著降低通信开销。
- 适合无人机等分布式设备的实时高质3D重建场景。
边缘高斯点云(EGS)通过聚合来自分布式客户端(如无人机)的数据,在边缘端(如地面服务器)训练全局点云模型,是低空经济中场景重建的新范式。与传统侧重通信吞吐或通用学习性能的边缘资源管理不同,EGS专注于最大化点云质量,现有方法不适用。为此,本文提出面向点云质量的新型目标函数,可区分不同客户端视图贡献的异质性。但评估该函数需客户端图像,引发因果困境。为此,本文进一步提出‘先采样后传输’的边缘高斯点云(STT-GS)策略:首先从每个客户端采样少量图像作为先导数据,用于损失预测;基于第一阶段评估结果,优先分配通信资源给价值更高的客户端。为实现高效采样,提出特征域聚类(FDC)方案以选择最具代表性的数据,并采用先导传输时间最小化(PTTM)减少先导开销。随后,构建联合客户端选择与功率控制(JCSPC)框架,在通信资源约束下最大化点云导向目标函数。尽管问题非凸,仍提出基于惩罚交替主化最小化(PAMM)的低复杂度高效求解算法。实验表明,所提方案在真实数据集上显著优于现有基准。点云导向目标函数可在极低采样率(如10%)下准确预测,且方法在视图贡献与通信成本间取得优异权衡。
原文摘要 · Abstract (English)
Edge Gaussian splatting (EGS), which aggregates data from distributed clients (e.g., drones) and trains a global GS model at the edge (e.g., ground server), is an emerging paradigm for scene reconstruction in low-altitude economy. Unlike traditional edge resource management methods that emphasize communication throughput or general-purpose learning performance, EGS explicitly aims to maximize the GS qualities, rendering existing approaches inapplicable. To address this problem, this paper formulates a novel GS-oriented objective function that distinguishes the heterogeneous view contributions of different clients. However, evaluating this function in turn requires clients' images, leading to a causality dilemma. To this end, this paper further proposes a sample-then-transmit EGS (or STT-GS for short) strategy, which first samples a subset of images as pilot data from each client for loss prediction. Based on the first-stage evaluation, communication resources are then prioritized towards more valuable clients. To achieve efficient sampling, a feature-domain clustering (FDC) scheme is proposed to select the most representative data and pilot transmission time minimization (PTTM) is adopted to reduce the pilot overhead. Subsequently, we develop a joint client selection and power control (JCSPC) framework to maximize the GS-oriented function under communication resource constraints. Despite the nonconvexity of the problem, we propose a low-complexity efficient solution based on the penalty alternating majorization minimization (PAMM) algorithm. Experiments reveal that the proposed scheme significantly outperforms existing benchmarks on real-world datasets. The GS-oriented objective can be accurately predicted with low sampling ratios (e.g., 10%), and our method achieves an excellent tradeoff between view contributions and communication costs.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。