Skip to content
Open access

Infimum Dimension Nash Embeddings for 2D Projective Shape Analysis

Jul 2026 · Annals of Data Science · 0 citations · 16 references

TL;DR

This work determines the minimum dimension isometric (distance-preserving or Nash) vector embedding for a projective space and determines an embedding for the Cartesian product of projective planes which is used to develop a novel extrinsic mean test as well as a novel homogeneity test for 2D projective shape analysis.

Abstract

Vector embeddings make complicated data extracted from networks, words and images, more amendable to data science applications. At the present time, the Veronese-Whitney (VW) matrix embedding of the real projective space is the state of the art for making inference about digital images from an uncalibrated camera, such as a cell phone or security camera. In this work we consider vector embeddings for the projective shape data and in particular determine the minimum dimension isometric (distance-preserving or Nash) vector embedding for a projective space. We determine such an embedding for the projective plane in closed-form. From this embedding we determine an embedding for the Cartesian product of projective planes which is used to develop a novel extrinsic mean test as well as a novel homogeneity test for 2D projective shape analysis. In a Monte Carlo study and real data application it is found that this new testing procedure performs as well as the state of the art extrinsic test based on the VW embedding in terms of hypothesis tests for extrinsic means, tests for homogeneity with tangential components and classification via support vector machines. Furthermore, it generally outperforms the vech of the VW embedding. Note however that the Nash embedding is into five-dimensional Euclidean space, whereas the VW embedding is into the Euclidean space of 3 by 3 symmetric matrices, which is six-dimensional. Our vector-valued Nash embedding is preferred over the matrix-valued VW embedding for data science applications since (i) it is a vector embedding and performs as well as the state of the art VW matrix embedding when the latter can be used in a statistical procedure and (ii) and our embedding is easily used for classification and visualization with traditional statistical techniques.

Read PDF

Similar papers

Open access Jul 2025

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness

A Riemannian optimization framework for solving the EDMC problem by formulating it as a low-rank matrix completion task over the space of positive semi-definite Gram matrices, which provides a geometric interpretation of matrix incoherence tailored to the EDMC setting and provides robustness guarantees for the method.

Chandler Smith, HanQin Cai, Abiy Tasissa · 3 citations
Preprint Aug 2026

Hyper^2: Unleashing Hyperbolic Geometry's Full Potential via Dual-Space Consistency

Hyper^2 is proposed, a dual-space consistency framework that extends HyperbolicCD by reusing the identical arcosh(1+alpha d^2) functional form as a positional bias on the refinement attention (a hyperbolic distance encoding), paired with HyperbolicCD's hyperbolic Chamfer loss under a single shared curvature alpha.

Guan-Tian Zheng, Hai-Yang Xu, Tian-Yu Gao · 0 citations
Preprint Aug 2026

Iterative Erasure Count Is Not an Affine-Invariant Concept Dimension

How many directions does a neural representation use to encode a concept? A common answer repeatedly erases probe directions and reports the stopping count or cumulative removed rank. We show that both quantities can change under an information-preserving invertible reparameterization, so neither is intrinsically a con...

Tingan Jin, Shu-Hang Dong, Hao-Song Li et al. · 1 citation
Jul 2026

Geometric planted matchings in high dimensions: The power of multiple views

A simple polynomial-time procedure recovers all relative matchings up to $o(n)$ errors whenever $b>K/(K-1)$ and multiple views can break the impossibility barrier $b=2$ for the original matching problem.

Timothy L. H. Wee, Kaylee Yingxi Yang, Zhou Fan et al. · 0 citations
Preprint Jul 2026

Deterministic Online Embedding of Metric Spaces into Low Dimensional Spaces

We study online embeddings of metric spaces into Euclidean spaces of a constant dimension $d>1$, against an adaptive adversary. While the case of $d=1$ is well understood, for higher dimensions little is known. In particular, even for $d=2$ it remains unknown whether the worst-case distortion grows exponentially with t...

Noam Licht, Ilan Newman, Yuri Rabinovich · 0 citations
Jul 2026

Group Invariant Spectral Embedding

This work analyzes the case of a Riemannian data manifold with symmetries given by a compact Lie group~G and proves that, under suitable conditions, graph Laplacians constructed from three types of invariant kernels converge pointwise to explicit second-order differential operators on the quotient space $M/G$.

Yeari Vigder, Paulina Hoyos, David Thong et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.