arXiv:2606. 06505v1 Announce Type: cross Abstract: We introduce a user defined probabilistic polygonal representation for plane curves.
arXiv:2607. 19600v1 Announce Type: cross Abstract: The shape of a planar curve is the geometric information that remains once translation, rotation, scale and reparametrisation are removed and is of interest in many health applications, e.
arXiv:2603. 09793v2 Announce Type: replace Abstract: Bayesian optimization is a data-efficient technique that has been shown to be extremely powerful to optimize expensive, black-box, and possibly noisy objective functions.
arXiv:2606. 00139v1 Announce Type: cross Abstract: Curvature-penalized geodesic models have proven their effectiveness in image segmentation by computing globally optimal curves.
The paper introduces a pullback Riemannian geometry tailored for multimodal data by employing a latent Gaussian mixture model. It defines a smooth, positive‑definite metric based on responsibility‑weighted component precision, extending the standard single‑Gaussian construction. Experiments on synthetic, multi‑view image, and MNIST datasets demonstrate reduced transport distortion, accurate trajectory recovery, and more realistic interpolation.
arXiv:2607. 03112v1 Announce Type: cross Abstract: We revisit random projections for reducing the dimension of high-dimensional polygonal curves.
The paper introduces a new representation‑adaptive kernel class that, on a fixed sample, yields a union of reproducing‑kernel Hilbert‑space ellipsoids instead of a single ellipsoid. It defines a minimum‑trace common covariance dominating the empirical union generated by Brownian kernel ladders, and derives exact formulations, statistical and computational consequences, and a universal Gaussian‑complexity bound. The work further develops geometric reductions, deterministic depth laws, and exact empirical Kolmogorov‑width formulas, providing both lower and upper certificates for covariance certification and illustrating the distinction between successful covariance certification and predictive selection.
arXiv:2609.17566v1 Announce Type: new Abstract: Curve subdivision is pivotal in computer graphics for generating smooth geometric objects from control polygons. Interpolatory subdivision is especiall...
NeuralSRNF is a new framework that enables efficient statistical shape analysis and generation of genus‑zero 3D and 4D objects undergoing nonrigid deformations. It replaces costly numerical SRNF inversion with a continuous, resolution‑agnostic neural representation that accurately reconstructs shapes and computes inverse SRNF maps in under 3 s, compared to over 10 min for traditional methods. Experiments on multiple datasets show that NeuralSRNF outperforms existing techniques in accuracy and speed across tasks such as geodesic computation, deformation transfer, statistical summarization, and shape generation.
arXiv:2609.39497v1 Announce Type: cross Abstract: Randomized smoothing certifies the probability of a fixed output event as the center of Gaussian noise moves. Feasibility or confidence filtering rep...
arXiv:2606. 17022v1 Announce Type: cross Abstract: A central objective of machine learning is to identify structure and patterns in data.
arXiv:2512.09201v2 Announce Type: replace-cross Abstract: We introduce a framework for converting 3D shapes into compact and editable assemblies of analytic primitives, directly addressing the persis...
arXiv:2508. 05950v2 Announce Type: replace-cross Abstract: We propose CLONE, a 3DGS-based Closed-Loop differentiable Optimization framework for single-image Normal Estimation.