Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

3468102136 · Jun 202019922001200920172026
48 results for curve reconstruction

In this article we extend the computational geometric curve reconstruction approach to curves in Riemannian manifolds. We prove that the minimal spanning tree, given a sufficiently dense sample, correctly reconstructs the smooth arcs and further closed and simple curves in Riemannian manifolds. The proof is based on th…

2010-12-15abs ↗pdf ↗

The paper discusses algorithms for reconstructing curves with given Euclidean or affine curvatures.

problem Reconstructing planar curves with specified Euclidean or affine curvatures.
method The paper presents algorithms for curve reconstruction under the special Euclidean and equi-affine groups.
result The reconstructed curves are close to the original curves in terms of the specified curvatures.

The field of multiple view geometry has seen tremendous progress in reconstruction and calibration due to methods for extracting reliable point features and key developments in projective geometry. Point features, however, are not available in certain applications and result in unstructured point cloud reconstructions.…

2016-04-27abs ↗pdf ↗

The paper uses Tannakian reconstruction to understand hyperbolic log-orbi curves.

problem Understanding the structure of hyperbolic log-orbi curves.
method Formulates hyperbolic uniformization as a Tannakian reconstruction theorem and constructs a canonical maximal parahoric PSL2-Higgs object.
result Reconstructs the absolute Galois group of a one-variable complex function field as the inverse limit of etale fundamental groups of orbifold models.

Researchers reconstruct algebraic maps onto curves based on prescribed Reeb graphs.

problem Reconstructing smooth real algebraic maps onto curves with specific Reeb graphs.
method Developed a method to reconstruct functions from general finite graphs, focusing on curves.
result Reconstructed functions from prescribed Reeb graphs, providing a new approach in real algebraic geometry.

Reconstructing signature features from randomized vector fields in differential equations.

problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.

The paper analyzes discrete approximations to minimize curve length in Euclidean space.

problem Minimizing the length of curves between two sets in Euclidean space.
method Finite differences and numerical integration for discrete approximations.
result The squared length of the reconstructed curve converges to the squared minimal length with rate O(N1/2)O(N^{-1/2}).

Given a Morse 2-function f:X4S2f: X^4 \to S^2, we give minimal conditions on the fold curves and fibers so that X4X^4 and ff can be reconstructed from a certain combinatorial diagram attached to S2S^2. Additional remarks are made in other dimensions.

2012-02-16abs ↗pdf ↗

Proposes FunNoL for better curve classification and reconstruction in multivariate functional data.

problem Linear methods fail to capture nonlinear structures in multivariate functional data.
method Functional nonlinear learning (FunNoL) method using nonlinear mapping.
result FunNoL outperforms FPCA in curve classification and reconstruction, especially in multivariate settings.

Background elimination for noisy character images or character images from real scene is still a challenging problem, due to the bewildering backgrounds, uneven illumination, low resolution and different distortions. We propose a stroke-based character reconstruction(SCR) method that use a weighted quadratic Bezier cur…

2018-06-23abs ↗pdf ↗

The paper studies curves in surfaces using flow-spines and apparent contours.

problem Understanding curves in arbitrary surfaces using flow-spines and apparent contours.
method By considering generic curves and their apparent contours relative to a traversing flow, the paper reconstructs curves and allows them to vary up to homotopy.
result A finite set of local moves on decorated graphs allows for the reconstruction and variation of curves within a fixed generic flow.

This paper diagnoses factor-model pricing errors using a new method.

problem Measuring pricing errors in factor models with general characteristic axes.
method Developed a method to measure factor-model pricing errors as bridge-alpha curves, using a predetermined characteristic order and prefix portfolios.
result Adding a counterpart factor flips the curve's sign on every axis, but only HML and CMA overcorrect enough to be rejected.

In this work, we study the problem of reconstructing shapes from simple nonasymptotic densities measured only along shape boundaries. The particular density we study is also known as the integral area invariant and corresponds to the area of a disk centered on the boundary that is also inside the shape. It is easy to s…

2013-08-12abs ↗pdf ↗

This paper develops a new method for constructing splines on Lie groups using Poisson equation solutions.

problem Existing methods for constructing splines on Lie groups have limitations and assumptions that may not reflect actual curves.
method The paper introduces a new approach using solutions of the Poisson equation on Lie groups to construct splines.
result The new method allows for global splines with arbitrary initial conditions, improving curve reconstruction.

In this paper, we propose a novel lower dimensional representation of a shape sequence. The proposed dimension reduction is invertible and computationally more efficient in comparison to other related works. Theoretically, the differential geometry tools such as moving frame and parallel transportation are successfully…

2011-07-29abs ↗pdf ↗

In this work we describe a method to reconstruct the braid monodromy of the preimage of a curve by a Kummer cover. This method is interesting, since it combines two techniques, namely, the reconstruction of a highly non-generic braid monodromy with a systematic method to go from a non-generic to a generic braid monodro…

2012-05-24abs ↗pdf ↗

This paper extends Jacobi field theory to Jacobi curves and their curvatures.

problem Characterizing and understanding Jacobi curves and their curvatures.
method Developed a new theory of Jacobi curves and associated curvatures, derived Ricci curvature, and presented a Cartan-like theory.
result Jacobi curves are fully characterized by a family of conformal symplectic invariant curvatures.

MFSSA improves reconstruction accuracy of multivariate functional time series.

problem Improving reconstruction accuracy of multivariate functional time series.
method Developed MFSSA, a functional extension of MSSA, for different dimensional domains.
result Better reconstruction accuracy of MFTS signals using MFSSA compared to other methods.

We discuss the twistor correspondence between path geometries in three dimensions with vanishing Wilczynski invariants and anti-self-dual conformal structures of signature (2,2)(2, 2). We show how to reconstruct a system of ODEs with vanishing invariants for a given conformal structure, highlighting the Ricci-flat case in…

2012-03-19abs ↗pdf ↗

We discuss whether it is possible to reconstruct a metric by its unparameterized geodesics, and how to do it effectively. We explain why this problem is interesting for general relativity. We show how to understand whether all curves from a sufficiently big family are umparameterized geodesics of a certain affine conne…

2011-01-11abs ↗pdf ↗

Bayesian optimization speeds up parameter reconstruction in optical nano-metrology.

problem Efficiently reconstructing parameters from time-consuming measurements in optical nano-metrology.
method Combines Bayesian optimization and curve fitting for faster, more efficient model fitting.
result The presented Bayesian Target Vector Optimization scheme achieves similar reconstruction performance with fewer model function calls.

Develops finite-gap solutions for Pohlmeyer--Lund--Regge equation and Lund--Regge curve evolution.

problem Solving the Pohlmeyer--Lund--Regge equation and understanding Lund--Regge curve evolution.
method Finite-gap construction using hyperelliptic spectral data, Baker--Akhiezer function, and SU(2)\mathrm {SU}(2)-frame.
result Explicit theta-quotient formula for PLR solutions and criteria for Lund--Regge curve evolution.

In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric conditio…

2013-11-18abs ↗pdf ↗

By introducing a shape manifold as a solution set to solve inverse obstacle scattering problems we allow the reconstruction of general, not necessarily star-shaped curves. The bending energy is used as a stabilizing term in Tikhonov regularization to gain independence of the parametrization. Moreover, we discuss how se…

2019-03-12abs ↗pdf ↗

DiTSNe-Ia model accurately reconstructs supernovae spectra from light curves.

problem Difficult identification and interpretation of diverse sub-populations of supernovae.
method Variational diffusion-based generative model conditioned on light curves.
result DiTSNe-Ia achieves significantly more accurate reconstructions than SALT3 across all phases.

Constrained Willmore surfaces are critical points of the Willmore functional under conformal variations. As shown in [5] one can associate to any conformally immersed constrained Willmore torus f a compact Riemann surface Σ, such that f can be reconstructed in terms of algebraic data on Σ. Particularly interesting exam…

2012-12-10abs ↗pdf ↗

We consider the problem of minimizing 0Lξ2+K2(s)ds\int_{0}^L \sqrt{ξ^2 +K^2(s)}\, ds for a planar curve having fixed initial and final positions and directions. The total length LL is free. Here ss is the variable of arclength parametrization, K(s)K(s) is the curvature of the curve and ξ>0ξ>0 a parameter. This problem comes from…

2012-03-14abs ↗pdf ↗

Given a compact manifold with boundary with unknown Riemannian metric. The problem is to reconstruct the metric in a class of conformal metrics from knowledge of lengths of all closed geodesics (kinematic data). An integral inequality is stated which implies uniqueness and stability for this problem. If the conformal c…

2012-02-24abs ↗pdf ↗

SAEs struggle with curved activation manifolds, revealing layer-dependent scaling laws.

problem Sparse autoencoders' reconstruction error varies across layers, not fitting existing scaling laws.
method Cross-layer study of 844 SAE checkpoints, fitting and regressing on manifold geometry.
result Manifold geometry predicts layer-dependent width exponents in SAEs, with transferable coefficients.

The level sets of neural networks represent fundamental properties such as decision boundaries of classifiers and are used to model non-linear manifold data such as curves and surfaces. Thus, methods for controlling the neural level sets could find many applications in machine learning. In this paper we present a simpl…

2019-05-28abs ↗pdf ↗

Reconstruct flows and manifolds from their boundary actions on circles.

problem Understanding and reconstructing flows and manifolds from their boundary actions.
method Reconstructing flows and manifolds from actions on circles with invariant almost laminations.
result Reconstructs flows and manifolds from their boundary actions, including pseudo-Anosov flows in 3-manifolds.

Analytic plane curves determine unique conformal coordinates.

problem Determining a conformal coordinate system for analytic plane curves.
method Holomorphic continuation of the Frenet curvature form.
result Holomorphic continuation of the curvature form uniquely determines a conformal coordinate net.

In this paper we consider the problem of reconstructing a curve that is partially hidden or corrupted by minimizing the functional 1+Kγ2ds\int \sqrt{1+K_γ^2} ds, depending both on length and curvature KK. We fix starting and ending points as well as initial and final directions. For this functional we discuss the problem o…

2009-06-29abs ↗pdf ↗

It is shown that if MM is a strongly causal free of naked singularities space-time, then its causal structure is completely characterized by a partial order in the space of skies defined by means of a class non-negative Legendrian isotopies. It is also proved that such partial order is determined by the class of futur…

2014-11-06abs ↗pdf ↗

Accelerates pulsar light curve inference with learned representations and optimization.

problem Computational expense of Markov chain Monte Carlo methods for posterior inference.
method Combining U-Net latent representations with local simulator-guided optimization.
result 120x reduction in inference time (24 hours to 12 minutes) with accuracy preserved.

In machine learning, statistics, econometrics and statistical physics, cross-validation (CV) is used asa standard approach in quantifying the generalisation performance of a statistical model. A directapplication of CV in time-series leads to the loss of serial correlations, a requirement of preserving anynon-stationar…

2019-10-21abs ↗pdf ↗

Study characterizes bladder motion using dynamic MRI and statistical analysis.

problem Limited volume coverage in dynamic MRI sequences hinders 3D shape reconstruction.
method 3D dense velocity measurements, LDDMM framework, statistical characterization, mean curvature changes, surface deformation analysis.
result Stable shape descriptor for characterizing bladder surface dynamics.

The curvature regularities are well-known for providing strong priors in the continuity of edges, which have been applied to a wide range of applications in image processing and computer vision. However, these models are usually non-convex, non-smooth and highly non-linear, the first-order optimal condition of which ar…

2019-12-01abs ↗pdf ↗

In this manuscript we propose two objective terms for neural image compression: a compression objective and a cycle loss. These terms are applied on the encoder output of an autoencoder and are used in combination with reconstruction losses. The compression objective encourages sparsity and low entropy in the activatio…

2019-05-24abs ↗pdf ↗