Skip to content

Soft-Argmax for the Projective Plane via the Veronese Embedding

Sep 2026 · 0 citations · 20 references
Computer Science

TL;DR

The Veronese soft-argmax is validated in a Hough transform-based network across all resolvable lines, confirming uniform and seam-free recovery and the squared chordal distance between lines in projective space is derived, enabling a geometrically precise training objective.

Abstract

From horizon detection to fibre structures in X-ray imaging, many vision tasks recover lines via peak detection in Hough space $H=S^1\times\mathbb{R}$, the domain of orientation-offset pairs $(\theta,\rho)$. Differentiable pipelines extract coordinates via \emph{soft-argmax}, a probability-weighted average that is only meaningful in a globally linear space. However, $(\theta,\rho)$ and $(\theta+\pi,-\rho)$ describe the same undirected line, so $H$ double-covers the space of undirected lines $H/\mathbb{Z}_2$: a M\"obius strip, obtained by identifying each pair under $\mathbb{Z}_2$ action. Soft-argmax operates on the cover $H$, but since $H/\mathbb{Z}_2$ admits no linear structure, it tears geometrically adjacent lines apart. Thus we need a $\mathbb{Z}_2$-invariant embedding of lines into a linear space, on which soft-argmax is well-defined. We achieve this by parametrising lines via unit-norm homogeneous vectors $\ell=(1+\rho^2)^{-1/2}(\cos\theta,\sin\theta,-\rho)^{\top}\in\mathbb{R}^3$ and applying the Veronese map $v_2(\ell)=\ell\ell^{\top}$ that satisfies $v_2(\ell)=v_2(-\ell)$. This descends continuously to an embedding of the quotient $H/\mathbb{Z}_2$ into the linear space $\mathrm{Sym}^2(\mathbb{R}^3)$, where the antipodal ambiguity vanishes. Line extraction becomes a barycentre in $\mathrm{Sym}^2(\mathbb{R}^3)$, projected back via its leading eigenvector. We validate our \emph{Veronese soft-argmax} in a Hough transform-based network across all resolvable lines, confirming uniform and seam-free recovery. We further derive that the $L_2$-loss on isometrically weighted Veronese embeddings equals the squared chordal distance between lines in projective space, enabling a geometrically precise training objective.

View source

Similar papers

Preprint Sep 2026

Gauge-Equivariant Attention for Rotation-Stable $360^\circ$ Scene Understanding

Gauge-equivariant relative position encoding (GE-RPE) is proposed, a parameter-free Reynolds average of the bias over a finite cyclic subgroup of gauge rotations of gauge rotations that is a usable visual-computing primitive across panoramic relighting, immersive video, and cross-dataset transfer.

Tian-Jian Zhou, Yi-Shan Li, Jie Jiang et al. · 0 citations
Preprint Sep 2026

The information content of optical intensity interferometry

Optical intensity interferometry (II) can in principle resolve structure on angular scales $\theta\sim \lambda/B$, but it measures only the squared visibility $|{\cal V}|^2$, discarding Fourier phase. We quantify what information can actually be recovered from phase-less $|{\cal V}|^2$ measurements as a function of the...

N. Dalal, B. Dai, Matthew K. Browning · 0 citations
Preprint Aug 2026

Barycentric Weak Inner-Product Gromov-Wasserstein

Gromov-Wasserstein (GW) compares distributions through relations within each space. This pointwise comparison can be too sensitive in one-to-many settings, where several target outcomes refine one source state and their mean carries the geometry of interest. We introduce a weak GW framework that compares source relatio...

Youssef Mroueh · 0 citations
Preprint Oct 2026

Pretty good shadow tomography

We give a shadow tomography algorithm that uses $O(\log(m) \log(m/\delta) / \varepsilon^2)$ copies of the input state. Specifically, given a quantum state $\rho$ and observables $O_1,\ldots,O_m$, the algorithm outputs estimates of $\mathrm{tr}(O_i\rho)$ for all $i\in[m]$ that are all accurate to within $\pm\varepsilon$...

Sabee Grewal, Angelos Pelecanos, Jack Spilecki et al. · 0 citations
Preprint Aug 2026

Alternative-mean trace divergences: geometry, data processing, and barycenters

Let $f:(0,\infty)\to(0,\infty)$ be a nontrivial normalized operator monotone function and set $s=f'(1)$. We introduce the alternative-mean trace functional $$ \altPhi_f(A,B) :=\Tr(A\nabla_s B) -\Tr\!\left( f(A^{-1}\sharp B)\,A\,f(A^{-1}\sharp B) \right). $$ on the positive definite cone. We prove that $\altPhi_f$ is a...

T. Vuong, H. Shudo, H. Osaka · 0 citations
#machine learning Preprint Oct 2026

Rubix: Global Correspondence-Free Point Set Alignment through Assignment Geometry

The sharp bound of $n(n-1)$ vertices for $n\ge2$ is proved, answering Rote's rotation-assignment open problem, and assignment-based bounds extend the approach to three-dimensional rotations and partial matching at a supplied translation through branch-and-bound.

Subhransu S. Bhattacharjee, Dylan Campbell, Rahul Shome · 0 citations

Related blog posts

Microsoft Research Blog Aug 11, 2026

Introducing CARE-X: Towards Clinically Useful Radiology VLMs with Auxiliary Supervision, Reward-Aligned Learning, and Tool-Augmented Measurement

Radiology AI is evolving beyond report generation. CARE-X explores a unified approach that combines flexible reasoning, calibrated predictions, and measurement-based tools for chest X-ray interpretation. The post Introducing CARE-X: Towards Clinically Useful Radiology VLMs with Auxiliary Supervision, Reward-Aligned Learning, and Tool-Augmented Measurement appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

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