SearcharxivSearch

arXiv subjects

Yusuke Imoto

Publications and source records attributed to Yusuke Imoto.

7 recordsLinked to original sources

Multi-parameter persistence in dynamical systems for maximizing effects of control inputs

We introduce a new topological method to naturally extend a partial function $h \colon X \rightharpoonup [-\infty, \infty]$ on a ``generalization'' of a metric space $X$ equipped with a dynamical system $f \colon X \rightharpoonup X$, to a function $h_f^{\varepsilon\text{-}\ell^p} \colon X \to [-\infty,\infty]$ with parameters $\varepsilon,p$, which allows us to apply existing topological data analysis techniques to functions defined on the whole space. Moreover, given a function $h$ that evaluates the ``quality'' of points within $\mathop{\mathrm{dom}}h$, using this extended function, one can construct a sufficient condition for the existence of an optimal $\varepsilon$-perturbation path from any point into $\mathop{\mathrm{dom}}h$ that minimizes the value of $h$ under the condition $X = \mathop{\mathrm{dom}} f \sqcup \mathop{\mathrm{dom}}h = \bigsqcup_{n = 0}^\infty f^{-n}(\mathop{\mathrm{dom}}h)$. In addition, if the domain $X$ is finite, then the function $h_f^{\varepsilon\text{-}\ell^p} \colon X \to [-\infty,\infty]$ can be computed recursively. As an application, for a given partial evaluation function on a space equipped with a dynamical system, one can construct a three-parameter filtration associated with its extension, which naturally identifies minimal paths. This clarifies the relationship among three factors: the evaluation of the cost norm, the strength of control, and the resulting value.

math.DS

Ninja Codes: Neurally Generated Fiducial Markers for Stealthy 6-DoF Tracking

In this paper we describe Ninja Codes, neurally generated fiducial markers that can be made to naturally blend into various real-world environments. An encoder network converts arbitrary images into Ninja Codes by applying visually modest alterations; the resulting codes, printed and pasted onto surfaces, can provide stealthy 6-DoF location tracking for a wide range of applications including robotics and augmented reality. Ninja Codes can be printed using standard color printers on regular printing paper, and can be detected using any device equipped with a modern RGB camera and capable of running inference. Through experiments, we demonstrate Ninja Codes' ability to provide reliable location tracking under common indoor lighting conditions, while successfully concealing themselves within diverse environmental textures. We expect Ninja Codes to offer particular value in scenarios where the conspicuous appearance of conventional fiducial markers makes them undesirable for aesthetic and other reasons.

cs.CV

Filtrations Indexed by Attracting Levels and their Applications

We introduce a new class of filtrations indexed by attracting levels in dynamical systems, providing novel inputs for persistent homology and related methods in topological data analysis. These filtrations quantify, in a forward direction, the sensitivity of trajectories with respect to attractors under perturbations and, in a backward direction, the perturbation magnitude at which attraction breaks down. The construction applies not only to maps on metric spaces but also to general partial maps with cost functions, yielding a filtration-theoretic framework with connections to algebraic topology. This generality ensures complementary filtrations when terminal states are good or bad, inducing natural decompositions of the underlying space. As an illustration, we apply the framework to ensemble forecasts of tropical cyclones, where the filtrations identify regions of heightened sensitivity, demonstrating the potential of our approach as a new tool for topological data analysis applied to dynamical systems.

math.DS

Numerical Computation of High Reynolds Number Cavity Flow Using SPH Method with Stream Function and Vorticity Formulation

When numerically computing high Reynolds number cavity flow, it is known that by formulating the Navier-Stokes equations using the stream function and vorticity as unknown functions, it is possible to reproduce finer flow structures. Although numerical computations applying methods such as the finite difference method are well known, to the best of our knowledge, there are no examples of applying particle-based methods like the SPH method to this problem. Therefore, we applied the SPH method to the Navier-Stokes equations, formulated with the stream function and vorticity as unknown functions, and conducted numerical computations of high Reynolds number cavity flow. The results confirmed the reproduction of small vortices and demonstrated the effectiveness of the scheme using the stream function and vorticity.

math.NA

Curse of Dimensionality on Persistence Diagrams

The stability of persistent homology has led to wide applications of the persistence diagram as a trusted topological descriptor in the presence of noise. However, with the increasing demand for high-dimension and low-sample-size data processing in modern science, it is questionable whether persistence diagrams retain their reliability in the presence of high-dimensional noise. This work aims to study the reliability of persistence diagrams in the high-dimension low-sample-size data setting. By analyzing the asymptotic behavior of persistence diagrams for high-dimensional random data, we show that persistence diagrams are no longer reliable descriptors of low-sample-size data under high-dimensional noise perturbations. We refer to this loss of reliability of persistence diagrams in such data settings as the curse of dimensionality on persistence diagrams. Next, we investigate the possibility of using normalized principal component analysis as a method for reducing the dimensionality of the high-dimensional observed data to resolve the curse of dimensionality. We show that this method can mitigate the curse of dimensionality on persistence diagrams. Our results shed some new light on the challenges of processing high-dimension low-sample-size data by persistence diagrams and provide a starting point for future research in this area.

math.ST

Topological Node2vec: Enhanced Graph Embedding via Persistent Homology

Node2vec is a graph embedding method that learns a vector representation for each node of a weighted graph while seeking to preserve relative proximity and global structure. Numerical experiments suggest Node2vec struggles to recreate the topology of the input graph. To resolve this we introduce a topological loss term to be added to the training loss of Node2vec which tries to align the persistence diagram (PD) of the resulting embedding as closely as possible to that of the input graph. Following results in computational optimal transport, we carefully adapt entropic regularization to PD metrics, allowing us to measure the discrepancy between PDs in a differentiable way. Our modified loss function can then be minimized through gradient descent to reconstruct both the geometry and the topology of the input graph. We showcase the benefits of this approach using demonstrative synthetic examples.

stat.ML

Truncation error estimates of approximate operators in a generalized particle method

To facilitate the numerical analysis of particle methods, we derive truncation error estimates for the approximate operators in a generalized particle method. Here, a generalized particle method is defined as a meshfree numerical method that typically includes other conventional particle methods, such as smoothed particle hydrodynamics or moving particle semi-implicit methods. A new regularity of discrete parameters is proposed via two new indicators based on the Voronoi decomposition of the domain along with two hypotheses of reference weight functions. Then, truncation error estimates are derived for an interpolant, approximate gradient operator, and approximate Laplace operator in the generalized particle method. The convergence rates for these estimates are determined based on the frequency with which they appear in the regularity and hypotheses. Finally, the estimates are computed numerically and the results are shown to be in good agreement with the theoretical results.

math.NA