ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Xqˉ,nX_{\bar{\mathbf{q}}, n} be the affine variety of image configurations arising from a camera and world points qˉ∈(P3)n\bar{\mathbf{q}} \in (\mathbf P^3)^n. For generic data, let ED⁡(Xqˉ,n)\operatorname{ED}(X_{\bar{\mathbf{q}}, n}) denote the number of critical points of the squared Euclidean loss restricted to the smooth locus of Xqˉ,nX_{\bar{\mathbf{q}}, n}. Euclidean distance degree conjecture. For all n≥6n\ge 6 and generic qˉ∈(P3)n\bar{\mathbf{q}} \in (\mathbf P^3)^n,

ED⁡(Xqˉ,n)=(80/3)n3−368n2+(5068/3)n−2580.\operatorname{ED}(X_{\bar{\mathbf{q}}, n}) = (80/3)n^3 - 368n^2 + (5068/3)n - 2580.

This formula predicts the algebraic complexity of globally optimizing the geometric-error objective in camera resectioning; the supplied source does not indicate whether the claim has been proved or disproved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.