Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Thursday 7 May

Analysis of PDEs

Multiscale analysis and homogenization of nonlocal thin films

In this paper, we introduce a nonlocal, variational model for thin films. We consider convolution-type functionals defined on a thin domain whose thickness is of order $\gamma$, where the effective interactions range between points is of order $\varepsilon$. We study the $\Gamma$-convergence of these energies, as both parameters vanish, to a local integral functional defined on a lower-dimensional domain. In the periodic homogenization setting, the limit energy density is characterized by an asymptotic formula that depends on the interplay between $\varepsilon$ and $\gamma$. Under suitable assumptions, this formula exhibits a separation of scales effect, namely, the limit energy can be obtained by performing two successive $\Gamma$-limits, first letting one parameter tend to zero while keeping the other fixed.
Read the full abstract

Probability

Convergence rate of the occupation measure of classes of ergodic processes toward their invariant distribution in mean Wasserstein distance

N. Fournier and A. Guillin obtained in their 2015 PTRF paper some bounds of the L^p-mean rate of convergence in Wasserstein distance of empirical distributions for a class of stationary mixing processes. In this paper, we propose to extend their strategy of proof and provide general criterions which allow to keep similar rates for a larger class of processes. These results (which do not require regularization techniques) lead to various applications to occupation measures of ergodic processes which may be not stationary or not Markovian under an assumption of conditional convergence to equilibrium in Total Variation or Wasserstein distance. We then provide explicit conditions which lead to these rates for Brownian diffusions and additive SDEs driven by fractional Brownian Motions {or by Gaussian processes with stationary increments}.
Read the full abstract

Differential Geometry

Isometric solutions to the heterotic $\mathrm{G}_2$-system

In this note, we construct new solutions to the heterotic $\mathrm{G}_2$-system with non-abelian gauge group, both compact and non-compact, on certain $2$-step nilmanifolds and $3$-Sasakian manifolds. Our approach is based on an ansatz that allows us to vary both the $\mathrm{G}_2$-structure and the gauge data while keeping the underlying metric and orientation fixed. This leads, in particular, to distinct isometric solutions on the same manifold but with different gauge groups, and in some cases the resulting connection coincides with the characteristic connection of the $\mathrm{G}_2$-structure. We also investigate an $S^1$-invariant construction that yields further isometric solutions and with varying cosmological constant. Our results recover and extend several known examples solving the heterotic $\mathrm{G}_2$-system within a unified framework.
Read the full abstract

Dynamical Systems

Martingale Methods for Maximal Large Deviations and Young Towers

We develop a martingale approximation framework yielding quantitative maximal large deviations estimates for invertible dynamical systems. From suitable decay of correlations, we deduce these estimates and, as an application, we obtain Young structures with matching recurrence tails for partially hyperbolic diffeomorphisms with mostly expanding central direction. In a second application, we prove maximal large deviation estimates for systems modelled by Young towers with subexponential contraction and expansion. Many examples of slowly mixing billiards are covered by this result.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Sharper Guarantees for Misspecified Kernelized Bandit Optimization

Existing guarantees for misspecified kernelized bandit optimization pay for misspecification through kernel complexity: in generic offline bounds, the misspecification level $\varepsilon$ is multiplied by $\sqrt{d_\mathrm{eff}}$, where $d_\mathrm{eff}$ is the kernel effective dimension, while in online regret bounds, the corresponding penalty is $\sqrt{\gamma_n}\,n\varepsilon$, where $\gamma_n$ is the maximum information gain after $n$ rounds of interaction. In this work, we show that, for a large class of kernels, the misspecification amplification can be reduced to logarithmic or polylogarithmic growth. In the offline setting, we first prove high-probability simple-regret bounds whose misspecification term is governed by a spectral Lebesgue constant. This yields logarithmic amplification for one-dimensional monotone spectra and polylogarithmic amplification for multivariate Fourier-diagonal product kernels. In the online setting, we modify a domain-splitting algorithm and prove a cumulative regret bound of $\widetilde{\mathcal O}(\sqrt{\gamma_n n}+n\varepsilon)$ under mild localized eigendecay assumptions, removing the extra $\sqrt{\gamma_n}$ factor from the misspecification term. The common principle is localization: spectral localization controls the Lebesgue constant of the offline approximation operator, while domain splitting implements the spatial analogue of this mechanism in the online setting, preventing local misspecification errors from being amplified globally.
Read the full abstract

Optimization and Control · Cross-listed from cs.DS

Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem

Given a directed, discrete-time temporal graph $G=(V,R)$, a start node $s\in V$, and $p\geq1$ objectives, the single-source multiobjective temporal shortest path problem asks, for each $v\in V$, for the set of nondominated images of temporal $s$-$v$-paths together with a corresponding efficient path for each image. A recent general label setting algorithm for this problem relies on two properties of the objectives - monotonicity and isotonicity. Monotonicity generalizes the nonnegativity assumption required by label setting methods for the classical additive single-objective shortest path problem on static graphs, while isotonicity ensures that the order of the objective values of two paths is preserved when both are extended by the same arc. In this paper, we study the problem without assuming monotonicity and/or isotonicity. A key difficulty in this setting is that zero-duration temporal cycles may need to be traversed an arbitrary finite number of times to generate all nondominated images. This motivates the study of a restricted problem variant in which a maximum admissible path length $K$ is imposed, and only paths containing at most $K$ arcs are considered. We develop general label correcting algorithms for this setting and establish several sufficient conditions under which such a bound is not required, implying that the algorithms compute all nondominated images.
Read the full abstract

Optimization and Control

Universal Adaptive Proximal Gradient Methods via Gradient Mapping Accumulation

We propose an adaptive proximal gradient method for minimizing the sum of two functions, where one is a simple convex function, and the other belongs to one of the three classes: nonconvex smooth, convex nonsmooth, or convex smooth. The key feature of the method is an adaptive step size that accumulates historical gradient mapping norms in the denominator. Without any modification or knowledge of problem parameters, the method converges across all three problem classes under mild bounded-iterates and bounded-variance assumptions, with rates matching those of the proximal gradient method up to logarithmic factors, in both deterministic and stochastic settings. For the convex setting, we further propose an accelerated variant. It retains a similar near-optimal convergence rate for the nonsmooth case and achieves an improved rate of order $\widetilde{O}\big(1/t^2 + \sigma/\sqrt{t}\big)$ for the smooth case, which is optimal up to logarithmic factors. Notably, we develop new techniques for controlling the effect of stochastic noise, which are applicable across all three problem classes in the stochastic setting and enable a simplified analysis.
Read the full abstract

Algebraic Geometry

A two-step approach to Chow quotients

The Chow quotient of a projective variety by the action of a complex torus is known to have a very complicated geometry, even in the case of simple varieties, such as rational homogeneous varieties. In this paper we propose an approach in which the geometry of the Chow quotient is encoded in a projective toric variety and a finite subgroup of its birational automorphisms. We then illustrate how to apply our strategy in the case of some particular rational homogeneous varieties.
Read the full abstract

Dynamical Systems

Bifurcations of grazing loops of arbitrary tangent multiplicity in piecewise-smooth systems

In piecewise-smooth differential systems, a hyperbolic limit cycle of a subsystem loses its structural stability if it grazes the switching manifold at a tangent point. Such a cycle is called a grazing loop and in this paper we investigate its bifurcations for arbitrary tangent multiplicity. For the low-multiplicity tangency, the recurrences are comprehensively captured by a functional perturbation with two parameters in previous publications, where the parameters characterize the recurrences near the tangent point and the limit cycle respectively. However, for high-multiplicity tangency, these parameters fail to capture the recurrences and thus, Poincare return maps can not be defined as usual. To address these challenges, we construct a functional perturbation with functions to clarify the recurrences and simultaneously, propose a localization method to make these two recurrences equivalent. We finally establish a quantitative relationship between the multiplicity of tangency and the numbers of crossing limit cycles, sliding loops bifurcating from the grazing loop and the number of tangent points on these sliding loops.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

PREFER: Personalized Review Summarization with Online Preference Learning

Product reviews significantly influence purchasing decisions on e-commerce platforms. However, the sheer volume of reviews can overwhelm users, obscuring information most relevant to their individual needs. Existing e-commerce summarization systems typically produce generic, static summaries that fail to account for the fact that (i) different users prioritize different product characteristics, and (ii) these preferences may evolve with interactions. To address these challenges, we propose an online learning framework that generates personalized summaries for each user by representing user interests in a latent aspect space and selecting preference-aligned review evidence. Our system then iteratively refines its understanding of user preferences by incorporating feedback on the generated summaries directly over time. We evaluate our framework on Amazon Reviews'23 using controlled feedback simulations and robustness checks with held-out-history, independent-embedding, and external LLM-based evaluators. These experiments show improvements in preference-aligned evidence selection under the evaluated feedback settings. A separate human-based study finds that scenario-conditioned summaries are preferred over generic (uniformly-aggregated) alternatives in 69.9% of paired comparisons.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Quadratic Objective Perturbation: Curvature-Based Differential Privacy

Objective perturbation is a standard mechanism in differentially private empirical risk minimization. In particular, Linear Objective Perturbation (LOP) enforces privacy by adding a random linear term, while strong convexity and stability are ensured by an additional deterministic quadratic term. However, this approach requires the strong assumption of bounded gradients of the loss function, which excludes many modern machine learning models. In this work, we introduce Quadratic Objective Perturbation (QOP), which perturbs the objective with a random quadratic form. This perturbation induces strong convexity and enforces stability of the problem through curvature, thereby enabling privacy and allowing sensitivity to be controlled through spectral properties of the perturbation rather than assumptions on the gradients. As a result, we obtain $(\varepsilon, \delta)$-differential privacy under weaker \red{gradient} assumptions. Furthermore, we extend the analysis to account for approximate solutions, showing that privacy guarantees are preserved under inexact solves. Additionally, we derive utility guarantees in terms of empirical excess risk, and provide a theoretical and numerical comparison to LOP, highlighting the advantages of curvature-based perturbations. Finally, we discuss algorithmic aspects and show that the resulting problems can be solved efficiently using modern splitting schemes.
Read the full abstract

Probability

Schrödinger's problem with constraints

Motivated by the connection between the Kyle equilibrium with static private signal and the Brownian bridge, we study a much broader class of bridges that allow one to consider more general equilibrium models, for example ones including trading costs and default risk. We show that such bridges are solutions to problems of the Schrödinger-type. Leveraging this connection, we obtain that the equilibria in models with trading costs converge to equilibria in the classical Kyle model.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CV

DBMSolver: A Training-free Diffusion Bridge Sampler for High-Quality Image-to-Image Translation

Diffusion-based image-to-image (I2I) translation excels in high-fidelity generation but suffers from slow sampling in state-of-the-art Diffusion Bridge Models (DBMs), often requiring dozens of function evaluations (NFEs). We introduce DBMSolver, a training-free sampler that exploits the semi-linear structure of DBM's underlying SDE and ODE via exponential integrators, yielding highly-efficient 1st- and 2nd-order solutions. This reduces NFEs by up to 5x while boosting quality (e.g., FID drops 53% on DIODE at 20 NFEs vs. 2nd-order baseline). Experiments on inpainting, stylization, and semantics-to-image tasks across resolutions up to 256x256 show DBMSolver sets new SOTA efficiency-quality tradeoffs, enabling real-world applicability. Our code is publicly available at https://github.com/snumprlab/dbmsolver.
Read the full abstract

Probability · Cross-listed from cs.DS

Understanding Simulated Annealing: from Weak Poincaré Inequalities to a Discrete Optimal Transport Framework

Simulated annealing follows a path of distributions from an easy initial law to a target. Standard analyses require rapid mixing at every fixed temperature, which can fail for multimodal targets even when annealing succeeds. Motivated by the continuous optimal-transport analysis of annealed Langevin dynamics by Guo, Tao, and Chen (ICLR 2025), we develop a discrete optimal-transport framework for finite-state annealing. The discrete action of the path integrates the minimum electrical energy needed to route the demand $-\partial_s\pi_s$ through the chain's transition capacities. Like a path-dependent inverse conductance, it penalizes a bottleneck only when the path must move mass across it. We also introduce weak action, which leaves an $\varepsilon$ amount of this motion unrouted. Up to initialization error, action $\mathcal A$ gives reverse-KL error at most $\mathcal A/(4T)$ after $T$ expected updates, while weak action gives TV error at most $\varepsilon+\sqrt{\mathcal A^{w}_\varepsilon/(8T)}$. Paralleling canonical paths and Poincaré inequalities, we develop flow and spectral bounds, showing that pathwise (weak) Poincaré inequalities imply (weak) action bounds. We also show that a weak Poincaré inequality yields a genuine one after removing a small amount of mass. As a pathwise analogue of chain decomposition, we obtain a componentwise algorithm for mixtures with phase weights supplied at initialization. Applications include mean-field Ising and Potts models and bipartite spin systems. For every fixed $\delta>0$, we give a polynomial-time single-site annealing sampler for uniform independent sets in $(d,D)$-biregular bipartite graphs with $D/d\geq1+\delta$ and large $D$. To our knowledge, this is the first polynomial-time sampler requiring only a fixed multiplicative degree imbalance, strictly extending the $D\geq7d\log d$ regime of Cannon and Perkins (SODA 2020).
Read the full abstract

All authors Yuchen He, Tianhui Jiang, Zhehan Lei, Sihan Wang, Chihao Zhang

Statistics Theory · Cross-listed from stat.ML

CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency

Large language models often improve reasoning by sampling multiple outputs and aggregating their final answers, but precise and efficient control of error levels remains a challenging task. In particular, deciding when to stop sampling remains difficult when the stopping rule is data-dependent and the set of possible answers is not known in advance. We study anytime-valid certification of a prespecified target answer as the unique mode of the model's response distribution, a guarantee distinct from answer correctness. We propose the Certification by Intersection-union Testing with E-processes (CITE) algorithm, which provably controls false certification at any prescribed level under arbitrary data-driven stopping, without requiring prior knowledge of the answer category set. We also prove an category-set-size-free stopping-time rate, establish matching minimax lower bounds up to constants in the main regime, and extend the construction to confidence-weighted voting. Simulations and LLM self-consistency experiments show empirical error control and improved certification in diffuse-tail settings.
Read the full abstract

All authors Hirofumi Ota, Naoto Iwase, Yuki Ichihara, Junpei Komiyama, Masaaki Imaizumi

Analysis of PDEs

Consistency analysis for combined homogenization and shallow water limit of water waves

We consider a shallow water model in a homogenization framework. For periodic topographies, Craig, Lannes and Sulem have established a consistency result under some non-resonance conditions. In the present contribution, we significantly relax the periodicity condition and treat general topographies under minimal assumptions.
Read the full abstract

Probability

Classification and Metrization of Classes of Smooth measures

We classify the several classes of the set of smooth measures from the perspective of the denseness and the locality, and consider their relationships, in particular, that of the Kato class and Radon measures of finite energy integrals. We also introduce the Miyadera metric on the Dynkin class, and obtain the continuity of the Revuz correspondence.
Read the full abstract

Optimization and Control

A closer target setting approach to boundary problems with the Russell graph measure

A Russell graph measure (RGM) is one of the standard DEA models, but its efficiency measure is not well-defined–or has unacceptable properties–at the boundary of the nonnegative orthant. This is known as a boundary problem. Existing studies have tackled this issue; however, their models may fail to identify an efficient target or fail to satisfy some desirable properties of efficiency measures. In this paper, we incorporate a closer target setting approach into the RGM model with production trade-offs to overcome such issues. We demonstrate that the efficiency measure of the proposed model overcomes the boundary problem and has stronger properties than existing models. We also demonstrate that the efficiency scores of the proposed model can be computed by solving a series of LPs. We conduct a numerical experiment with a real-world dataset to illustrate how targets provided by our model are realistic compared with the existing model, which also suggests the validity of our model in applications.
Read the full abstract

Rings and Algebras

Spaces of matrices with few eigenvalues (II)

Let $F$ be a field, and $\mathcal{M}$ be a linear subspace of $n$-by-$n$ matrices with entries in $F$ that have at most two eigenvalues in $F$ (respectively, at most one non-zero eigenvalue in $F$). In a previous article, we have determined the greatest possible dimension for $\mathcal{M}$ when the characteristic of $F$ is not $2$. In this article and its sequel, we solve this problem for all fields with characteristic $2$.
Read the full abstract

Numerical Analysis

Mathematical and experimental validation of the bifocusing method tailored for bistatic measurement

In this paper, we design a bifocusing-based imaging strategy for the rapid identification of small penetrable dielectric inhomogeneities within a two-dimensional bistatic measurement setup. To address the applicability and limitation, we carefully explore the mathematical structure of the indicator function by establishing a relationship involving the infinite series of Bessel functions, the material characteristics, and the bistatic angle. Through this theoretical result, we rigorously verify that the imaging resolution degrades as the bistatic angle approaches $\SI{180}{\degree}$, and specifically, that target identification becomes impossible when the bistatic angle is $\SI{180}{\degree}$. Conversely, relatively high-resolution results are obtained when the bistatic angle is close to $\SI{0}{\degree}$. The theoretical findings are validated through numerical simulations using the Fresnel experimental dataset, which confirm the applicability and limitations of the proposed method for both dielectric and metallic objects.
Read the full abstract

Information Theory · Cross-listed from eess.SP

TGPP: Trajectory-Guided Plug-and-Play Priors for Sparse Radio Map Reconstruction

Radio map (RM) reconstruction is essential for environment-aware wireless networks, but practical measurements are often collected along mobility trajectories rather than randomly scattered over the target region. Such trajectory-sampled observations induce spatially heterogeneous uncertainty: near-trajectory regions are directly constrained, whereas distant or occluded regions remain weakly observed, leading to degraded reconstruction accuracy in under-constrained areas. To address this problem, we propose Trajectory-Guided Plug-and-Play Priors (TGPP), a general guidance module for sparse RM reconstruction. TGPP learns an explicit guidance map as an interpretable input-space risk prior, and an implicit guide feature that is projected and fused with backbone hidden representations. TGPP can be attached to different reconstruction backbones without changing their original task formulation. We further introduce RadioFlow-LDM, a latent flow-based generative backbone, and apply TGPP to deterministic, adversarial, graph-based, and latent generative reconstruction models. Experiments on RadioMapSeer with five trajectory sampling rates show that trajectory-sampled reconstruction differs substantially from random sparse interpolation. TGPP improves most reconstruction metrics across backbones, achieving up to 43.1% NMSE reduction relative to the corresponding base backbone without trajectory-guided priors.
Read the full abstract

All authors Jiawen Zhang, Zhiyuan Jiang, Sheng Zhou, Zhisheng Niu

Analysis of PDEs

Asymptotic properties of solutions to the characteristic problem for the ultrahyperbolic equation

The paper concerns the problem for the ultrahyperbolic equation in the Euclidean space with data on a characteristic hyperplane. Smoothness and asymptotics of the solution along characteristic lines transversal to the initial hyperplane are investigated.

Information Theory

An Additive Approximation Scheme for Generating Dyadic Codings for the Outputs of an LLM

We study the problem of approximating a discrete probability distribution, such as the next-token distribution of a large language model, by a dyadic distribution induced by a binary tree under encoding rate constraints. The objective is to partition the support of the distribution and assign dyadic probabilities to minimize total variation distance while achieving a prescribed rate. We formulate this task as a tree-based partitioning problem and develop a polynomial-time additive approximation scheme for the rate-constrained setting in the constant-rate regime. Our results provide provable guarantees for near-optimal dyadic approximations and, as an application, yield a principled framework for LLM-based steganography, where the rate maps to bits of hidden information embedded per token and the total variation bound controls statistical detectability.
Read the full abstract

Dynamical Systems

Blaschke-type models for multimodal circle maps

For each integer $m \geq 1$, we construct a finite-dimensional family of rational maps, given by Blaschke-type products, whose restriction to the unit circle consists of $2m$-multimodal maps. We show that every post-critically finite $2m$-multimodal circle map satisfying natural dynamical conditions is topologically conjugate to a map in this family. Moreover, we prove that this realization is unique up to rotation: two maps in the family that are topologically conjugate on the circle differ by a rigid rotation. In particular, the family provides a canonical model realizing all post-critically finite combinatorics in this class. The proofs combine a detailed description of the critical geometry of these Blaschke-type maps with a Thurston-type fixed point argument for a pull-back operator on the parameter space.
Read the full abstract

All authors Edson de Faria, Welington de Melo, Pedro A. S. Salomão, Edson Vargas

Statistics Theory · Cross-listed from stat.ML

Ratio-based Loss Functions

Algorithms in machine learning and AI do critically depend on at least three key components: (i) the risk function, which is the expectation of the loss function, (ii) the function space, which is often called the hypothesis space, and (iii) the set of probability measures, which are allowed for the specified algorithm. This paper gives a survey of a certain class of loss functions, which we call ratio-based. In supervised learning, margin-based loss functions for classification tasks depending on the product of the output values $y_i$ and the predictions $f(x_i)$ as well as distance-based loss functions depending on the difference of $y_i$ and $f(x_i)$ for regression are common. Distance-based loss functions are in particular useful, if an additive model assumption seems plausible, i.e. the common signal plus noise assumption. However, in the literature, several loss functions proposed for regression purposes have a multiplicative error structure in mind and pay attention to relative errors, i.e. to the ratio of $y_i$ and $f(x_i)$. In this survey article, we systematically investigate such ratio-based loss functions and propose a few new losses, which may be interesting for future research. We concentrate on investigating general properties of ratio-based loss functions like continuity, Lipschitz-continuity, convexity, and differentiability, because these properties play a central role in most machine learning algorithms. Therefore, we do not focus on some specific machine learning algorithm to derive universal consistency, learning rates, or stability results. Instead, we want to enable future research in this direction.
Read the full abstract

Classical Analysis and ODEs

Finitude of Limit Cycles of Linear Piecewise ODEs in the Cylinder

Let $x'=S(t,x)$ be a differential equation in the cylinder, linear piecewise in $x$ and with trigonometric coefficients in $t$. In this paper, we provide an upper bound on the number of limit cycles in terms of the number of regions of the piecewise equation and the degree of the coefficients, that is, an analogue of Hilbert's 16th problem in this context.
Read the full abstract

Algebraic Geometry

The Ciliberto-Di Gennaro conjecture for $d=5$

The Ciliberto-Di Gennaro conjecture predicts that a nodal hypersurface of degree $d\geq 3$ with at most $2(d-2)(d-1)$ nodes is either factorial, or contains a plane and has at least $(d-1)^2$ nodes, or contains a quadric surface and has $2(d-2)(d-1)$ nodes. This conjecture is classically known for $d=3,4$. In 2022 the author proved this conjecture for $d\geq 7$ by the author. Kvitko announced a proof for $d=6$ in 2025. In this paper we prove the conjecture for the remaining open value of $d$, namely $d=5$.
Read the full abstract

Number Theory

The quotient problem for linear recurrence sequences

Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study the finiteness problem for the set $(m, n)\in \mathbb{N}^2$ such that there exist non-zero positive integers $d_{m, n}$ satisfying $\log |d_{m, n}|=o(n)$, and $d_{m, n}U(m)/V(n)$ is an element from a finitely generated subring of $\C$. In particular, we prove that for $m\neq n $, there exists a polynomial $P$ such that $d_{m, n}P(n)U(m)/V(n)$ is a multi-recurrence and $V(n)/P(n)$ is a linear recurrence and for $m=n$ both $d_{m, n}P(n)U(m)/V(n)$ and $V(n)/P(n)$ are linear recurrences. To prove our results, we employ Schmidt's subspace theorem, and the concept of moving hyperplanes, moving polynomials, and moving points.
Read the full abstract

Numerical Analysis · Cross-listed from q-bio.QM

Planar morphometry via functional shape data analysis and quasi-conformal mappings

The study of shapes is one of the most fundamental problems in life sciences. Although numerous methods have been developed for the morphometry of planar biological shapes over the past several decades, most of them focus solely on either the outer silhouettes or the interior features of the shapes without capturing the coupling between them. Moreover, many existing shape mapping techniques are limited to establishing correspondence between planar structures without further allowing for the quantitative analysis or modelling of shape changes. In this work, we introduce FDA-QC, a novel planar morphometry method that combines functional shape data analysis (FDA) techniques and quasi-conformal (QC) mappings, taking both the boundary and interior of the planar shapes into consideration. Specifically, closed planar curves are represented by their square-root velocity functions and registered by elastic matching in the function space. The induced boundary correspondence is then extended to the entire planar domains by a quasi-conformal map, optionally with landmark constraints. Moreover, the proposed FDA-QC method can naturally lead to a unified framework for shape morphing and shape variation quantification. We apply the FDA-QC method to various leaf and insect wing datasets, and the experimental results show that the proposed combined approach captures morphological variation more effectively than purely boundary-based or interior-based descriptions. Altogether, our work paves a new way for understanding the growth and form of planar biological shapes.
Read the full abstract