• Jump to content
  • Jump to navigation
  • Jump to bottom of page
Simulate organization breadcrumb open Simulate organization breadcrumb close
Pattern Recognition Lab
  • FAUTo the central FAU website
  • Campo
  • UnivIS
  • Jobs
  • Map
  • Help

Pattern Recognition Lab

Navigation Navigation close
  • Overview
    • Contact
    • Directions
    Portal Overview
  • Team
    • Former PRL members
    Portal Team
  • Research
    • Research Groups
    • Research Projects
    • Pattern Recognition Blog
    • Beyond the Patterns
    • Publications
    • Research Demo Videos
    • Datasets
    • Competitions
    Portal Research
  • Teaching
    • Curriculum / Courses
    • Lecture Notes
    • Lecture Videos
    • Thesis / Projects
    • Free Machine and Deep Learning Resources
    • Free Medical Engineering Resources
    • LME Videos
    Portal Teaching
  • Lab
    • News
    • Ph.D. Gallery
    • Cooperations
    • Join the Pattern Recognition Lab
    Portal Lab
  1. Home
  2. Teaching
  3. LME Videos
  4. Invited Talks

Invited Talks

In page navigation: Teaching
  • Curriculum / Courses
  • Free Medical Engineering Resources
  • Thesis / Projects
    • “What’s wrong with these equations?”
    • Forschungs- & Hochschulpraktikum
    • Master Project
    • Thesis Guidelines (ENGLISH VERSION)
    • Thesis Guidelines (GERMAN VERSION)
  • Free Machine and Deep Learning Resources
  • LME Videos
    • Invited Talks
    • Science Talks
    • Student Works
    • CONRAD Tutorials
    • CT Reconstruction Animations
    • Interventional Medical Image Processing Summer 2016
    • Pattern Recognition Symposium Winter 2019/20

Invited Talks

A Sparse Resultant Based Method for Efficient Minimal Solvers

Presenter: Snehal Bhayani – University of Oulu (Center for Machine Vision and Signal Analysis)

Short Abstract: The idea is to model geometry problems by using minimum amount of information. Many computer algebra software can be used to solve such problems accurately and efficiently. Solving such problems is usually divided into two stages, Offline and Online. Offline stage involves the more time consuming operations that are executed once per type of problem, e.g. relative pose (stereo) for calibrated cameras can be solved from 5-point correspondences. Presented approach compares against the S.O.T.A. in terms of speed and accuracy. The underlying tools are inspired from algebraic geometry.

Published at CVPR 2020 [bibtex]:

Bhayani, Snehal, Zuzana Kukelova, and Janne Heikkila. “A sparse resultant based method for efficient minimal solvers.” In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 1770-1779. 2020.

Friedrich-Alexander-Universität
Erlangen-Nürnberg

Schlossplatz 4
91054 Erlangen
  • Login
  • Intranet
  • Imprint
  • Privacy
  • Accessibility
Up