AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Rotation Averaging and Strong Duality

CVPR 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Globally optimal geometric optimization · 99 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed block coordinate descent algorithm instead of SeDuMiRotation averaging · Synthetic cycle graphs, n=20–200 and σ=0.2 or 0.5 radtime [s]: 0.501 -> 0.028; 0.553 -> 0.023; 5.91 -> 0.17; 6.32 -> 0.33; 47.0 -> 8.89; 49.51 -> 7.97; 419.04 -> 17.01; 391.23 -> 29.4Helped
Use the proposed block coordinate descent algorithm instead of SeDuMiRotation averaging · Gustavus, Sphinx, Alcatraz, Pumpkin, Buddhatime [s]: 8.28 -> 3.25; 14.40 -> 3.87; 117.19 -> 12.73; 688.65 -> 9.23; 1765.72 -> 16.71Helped
Use LM instead of the proposed algorithm or SeDuMiRotation averaging · Synthetic cycle graphsglobal optimum reached: 30-70%Mixed
Apply the theorem's residual bound as a certificateRotation averaging · Five real-world datasetsstrong-duality certificate coverageMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy