Related papers: New method of averaging diffeomorphisms based on J…
Normalizing flows are constructed from a base distribution with a known density and a diffeomorphism with a tractable Jacobian. The base density of a normalizing flow can be parameterised by a different normalizing flow, thus allowing maps…
Anatomical atlases are widely used for population studies and analysis. Conditional atlases target a specific sub-population defined via certain conditions, such as demographics or pathologies, and allow for the investigation of…
Anatomy is undergoing a renaissance driven by availability of large digital data sets generated by light microscopy. A central computational task is to map individual data volumes to standardized templates. This is accomplished by…
Ratios of quadratic forms in correlated normal variables which introduce noncentrality into the quadratic forms are considered. The denominator is assumed to be positive (with probability 1). Various serial correlation estimates such as…
It is given the diffeomorphism classification on generic singularities of tangent varieties to curves with arbitrary codimension in a projective space. The generic classifications are performed in terms of certain geometric structures and…
Inspired by several works on jet schemes and motivic integration, we consider an extension to singular varieties of the classical definition of discrepancy for morphisms of smooth varieties. The resulting invariant, which we call Jacobian…
We introduce a method for deterministic decoupling of global features and show its applicability to improve data analysis performance, as well as to open new venues for feature transfer. We propose a new formalism that is based on defining…
We introduce the novel method for estimation of mean and Gaussian curvature and several related quantities for polygonal meshes. The algebraic quadric fitting curvature (AQFC) is based on local approximation of the mesh vertices and…
Let $\Diffeo=\Diffeo(\R)$ denote the group of infinitely-differentiable diffeomorphisms of the real line $\R$, under the operation of composition, and let $\Diffeo^+$ be the subgroup of diffeomorphisms of degree +1, i.e.…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
The purpose of this paper is to provide new formulas for the estimation of the effective diffusion coefficient of an equation of Fick-Jacob's type obtained by projecting the two-dimensional diffusion equation along the normal direction of…
Directed acyclic graphs provide a fundamental tool for representing directed dependence structures in multivariate network data, and are widely used to model financial and economic networks. However, accurate and interpretable estimation…
Traditional deepfake detectors have dealt with the detection problem as a binary classification task. This approach can achieve satisfactory results in cases where samples of a given deepfake generation technique have been seen during…
A set of multi-homogeneous equations for the Jacobian of a genus two curve is given. The approach used is to write down affine equations for the Jacobian minus various tranlations of the Theta-divisor by [2]-division points, and then to…
We present a framework for computing averages of various observables of Macdonald processes. This leads to new contour--integral formulas for averages of a large class of multilevel observables, as well as Fredholm determinants for averages…
ConicCurv is a new derivative-free algorithm to estimate the curvature of a plane curve from a sample of data points. It is based on a known tangent estimator method grounded on classic results of Projective Geometry and B\'ezier rational…
Jacobi's method is a well-known algorithm in linear algebra to diagonalize symmetric matrices by successive elementary rotations. We report about the generalization of these elementary rotations towards canonical transformations acting in…
We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
The method of continuous averaging can be regarded as a combination of the Lie method, where a change of coordinates is constructed as a shift along solutions of a differential equation and the Neishtadt method, well-known in perturbation…