Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials

DOI10.1007/s11263-018-1114-2zbMath1458.68244OpenAlexW2891254706MaRDI QIDQ2193802

Danda Pani Paudel, Cédric Demonceaux, Pascal Vasseur, Adlane Habed

Publication date: 20 August 2020

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11263-018-1114-2

zbMATH Keywords

2D-3D registrationstructure-from-motionpolynomial sum-of-squares optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Uses Software

• PHCpack
• Go-ICP
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for sums of squares of real polynomials
• A theory of minimal 3D point to 3D plane registration and its generalization
• Globally optimal estimates for geometric reconstruction problems
• Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen
• Global Optimization with Polynomials and the Problem of Moments
• Iterative Pose Computation from Line Correspondences
• Solution of the Simultaneous Pose and Correspondence Problem Using Gaussian Error Model
• Implementation techniques for geometric branch-and-bound matching methods
• Algorithm 795
• Multiple View Geometry in Computer Vision

This page was built for publication: Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials