https://github.com/sergioragostinho/cvxpnpl

A Perspective-n-Points-and-Lines method.
https://github.com/sergioragostinho/cvxpnpl

2d-3d 2d-3d-correspondences 3d 6d 6dof 6dof-pose absolute-pose computer-vision convex convex-optimization lines points pose pose-estimation python python-3 python3 registration

Last synced: 4 months ago
JSON representation

A Perspective-n-Points-and-Lines method.

• Host: GitHub
• URL: https://github.com/sergioragostinho/cvxpnpl
• Owner: SergioRAgostinho
• License: apache-2.0
• Created: 2019-05-06T17:19:26.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2022-05-19T09:37:43.000Z (over 2 years ago)
• Last Synced: 2024-10-12T09:41:14.848Z (4 months ago)
• Topics: 2d-3d, 2d-3d-correspondences, 3d, 6d, 6dof, 6dof-pose, absolute-pose, computer-vision, convex, convex-optimization, lines, points, pose, pose-estimation, python, python-3, python3, registration
• Language: Python
• Size: 132 KB
• Stars: 74
• Watchers: 5
• Forks: 14
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# CvxPnPL

A convex Perspective-n-Points-and-Lines method.

**Title:** CvxPnPL: A Unified Convex Solution to the Absolute Pose Estimation Problem from Point and Line Correspondences

**Abstract:** We present a new convex method to estimate 3D pose from mixed combinations of 2D-3D point and line correspondences, the Perspective-n-Points-and-Lines problem (PnPL). We merge the contributions of each point and line into a unified Quadratic Constrained Quadratic Problem (QCQP) and then relax it into a Semi Definite Program (SDP) through Shor's relaxation. This makes it possible to gracefully handle mixed configurations of points and lines. Furthermore, the proposed relaxation allows us to recover a finite number of solutions under ambiguous configurations. In such cases, the 3D pose candidates are found by further enforcing geometric constraints on the solution space and then retrieving such poses from the intersections of multiple quadrics. Experiments provide results in line with the best performing state of the art methods while providing the flexibility of solving for an arbitrary number of points and lines.

**URL to the Paper:** [arXiv](https://arxiv.org/abs/1907.10545)

**License:** Apache 2.0

## Installing

The easiest way to install the package is through pip

```

pip install cvxpnpl

```

Alternatively, you can clone this repo and invoke from its root folder

```

python setup.py install

```

### SDP Solver, BLAS and LAPACK

cvxpnpl makes use of [SCS](https://github.com/cvxgrp/scs) to obtain a solution to the underlying SDP problem. SCS requires BLAS and LAPACK which can be painful to set up for Windows users. As of version 2.0.0, SCS is permanently linking with LAPACK and BLAS and it is possible that the process is now easier for Windows users as well.

## Examples

The library exposes 3 public functions: `pnp`, `pnl` and `pnpl`. You can find a couple of examples showing how to use each in the [examples folder](https://github.com/SergioRAgostinho/cvxpnpl/blob/master/examples).

## Benchmarks

A number of benchmarks were conducted in order to validate the robustness of cvxpnpl in various scenarios and compare it against other methods. Please check the dedicated [README](https://github.com/SergioRAgostinho/cvxpnpl/blob/master/benchmarks/README.md) page on the topic.