Search

We found 467 hits for your search of 'ALGORITHM'.
  1. Maksim Lapin

    /departments/computer-vision-and-machine-learning/people/alumni-and-former-members/maksim-lapin

    Saarbrücken, 2017. more Abstract Modern image classification methods are based on supervised learning algorithms that require labeled training data. However, only a limited amount of annotated data may be available [...] additional information and structural constraints can help improve the performance of a learning algorithm. In this thesis, we study the framework of learning using privileged information and demonstrate [...] DATE = {2017}, ABSTRACT = {Modern image classification methods are based on supervised learning algorithms that require labeled training data. However, only a limited amount of annotated data may be available

  2. Marc Habermann bestowed with Otto Hahn Medal of the Max Planck Society

    /readnews?tx_news_pi1%5Baction%5D=detail&tx_news_pi1%5Bcontroller%5D=News&tx_news_pi1%5Bnews%5D=359&cHash=3b909a9696bcfe78ec98803c83b81977

    „The prize is awarded for the development of novel GPU-parallelized optimization and deep learning algorithms for space-time coherent human performance capture and synthesis at real-time frame rates.“ Con

  3. Marek Sokolowski

    /departments/algorithms-complexity/people/current-members/marek-sokolowski

    681 9325 5719 E-mail msokolow@mpi-inf.mpg.de Research Interests graph algorithms dynamic data structures parameterized algorithms structural graph theory Publications See my DBLP . Education October 2020 [...] Research Departments Algorithms and Complexity People Marek Sokolowski Marek Sokolowski Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1

  4. Margret Keuper

    /departments/computer-vision-and-machine-learning/people/margret-keuper

    the proposed formulation is NP-hard and the branch-and-bound algorithm is too slow in practice, we propose an efficient local search algorithm for inference into resulting problems. We demonstrate versatility [...] the proposed formulation is NP-hard and the branch-and-bound algorithm is too slow in practice, we propose an efficient local search algorithm for inference into resulting problems. We demonstrate versatility [...] the proposed formulation is NP-hard and the branch-and-bound algorithm is too slow in practice, we propose an efficient local search algorithm for inference into resulting problems. We demonstrate versatility

  5. Markerless Reconstruction of Dynamic Scenes

    /news/spotlight-articles/markerless-reconstruction-of-dynamic-scenes

    captured with such systems. In our research, we have developed a new type of Performance Capture Algorithms. For the first time, it is possible to reconstruct the detailed movement, dynamic geometry, and [...] in the scene. We have been able to improve our performance capture methods in many ways. A new algorithm enables us, for the first time, to reconstruct detailed animation models (i.e., surface+skeleton) [...] of several closely interacting actors in the same scene [Figure 1]. A further milestone is a new algorithm to estimate incident illumination in arbitrary environments from multi-view video. Based on this

  6. Markerless Reconstruction of Dynamic Scenes

    /news/spotlight-articles/understanding-images-videos/markerless-reconstruction-of-dynamic-scenes

    camera The goal of our research is thus the development of new performance capture algorithms. These algorithms reconstruct detailed models of geometry, motion, and appearance of dynamic scenes from multi-view [...] methods to calibrate depth sensors, eliminate noise, and algorithmically increase the camera resolution. Furthermore, we are working on new algorithms to capture geometry models of even large scenes with such [...] Scenes Reconstruction of detailed animation models from multi-video data The development of new algorithms to reconstruct geometry and appearance models of dynamic scenes in the real world is an important

  7. Martin Bromberger

    /departments/automation-of-logic/people/martin-bromberger

    Saarbrücken, Germany Oct. 2010: finished BSc in Computer Science ; thesis title: Adapting the Simplex Algorithm for Superposition Modulo Linear Arithmetic (supervisor: Prof. Dr. Christoph Weidenbach) Mar. 2016:

  8. Martin Herold

    /departments/algorithms-complexity/people/current-members/martin-herold

    Research Departments Algorithms and Complexity People Martin Herold Martin Herold Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - 308 [...] 9325 1131 Fax +49 681 9325 1099 E-mail mherold@mpi-inf.mpg.de Research Interests Approximation Algorithms Hardness of Approximation Clustering Education 2022 - present: PhD in Computer Science at Max-