Direct Topology Tracking in Continuous Implicit Models

• URL: http://arxiv.org/abs/2609.12157v1
• Date: Thu, 10 Sep 2026 19:44:02 GMT
• Title: Direct Topology Tracking in Continuous Implicit Models
• Abstract summary: We present a framework for tracking features directly within continuous implicit models.<n>Given a continuous implicit model, our method tracks the evolution of critical points by querying the model and its derivatives.<n>This approach enables faithful feature tracking while avoiding discretization-induced artifacts such as aliasing.
• Score: 10.197589315891689
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a framework for tracking topological features directly within continuous implicit models. Such models, including implicit neural representations (INRs) and multivariate functional approximations (MFAs), are increasingly adopted to represent scientific data without the resolution constraints of discrete grids. They offer compact, smooth, and differentiable representations of complex fields, enabling new opportunities for high-performance data storage, reconstruction, and analysis. Given a continuous implicit model, our method tracks the evolution of critical points by querying the model and its derivatives, thereby eliminating the need to resample onto a grid. This approach enables faithful feature tracking while avoiding discretization-induced artifacts such as aliasing. We demonstrate the generality of our framework across a range of implicit representations, including analytic functions, MFAs, and INRs, and show that it produces smooth, coherent critical point trajectories. By enabling feature tracking directly on continuous representations, our method supports a new class of feature-driven visualization workflows centered on implicit models.

Related papers

• A Unified Framework for Structured Flow Modeling: From Continuous Fields to Data-Driven Representations [0.0]
  dynamical systems can be described in terms of structured flows combining source/sink behavior, cyclic dynamics, and topology-constrained transport.<n>This work provides a unified perspective on such systems by connecting continuous formulations based on the Helmholtz-Hodge decomposition with discrete and data-driven representations.
  arXiv  Detail & Related papers  (2026-05-18T11:52:09Z)
• GRIFDIR: Graph Resolution-Invariant FEM Diffusion Models in Function Spaces over Irregular Domains [56.121725064621295]
  Score-based diffusion models in function spaces offer a principled framework for modelling function-valued data.<n>However, practical implementations have struggled to fully realise these benefits.<n>We propose a novel architecture that represents generalised convolutional kernels as finite graph kernels.
  arXiv  Detail & Related papers  (2026-05-05T08:33:52Z)
• Extracting Complex Topology from Multivariate Functional Approximation: Contours, Jacobi Sets, and Ridge-Valley Graphs [4.426174973462758]
  Implicit continuous models offer new perspectives on the storage, transfer, and analysis of scientific data.<n>We introduce the first framework to directly extract complex topological features from a type of continuous implicit model.<n>Our work is easily generalizable to any continuous implicit model that supports the queries of function values and high-order derivatives.
  arXiv  Detail & Related papers  (2025-08-11T05:41:24Z)
• Navigating the Latent Space Dynamics of Neural Models [45.503229142378814]
  We present an alternative interpretation of neural models as dynamical systems acting on the latent manifold.<n>We show that autoencoder models implicitly define a latent vector field on the manifold, derived by iteratively applying the encoding-decoding map.<n>We propose to leverage the vector field as a representation for the network, providing a novel tool to analyze the properties of the model and the data.
  arXiv  Detail & Related papers  (2025-05-28T18:57:41Z)
• Continuous Representation Methods, Theories, and Applications: An Overview and Perspectives [55.22101595974193]
  Recently, continuous representation methods emerge as novel paradigms that characterize the intrinsic structures of real-world data.<n>This review focuses on three aspects: (i) Continuous representation method designs such as basis function representation, statistical modeling, tensor function decomposition, and implicit neural representation; (ii) Theoretical foundations of continuous representations such as approximation error analysis, convergence property, and implicit regularization; and (iii) Real-world applications of continuous representations derived from computer vision, graphics, bioinformatics, and remote sensing.
  arXiv  Detail & Related papers  (2025-05-21T07:50:19Z)
• Transfer Learning for High-dimensional Reduced Rank Time Series Models [0.0]
  We focus on transfer learning for sequences of observations with temporal dependencies and a more intricate model parameter structure.<n>We propose a new transfer learning algorithm tailored for estimating high-dimensional VAR models characterized by low-rank and sparse structures.
  arXiv  Detail & Related papers  (2025-04-22T08:15:59Z)
• Sparse Graphical Linear Dynamical Systems [1.6635799895254402]
  Time-series datasets are central in machine learning with applications in numerous fields of science and engineering. This work proposes a novel approach to bridge the gap by introducing a joint graphical modeling framework. We present DGLASSO, a new inference method within this framework that implements an efficient block alternating majorization-minimization algorithm.
  arXiv  Detail & Related papers  (2023-07-06T14:10:02Z)
• VTAE: Variational Transformer Autoencoder with Manifolds Learning [144.0546653941249]
  Deep generative models have demonstrated successful applications in learning non-linear data distributions through a number of latent variables. The nonlinearity of the generator implies that the latent space shows an unsatisfactory projection of the data space, which results in poor representation learning. We show that geodesics and accurate computation can substantially improve the performance of deep generative models.
  arXiv  Detail & Related papers  (2023-04-03T13:13:19Z)
• Functional Mixtures-of-Experts [0.24578723416255746]
  We consider the statistical analysis of heterogeneous data for prediction in situations where the observations include functions. We first present a new family of ME models, named functional ME (FME) in which the predictors are potentially noisy observations. We develop dedicated expectation--maximization algorithms for Lasso-like (EM-Lasso) regularized maximum-likelihood parameter estimation strategies to fit the models.
  arXiv  Detail & Related papers  (2022-02-04T17:32:28Z)
• Closed-form Continuous-Depth Models [99.40335716948101]
  Continuous-depth neural models rely on advanced numerical differential equation solvers. We present a new family of models, termed Closed-form Continuous-depth (CfC) networks, that are simple to describe and at least one order of magnitude faster.
  arXiv  Detail & Related papers  (2021-06-25T22:08:51Z)
• Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modeling [54.94763543386523]
  Current autoencoder-based disentangled representation learning methods achieve disentanglement by penalizing the ( aggregate) posterior to encourage statistical independence of the latent factors. We present a novel multi-stage modeling approach where the disentangled factors are first learned using a penalty-based disentangled representation learning method. Then, the low-quality reconstruction is improved with another deep generative model that is trained to model the missing correlated latent variables.
  arXiv  Detail & Related papers  (2020-10-25T18:51:15Z)
• Closed-Form Factorization of Latent Semantics in GANs [65.42778970898534]
  A rich set of interpretable dimensions has been shown to emerge in the latent space of the Generative Adversarial Networks (GANs) trained for synthesizing images. In this work, we examine the internal representation learned by GANs to reveal the underlying variation factors in an unsupervised manner. We propose a closed-form factorization algorithm for latent semantic discovery by directly decomposing the pre-trained weights.
  arXiv  Detail & Related papers  (2020-07-13T18:05:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.