SearcharxivSearch

arXiv subjects

Jochen Kall

Publications and source records attributed to Jochen Kall.

5 recordsLinked to original sources

Compact Feed-Forward 3D Gaussians via Saliency-Guided Primitive Merging

3D scene reconstruction, modeling, and rendering are highly relevant for numerous tasks, and 3D Gaussian splatting has become a standard choice in this context. Its feed-forward variants provide fast reconstruction from sparse input views but often produce per-pixel primitives, leading to highly redundant and thus inefficient representations. We present a structure-aware merging pipeline that takes per-pixel primitives from any feed-forward method and consolidates them into a compact, content-adaptive Gaussian set while largely retaining visual quality at just $\frac{1}{20}^\text{th}$ of the Gaussians of a per-pixel method. We group spatially coherent Gaussians of similar appearance into variable-size clusters via adaptive superpixel segmentation guided by a saliency map, which allocates fine segments to textured regions and coarse segments to homogeneous areas. We compress each cluster into a compact latent representation through a learned encoder, then match and consolidate representations across views based on geometric overlap and feature similarity via a learned merger. A level-of-detail decoder then produces the final Gaussians at a controllable resolution, enabling a flexible quality-efficiency trade-off at inference. As a post-processing module, the pipeline is backbone-agnostic, leveraging the strengths of existing feed-forward methods. This leads to better and more robust quality than achieved by previous approaches that target a reduction in primitive count, while providing a highly compact representation, that can be rendered efficiently.

cs.CV

TASE: Truncation-Aware Semantic Embeddings for 3D Scene Understanding and Editing

High-fidelity semantic 3D scene representations are crucial for numerous applications, including robotics, autonomous driving, and simulation. Beyond this, the ability to edit such representations enables developers to adapt these applications more easily to specific target scenarios. Current approaches provide limited support for controllable editing. We introduce TASE, a method that projects pretrained 2D semantic features into a truncation-aware embedding space to enable flexible 3D scene editing. Our method explicitly optimizes a feature space in which progressively reducing feature channels yields increasingly abstract semantic representations, while retaining more channels preserves fine-grained detail. Additionally, we improve multi-view consistency of the features using a scale- and translation-equivariance loss. The resulting truncation-aware embedding space enables text-driven edits to 3D scenes, providing explicit control over how strongly edits adhere to the original scene content and allowing more substantial modifications than prior methods. Moreover, we propose a finetuning stage for the editing diffusion model to mitigate artifacts caused by geometric changes. Experimental results demonstrate competitive performance in 3D scene editing, substantially outperforming prior methods on edits involving large geometric modifications.

cs.CV

First-order quarter- and mixed-moment realizability theory and Kershaw closures for a Fokker-Planck equation in two space dimensions

Mixed-moment models, introduced before for one space dimension, are a modification of the method of moments applied to a (linear) kinetic equation, by choosing mixtures of different partial moments. They are well-suited to handle such equations where collisions of particles are modelled with a Laplace-Beltrami operator. We generalize the concept of mixed moments to two dimension. The resulting hyperbolic system of equations has desirable properties, removing some drawbacks of the well-known $\MN[1]$ model. We furthermore provide a realizability theory for a first-order system of mixed moments by linking it to the corresponding quarter-moment theory. Additionally, we derive a type of Kershaw closures for mixed- and quarter-moment models, giving an efficient closure (compared to minimum-entropy models). The derived closures are investigated for different benchmark problems.

math.AP

High order numerical methods for networks of hyperbolic conservation laws coupled with ODEs and lumped parameter models

In this paper we construct high order finite volume schemes on networks of hyperbolic conservation laws with coupling conditions involving ODEs. We consider two generalized Riemann solvers at the junction, one of Toro-Castro type and a solver of Harten, Enquist, Osher, Chakravarthy type. The ODE is treated with a Taylor method or an explicit Runge-Kutta scheme, respectively. Both resulting high order methods conserve quantities exactly if the conservation is part of the coupling conditions. Furthermore we present a technique to incorporate lumped parameter models, which arise from simplifying parts of a network. The high order convergence and the robust capturing of shocks is investigated numerically in several test cases.

math.NA

A realizability-preserving high-order kinetic scheme using WENO reconstruction for entropy-based moment closures of linear kinetic equations in slab geometry

We develop a high-order kinetic scheme for entropy-based moment models of a one-dimensional linear kinetic equation in slab geometry. High-order spatial reconstructions are achieved using the weighted essentially non-oscillatory (WENO) method, and for time integration we use multi-step Runge-Kutta methods which are strong stability preserving and whose stages and steps can be written as convex combinations of forward Euler steps. We show that the moment vectors stay in the realizable set using these time integrators along with a maximum principle-based kinetic-level limiter, which simultaneously dampens spurious oscillations in the numerical solutions. We present numerical results both on a manufactured solution, where we perform convergence tests showing our scheme converges of the expected order up to the numerical noise from the numerical optimization, as well as on two standard benchmark problems, where we show some of the advantages of high-order solutions and the role of the key parameter in the limiter.

math.NA