art pupil detection algorithms. Pupil Labs[1] is the algorithmused in the Pupil Pro eye tracker. Swirski[2] and ExCuSe[3] are taken as examples of the state-of-the-art algorithms. Isophote[4] and Gradient[5] [...] also greatly disturbs the per-formance of the examined algorithms, which is also visible in the figure. One could expect this, since all algorithms either look forlarge black blobs or strong edges, which [...] d to 80x 35pixels. Thus the performance for those algorithms remainsconstant, except for the smallest resolutions. As one can see theother algorithms all start to drop significantly in performance at some
more Abstract In this work, we introduce Scribbles for All, a label and training data generation algorithm for semantic segmentation trained on scribble labels. Training or fine-tuning semantic segmentation [...] Scribbles for All provides scribble labels for several popular segmentation datasets and provides an algorithm to automatically generate scribble labels for any dataset with dense annotations, paving the way [...] advancements in the field of weakly supervised segmentation. In addition to providing datasets and algorithm, we evaluate state-of-the-art segmentation models on our datasets and show that models trained with
MCMC-based light transport algorithm can be embedded into our framework. We empirically and theoretically prove that this embedding is superior to running the standalone algorithm. In fact, our approach will [...] MCMC-based light<br>transport algorithm can be embedded into our framework. We empirically and<br>theoretically prove that this embedding is superior to running the standalone<br>algorithm. In fact, our approach [...] MCMC-based light<br>transport algorithm can be embedded into our framework. We empirically and<br>theoretically prove that this embedding is superior to running the standalone<br>algorithm. In fact, our approach
Marvin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics [...] Quentin %A van Wijland, Ernest %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics [...] Eva %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and
European Research Council awarded Paul Strohmeier an ERC Starting Grant to research and develop algorithms to vibrate actuators in such a way that they generate sensations of movement. Congratulations! [...] „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 [...] Joël Ouaknine, director at MPI-SWS, was also awarded that prestigious status for contributions to algorithmic analysis of dynamical systems The number of Saarbrücken-based ACM fellows ist now seven, five of
non-maximum suppression (NMS), a post-processing algorithm responsible for merging all detections that belong to the same object. The de facto standard NMS algorithm is still fully hand-crafted, suspiciously
performance gains are instantaneous and the learning curve is almost flat. Algorithmic reinterpretation : More elaborate algorithms which involve substantial connectivity changes cannot be directly translated [...] Novel Abstraction : Many existing algorithmic solutions find their roots in early days of computing where the hardware of the day dictated the nature of successful algorithms. As a result, the serial nature [...] embarrassingly parallel task or require dedicated platform-specific engineering efforts for each single algorithm. Our research aims to streamline geometry processing operations from the ground up in an intuitive
computer science and technology with a focus on algorithms and their applications in a broad sense. Its research ranges from fundamental topics (algorithms and complexity, automation of logic) to a variety [...] of Warwick, UK. She joined the Algorithms and Complexity Department at the MPI for Informatics in September 2012. Her main research areas are approximation algorithms for combinatorial optimization problems [...] problems, in particular for geometric problems, and online algorithms. In 2014 Anna joined Copenhagen University, Denmark, as a postdoctoral researcher. Anke van Zuylen (2010 – 2012) Anke van Zuylen graduated
in Paris. In Kurt Mehlhorn's Group "Algorithms & Complexity" she will continue her studies on approximation algorithms, combinatorial optimization, and graph algorithms. Qianru Sun earned her PhD from Peking
Science Department at Pohang University of Science and Technology. In March 2018 she joined the Algorithms and Complexity Group of Kurt Mehlhorn. Qiuhong Ke worked as a PhD student at The University of
