AI Paper Atlas

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

Deterministic Consensus Maximization with Biconvex Programming

Zhipeng Cai, Tat-Jun Chin, Huu Le, David Suter

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

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 IBCO biconvex update instead of Exact Penalty or Smooth Surrogate refinement of FLRS solutionsFLRS initial solution · Homography and triangulation (NYC Library, NotreDame)consensus sizeImproved
add IBCO refinement on top of FLRS in linear regressionFLRS · Robust linear regression (synthetic)consensus relative to RANSAC: more than 11%Improved
IBCO versus Exact Penalty at low outlier ratesIBCO · Robust linear regression, outlier rate below 65%consensusNo clear effect
use IBCO with algebraic error and rank-2 SVD projectionFLRS · Fundamental matrix estimation (CMP)consensusImproved
random initialization instead of FLRS initialization for deterministic methods (ablation)EP, SS, IBCO · TriangulationconsensusHurt

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