The Euclidean distance degree formula for multiview camera resectioning
Statement
Let be the affine variety of image configurations arising from a camera and world points . For generic data, let denote the number of critical points of the squared Euclidean loss restricted to the smooth locus of . Euclidean distance degree conjecture. For all and generic ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.