Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay
 
conference paper

SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay

Ghasemi, Alireza  
•
Scholefield, Adam James  
•
Vetterli, Martin  
2016
2016 Ieee International Conference On Acoustics, Speech And Signal Processing Proceedings
41st IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2016)

We propose a novel camera pose estimation or perspective-n-point (PnP) algorithm, based on the idea of consistency regions and half-space intersections. Our algorithm has linear time-complexity and a squared reconstruction error that decreases at least quadratically, as the number of feature point correspondences increase. Inspired by ideas from triangulation and frame quantisation theory, we define consistent reconstruction and then present SHAPE, our proposed consistent pose estimation algorithm. We compare this algorithm with state-of-the-art pose estimation techniques in terms of accuracy and error decay rate. The experimental results verify our hypothesis on the optimal worst-case quadratic decay and demonstrate its promising performance compared to other approaches.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

icassp2016.pdf

Access type

openaccess

Size

288.04 KB

Format

Adobe PDF

Checksum (MD5)

9a26ab9e3787edd2daf44759015aa6fa

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés