Augmenting the surface of 3D objects with capacitive sensing is particularly challenging when their volumes cannot be modified. In this paper, we present a computational fabrication pipeline that retrofits surface-only sensor layouts to 3D geometries for multi-touch interaction. Our system scans real-world objects to obtain their 3D mesh, generates and optimizes a 3D sensor design of drive and sense lines for mutual-capacitance sensing that complies with physical and hardware sensing constraints, and unfolds them into individual 2D stencils that can be cut from conductive material. Our fabrication pipeline cuts these from thin copper foil with a vinyl cutter and then assists manual sensor attachment by projecting the sensor design onto the dynamically registered real-world object. We connect the resulting electrode mesh to a mutual-capacitance scanning controller and resolve touch interaction in real time. We demonstrate our approach with four 3D geometries and evaluate our method and fabrication pipeline on them.
论文检索
输入标题、作者或关键词，从 4,294 篇学术成果中精准定位
Motion warping is a core technique in character animation that enables the adaptation of existing motion data to novel spatio-temporal constraints. Conventional motion warping methods often rely on heuristic modifications that can violate physical consistency or introduce visual artifacts. More recent learning-based editing approaches improve realism, but many of them encode motion into tightly entangled latent space, which makes them struggle to balance editing flexibility and content preservation. To address this, we propose a novel deep motion warping framework that explicitly disentangles the motion structure from global and stylistic attributes for intuitive motion editing. Our key insight is to leverage learned phase features as a continuous and robust representation of the underlying structure, and explicitly disentangle motion into root velocity, phase, and learned latent variables using a phase-conditioned diffusion autoencoder. This design supports a wide range of editing operations, including root motion warping, motion exaggeration, time warping, and style transfer by directly manipulating decoupled components, without requiring paired training data. Extensive experiments demonstrate that our approach enables high-level, flexible motion editing while strictly preserving the structural consistency and physical plausibility of the source motion
Developing controllers capable of completing a wide range of tasks in a natural and life-like manner is a key challenge in enabling practical applications of physics-based character animation. In this work, we introduce Generative Pretrained Controllers (GPC), which leverage tokenization and next-token modeling to create general-purpose, reusable generative controllers from large-scale motion datasets. Our framework utilizes end-to-end reinforcement learning to jointly optimize a "motion vocabulary", modeled via Finite Scalar Quantization (FSQ), along with a corresponding control policy that can map the discrete codes to physics-based controls. After the "codebook" has been learned, the underlying structure of this large vocabulary is modeled by training a GPT-style autoregressive transformer, leading to a powerful generative controller that generates controls for a physically simulated character by performing next-token prediction. Once the generative controller has been trained, we propose a suite of adaptation techniques for finetuning the controller for new downstream tasks. Our proposed framework greatly simplifies the training process compared to previous tokenized methods, and achieves a 99.98% success rate in reproducing a vast corpus of motion clips. The generative controller exhibits a variety of natural emergent behaviors, such as responsive behaviors to perturbations and recovery behaviors after falling. This results in highly robust general purpose controllers for a variety of downstream applications.
Traditional physically-based material models rely on analytically derived bidirectional reflectance distribution functions (BRDFs), typically by considering statistics of micro-primitives such as facets, flakes, or spheres, sometimes combined with multi-bounce interactions such as layering and multiple scattering. These derivations are often complex and model-specific. Once an analytic BRDF evaluation is defined, one still needs to design an importance sampling method for it and evaluate the probability density function (pdf) of that sampling distribution, requiring further model-specific derivations. We present PureSample: a novel neural BRDF representation that allows learning a material’s appearance purely by sampling forward random walks on the microgeometry, which is usually straightforward to implement. Our representation allows for efficient BRDF evaluation, importance sampling, and pdf evaluation, for homogeneous as well as spatially varying materials. We achieve this by two learnable components: first, the sampling distribution is modeled using a flow matching neural network, which allows both importance sampling and pdf evaluation; second, we introduce a view-dependent albedo term, captured by a lightweight neural network, which allows for converting a pdf value to a BRDF value for any pair of view and light directions. We demonstrate PureSample on challenging materials, including various microgeometries, multi-layered materials, and multiple-scattering microfacet materials.
Volumetric video (VV) streaming delivers truly immersive viewing experiences over the Internet, serving as a critical foundation for next-generation applications, including immersive telepresence in the metaverse, the surveillance of remote ecological systems, and robotic teleoperation for embodied AI, and beyond. Beyond immersive viewing, these applications turn VV streaming into a real-time interface to remote physical environments, imposing new system-level demands for photorealistic scene representation, low-latency interaction, and robust performance under heterogeneous network conditions. 3D Gaussian Splatting (3DGS) has been widely used for real-time photorealistic rendering, offering superior visual quality and rendering performance, but it faces challenges due to bandwidth consumption. Furthermore, as the foundation of adaptive VV streaming, existing Levels of Detail (LoD) methods based on density are not well-suited to Gaussian representations, leading to visible gaps and severe quality degradation. Recent studies have also explored attribute compression techniques to reduce bandwidth consumption. Our preliminary studies reveal that aggressive attribute compression primarily causes color distortion, which can be effectively corrected in the rendered image using a reference image. Motivated by these findings, we propose a novel Color-Adaptive scheme for adaptive VV streaming that uses vector quantization (VQ) to establish LoDs and correct color distortions with low-resolution reference images. We further present CAGS, an adaptive VV streaming system compatible with diverse Gaussian representations, which integrates the Color-Adaptive scheme by rendering reference images on the streaming server and performing color restoration on the client. Extensive experiments on our prototype system demonstrate that CAGS outperforms the existing adaptive streaming systems in PSNR by 5 ∼ 20 dB under fluctuating bandwidth, operates significantly faster than existing scalable Gaussian compression methods, and generalizes across different Gaussian representations. The code is available at https://github.com/yindaheng98/ColorAdaptiveGaussianSplatting.
Generative models for material creation are fundamentally limited by the quality and expressivity of available training data. Simple physically based rendering (PBR) materials, which combine a diffuse term with a single-lobe specular component, are commonly used for training but are insufficient to capture many important visual effects present in real materials. We present a method that enhances such simple PBR materials to more expressive ones, by augmenting the single GGX specular lobe into a layered model that captures a broader range of non-diffuse effects. Starting from a simple material, we procedurally construct a corresponding multi-lobe non-diffuse component guided by physical priors, enabling effects such as dust, clearcoat, and layered scattering. To provide a compact representation for downstream applications, we encode this non-diffuse component as a neural material with a shared 6D latent space, where each material instance is represented by two latent textures and decoded by a pretrained universal MLP. We further regularize the latent space to support material generation. The resulting neural material dataset enables training generative models for richer material creation. To demonstrate this application, we finetune a video diffusion model to produce neural latent textures that encode our multi-lobe material, and present generative results as proof of feasibility. Our procedural data enhancement approach is an important step toward improving expressivity in material generation.
Reconstructing dynamic fluids from sparse-view videos is a severely under-constrained problem due to complex volumetric visibility and turbulent, topology-changing motion. Current dynamic deformation-based 3D Gaussian Splatting (3DGS) methods use heuristic image-space warps, which often overfit limited observations via non-physical primitive scaling or drifting, producing floaters and geometric distortions. To address these challenges, we propose a hybrid, physics-aware fluid representation that injects physical constraints directly into the 3DGS pipeline. We develop a Beer–Lambert volumetric model mapping Gaussian primitives to a continuous, physically-grounded density field, bridging optical observations with fundamental physical laws. A physically-guided optimization evolves primitives under a global, volume-preserving velocity field, avoiding arbitrary per-particle deformations and effectively preserving volume while recovering fine-scale turbulent details. This unified formulation tightly couples fluid dynamics with differentiable rendering, enabling high-quality, joint predictions of velocity and density. Experiments on synthetic and real smoke datasets demonstrate that our approach surpasses state-of-the-art methods in both visual fidelity and physical consistency, achieving stable 3D reconstructions even from sparse views.
Monocular video–based human mesh recovery (HMR) has made significant progress in recent years, yet existing methods often fail to reconstruct physically plausible motion during highly dynamic airborne movements such as jumping or acrobatics. These failure cases arise from motion blur, rapid orientation changes, and the lack of suitable training data, leading to temporally inconsistent and physically implausible results. We propose a novel method for reconstructing 3D airborne motion by refining inaccurate estimates produced by state-of-the-art HMR systems. Our approach extracts key physical quantities, identifies reliable motion segments based on physical consistency, and connects them using a homotopy-aware trajectory optimization. A global angular momentum constraint is then enforced over the entire motion, and global motion and local poses are jointly optimized under physical and temporal smoothness constraints. Experiments on challenging in-the-wild videos demonstrate that our method produces more physically consistent and temporally coherent airborne motions than existing refinement approaches.
Voronoi diagrams, and their more general weighted counterpart, power diagrams, are fundamental geometric constructs with wide-ranging applications in biology, physics simulation, and computer graphics. Recently, they have gained renewed attention in mesh-based neural rendering. Despite being extensively studied, the construction of 3D Voronoi diagrams for large-scale point sets remains computationally expensive, limiting their adoption in large-scale applications. Existing CPU-based approaches typically rely on computing its dual, the Delaunay tetrahedralization, but are prohibitively slow for large diagrams, while GPU-based methods either struggle to scale efficiently to large point sets or assume homogeneous point distributions. The weighted case, power diagrams, is even less explored in this context. Existing approaches are typically tailored to the application at hand, assuming homogeneous point distributions and small weight variations, making them unsuitable for general use in more complex heterogeneous data. In this paper, we present a highly parallelizable GPU algorithm for the fast construction of large-scale 3D Voronoi and power diagrams. Our approach constructs each convex cell from a weighted 3D point by progressively clipping an initial cell volume against bisecting planes induced by candidate neighboring points. To efficiently identify candidate neighbors under arbitrary spatial distributions, we introduce a culling criterion based on directional geometric bounds of the evolving cell, combined with a hierarchical best-first traversal of bounding volumes. We achieve performance on par with state-of-the-art Delaunay tetrahedralization methods on small and moderate problem sizes, while exhibiting robust scalability to large point sets and diverse spatial distributions. Moreover, our method naturally generalizes to power diagrams without additional assumptions. To facilitate reproducibility and future research, we release our source code, see https://research.zenseact.com/publications/paragram.
Eigenanalysis of partial differential operators is essential in reduced-order modeling for physical simulation, providing eigenmode representations in elasticity, acoustics, and transient heat transport. While recent neural, mesh-free, and geometry-agnostic approaches enable differentiable eigenanalysis over continuously parameterized shape spaces, boundary conditions of eigenfunctions are limited to Neumann-type (natural) conditions, hindering their applicability in scenarios where boundary conditions must be precisely controlled or optimized. In this work, we focus on Laplace-type operators and extend shape space neural eigenanalysis to handle boundary conditions beyond natural Neumann settings. Building on the same variational, energy-based formulation, we show that Dirichlet, Robin, and mixed boundary conditions can be incorporated without altering the underlying eigenvalue optimization principle. In our formulation, boundary configurations—including boundary placement and Robin coefficients modeling boundary exchange processes—are treated as first-class parameters rather than fixed constraints. When combined with shape-parameterized domains, this leads to a joint shape–boundary space formulation, allowing eigenfunctions and spectra to be evaluated consistently across variations in both geometry and boundary configuration. We conduct experiments on representative applications such as boundary-driven spectral optimization for rigid-walled cavity resonance tuning, reduced-order simulation with changing supports, and analysis of transient thermal behavior under varying boundary exchange conditions. By elevating boundary conditions from fixed constraints to operator-wise parameterization, our approach broadens the applicability of Laplace-type neural eigenanalysis to physical systems where boundary constraints serve as critical design and control variables.
Online Travel Platforms (OTPs) suffer significant revenue loss from supply strikes, where rooms with physical vacancies appear sold out due to delays in manual inventory updates from hotels. While proactively adding inventory is a potential solution, this intervention faces a dual risk: hotels may later reject the booking, and more critically, the intervention might not generate platform-wide revenue, but merely shift sales from a competing hotel. This paper is the first to formalize the inventory decision on OTPs as a causal inference problem. We propose CS2NET, a Causality-Driven, Scarcity- and Service-Aware Network that estimates the platform-wide Individual Treatment Effect of each inventory addition. CS2NET addresses the unique challenges of the OTP environment by integrating: (1) a Room Type Scarcity Representation module for inferring true room availability, (2) a Hotel Service-Engagement Representation module for predicting hotel acceptance, and (3) a bias-corrected causal framework to estimate platform-level uplift while mitigating selection bias. Extensive experiments and an online A/B test on a major OTP, demonstrate that CS2NET significantly increases confirmed bookings and platform revenue, generating over 10 million RMB in additional annual GMV. We also release the first causality dataset for third-party inventory management.
Graph-based collaborative filtering has advanced by modeling higher-order interactions, yet performance remains constrained by underlying geometric assumptions and propagation schemes. User-item interaction graphs typically exhibit pronounced topological heterogeneity, whereas existing methods rely on a fixed, homogeneous geometry and employ tangent space aggregation. To address these fundamental limitations, this paper introduces Adaptive Geometric Collaborative Filtering (AGCF), a novel method rooted in Hamiltonian dynamics, which reframes representation learning as a physical process evolving on a time-varying manifold. AGCF is distinguished by an integrated design comprising: (1) a learnable, node-dependent Riemannian metric that construct a continuous heterogeneous manifold aligned with local topology; (2) unified dynamic trajectories that achieve intrinsic propagation without tangent space approximations; (3) a channel-wise metric that captures semantic anisotropy in the feature space. We rigorously prove global existence and uniqueness of the induced dynamics and explain the mechanism enabling long-range information propagation. Extensive experiments on five benchmark datasets show consistent gains over representative baselines.
Opinion propagation research primarily focuses on phenomenon prediction rather than mechanism understanding, lacking interpretable frameworks to reveal underlying propagation dynamics. This limitation stems from two sources: existing methods employ end-to-end paradigms where parameters lack physical meanings, while available datasets suffer from incomplete hierarchical structures, coarse sentiment annotations, and limited domain coverage. To address these limitations, we introduce VISTA, a multi-dimensional opinion propagation dataset providing complete hierarchical structures, fine-grained emotional annotations, and cross-domain coverage. Based on this dataset, we propose an interpretable modeling framework integrating high-dimensional Hawkes processes with graph neural networks, enabling parametric expression of propagation mechanisms through event space constructed from emotional and reply level combinations. Through interpretable parameter analysis, we reveal three mechanistic patterns: differential emotional propagation strength, asymmetric hierarchical excitation, and temporal memory effects. Our framework establishes quantitative foundations for understanding opinion propagation dynamics, achieving best performance in sentiment prediction and structural consistency tasks while providing the first benchmark for multi-dimensional propagation mechanism analysis.
In the literature, prior research on Security-oriented Video Understanding (SVU) has predominantly focused on detecting and locating the threats (e.g., shootings, robberies) in videos, while largely lacking the effective capability to generate and evaluate the threat causes. Motivated by these gaps, this paper introduces a new chat paradigm SVU task, i.e., In-depth Security-oriented Video Understanding (DeepSVU), which aims to not only identify and locate the threats but also attribute and evaluate the causes of threatening segments in detail. Furthermore, this paper reveals two key challenges in the proposed task: 1) how to effectively model the coarse-to-fine physical-world information (e.g., human behavior, object interactions and background context) to boost the DeepSVU task, and 2) how to adaptively trade off these factors. Addressing these challenges is crucial for improving VAD, especially for identifying, locating, and attributing anomalies. To tackle these challenges, this paper proposes a new Unified Physical-world Regularized MoE (UPRM) approach. Specifically, UPRM incorporates two key components: the Unified Physical-world Enhanced MoE (UPE) Block and the Physical-world Trade-off Regularizer (PTR), to address the above two challenges, respectively. Extensive experiments conduct on our DeepSVU instructions datasets (i.e., UCF-C instructions and CUVA instructions) demonstrate that UPRM outperforms several advanced Video-LLMs as well as non-LLM approaches. such information.These justify the importance of the coarse-to-fine physical-world information in the DeepSVU task and demonstrate the effectiveness of our UPRM in capturing such information.
Oscillatory Graph Neural Networks (OGNNs) are an emerging class of physics-inspired architectures designed to mitigate oversmoothing and vanishing gradient problems in deep GNNs. In this work, we introduce the Complex-Valued Stuart-Landau Graph Neural Network (SLGNN), a novel architecture grounded in Stuart-Landau oscillator dynamics. Stuart-Landau oscillators are canonical models of limit-cycle behavior near Hopf bifurcations, which are fundamental to synchronization theory and are widely used in e.g.\ neuroscience for mesoscopic brain modeling. Unlike harmonic oscillators and phase-only Kuramoto models, Stuart-Landau oscillators retain both amplitude and phase dynamics, enabling rich phenomena such as amplitude regulation and multistable synchronization. The proposed SLGNN generalizes existing phase-centric Kuramoto-based OGNNs by allowing node feature amplitudes to evolve dynamically according to Stuart-Landau dynamics, with explicit tunable hyperparameters (such as the Hopf-parameter and the coupling strength) providing additional control over the interplay between feature amplitudes and network structure. We conduct extensive experiments across node classification, graph classification, and graph regression tasks, demonstrating that SLGNN outperforms existing OGNNs and establishes a novel, expressive, and theoretically grounded framework for deep oscillatory architectures on graphs. The code and hyperparameters for SLGNN are available at https://github.com/kevvzhang/StuartLandauGNN
Intelligent agents operating in biomedical laboratories need physics-aware understanding beyond simple geometry or semantics. In-the-wild web images capture authentic lab interactions, yet methods designed for instrumented 3D capture and reconstruction struggle to turn this resource into functional knowledge. Consequently, current autonomous laboratory systems lack a queryable representation of affordances for precise object and liquid handling tasks. We pose a web-native question: how to convert single-view, uncalibrated web images into a structured, physics-aware scene representation. We introduce WPIS (Web- and Physics-Informed Scene-understanding), a pipeline that compiles Physics-aware 3D Scene Graphs (P-3DSGs) from web imagery by fusing open-vocabulary instance/mask cues with relative geometry, augmenting nodes with real-valued liquid states and fine-grained hand–object interaction (HOI) subgraphs, and attaching concise natural-language functional relations—without intrinsics, multi-view, or CAD priors. We release WebLab-3DSG, a 1,000-scene knowledge base pairing each RGB image with its P-3DSG JSON, relative depth, and a single-image point-cloud proxy. In an expert study, grounding an LLM in a P-3DSG improves answer quality by 40% over a strong VLM that reasons directly from RGB, with the largest gains on feasibility, HOI alignment, and safety constraints. WPIS offers a reproducible path to physics-aware reasoning from in-the-wild web imagery and a practical substrate for decision-making in autonomous lab settings.
Social event detection (SED) enhances public awareness by clustering large-scale social messages and has been widely applied across diverse domains. While many existing frameworks adopt Graph Convolution Networks (GCN) as backbones and extend them with auxiliary modules to model complex message relationships, they rarely explore the deeper potential of GCN itself. Specifically, the core operation of GCN—smoothed feature aggregation—implicitly assumes that social information diffusion follows a single-pass and independent heat propagation process. However, real-world diffusion is inherently multi-wave and oscillatory, where different messages interact through reinforcement and interference, resembling the principle of wave–particle duality. To address this gap, we propose Physics-Inspired Graph Convolution Networks (PIGCN ), a novel model that unifies wave-based propagation and particle-like interactions. Specifically, PIGCN integrates a Helmholtz Graph Filter module to capture spectral wave propagation with oscillatory dynamics, and a Physical Interaction Force mechanism to adaptively adjust edge weights by attracting messages within the same event and repelling those across events. Building on PIGCN, we further incorporate a contextualized text encoder and timestamp encoding to form a comprehensive SED framework. Extensive experiments demonstrate that PIGCN effectively outperforms conventional GCN baselines and achieves superior performance across multiple SED datasets, establishing a new benchmark for balancing architectural simplicity with effectiveness. Our code can be found on GitHub . https://github.com/yuyongsheng1990/PIGCN
AI has reached a turning point. Systems can now perceive, generate, and act in language and image across digital platforms at unprecedented scale. Yet as AI moves from tools to collaborators—embedded in decision-making, institutions, and everyday life—a new requirement becomes unavoidable: AI must understand the world the way humans inhabit it. This talk introduces Cognitive World Modeling as the next phase of AI development. It unifies physical world modeling—time, space, causality, action—with mental world modeling—goals, beliefs, intentions, emotions, and social norms—into a single, persistent representation of reality as experienced by humans. Together, these models allow AI systems not only to predict outcomes, but to reason about meaning, context, and consequence. Cognitive World Modeling moves AI beyond reactive toward systems that can plan, explain, adapt, and collaborate over time. Alignment and trust emerge not as post hoc constraints, but as properties of systems that maintain accurate, evolving models of both the external world and the humans within it.