Rotation averaging and strong duality
In this paper we explore the role of duality principles within the problem of rotation
averaging, a fundamental task in a wide range of computer vision applications. In its …
averaging, a fundamental task in a wide range of computer vision applications. In its …
Convex global 3d registration with lagrangian duality
The registration of 3D models by a Euclidean transformation is a fundamental task at the
core of many application in computer vision. This problem is non-convex due to the …
core of many application in computer vision. This problem is non-convex due to the …
Certifiably correct range-aided SLAM
We present the first algorithm to efficiently compute certifiably optimal solutions to range-
aided simultaneous localization and map** (RA-SLAM) problems. Robotic navigation …
aided simultaneous localization and map** (RA-SLAM) problems. Robotic navigation …
A certifiably globally optimal solution to the non-minimal relative pose problem
Finding the relative pose between two calibrated views ranks among the most fundamental
geometric vision problems. It therefore appears as somewhat a surprise that a globally …
geometric vision problems. It therefore appears as somewhat a surprise that a globally …
Safe and smooth: Certified continuous-time range-only localization
A common approach to localize a mobile robot is by measuring distances to points of known
positions, called anchors. Locating a device from distance measurements is typically posed …
positions, called anchors. Locating a device from distance measurements is typically posed …
Cartan-Sync: Fast and Global SE(d)-Synchronization
This work addresses the fundamental problem of pose graph optimization (PGO), which is
pervasive in the context of SLAM, and widely known as SE (d)-synchronization in the …
pervasive in the context of SLAM, and widely known as SE (d)-synchronization in the …
CPL-SLAM: Efficient and certifiably correct planar graph-based SLAM using the complex number representation
In this article, we consider the problem of planar graph-based simultaneous localization and
map** (SLAM) that involves both poses of the autonomous agent and positions of …
map** (SLAM) that involves both poses of the autonomous agent and positions of …
Semidefinite relaxations of truncated least-squares in robust rotation search: Tight or not
The rotation search problem aims to find a 3D rotation that best aligns a given number of
point pairs. To induce robustness against outliers for rotation search, prior work considers …
point pairs. To induce robustness against outliers for rotation search, prior work considers …
Optimal and Robust Category-Level Perception: Object Pose and Shape Estimation From 2-D and 3-D Semantic Keypoints
In this article, we consider a category-level perception problem, where one is given 2-D or 3-
D sensor data picturing an object of a given category (eg, a car) and has to reconstruct the 3 …
D sensor data picturing an object of a given category (eg, a car) and has to reconstruct the 3 …
Rotation averaging with the chordal distance: Global minimizers and strong duality
In this paper we explore the role of duality principles within the problem of rotation
averaging, a fundamental task in a wide range of applications. In its conventional form …
averaging, a fundamental task in a wide range of applications. In its conventional form …