In the following you can find the source code of many implementations accompanying my blog posts. Beyond that, I uploaded my bachelor and master thesis. In one or another blog post I might write about things which are explained in more detail in one of the two theses.
- Beyond the Limits – The Usage of C++ in the Demoscene: Slides for the talk I gave together with Eivind Liland at the monthly C++ User Group Berlin meeting in May 2014
- Master thesis (2012): Development and evaluation of a real-time capable multiple hypothesis tracker
Multi-object tracking is nowadays deployed in a vast number of scientific disciplines. Even though, multi-object tracking has been researched for decades it still remains a challenging problem because of its computational complexity. The aim of this master thesis is to analyze the real-time capabilities of a modern multiple hypothesis tracker, used for tracking persons in (surveillance) videos. For this purpose all required theory is discussed first and afterwards, the implementation created in the scope of this master thesis is presented. It follows an evaluation which focuses on the speed of the implementation. Potential bottlenecks are analyzed and ideas for future optimizations are given. Supplementary, the tracking quality is analyzed and compared to the one of a global nearest neighbor tracker.
Bachelor thesis (2009): Reconstruction of depth information from images for visualization of architectural models
In this bachelor thesis a novel shape-from-shading technique called Depth Hallucination is presented. It’s supposed to make extracting depth information from 3D surfaces as easy as taking two pictures with a digital camera: one with flash and one without. The resulting depth maps are then used to visualize the facades of architectural models. To overcome certain limitations of the Depth Hallucination technique, graph cut image segmentation is used to exclude certain regions from the hallucination process.
Most of the source code below was put into the public domain by releasing it under the Creative Commons’ CC0 license. Please check the
LICENSE.txt file in the repositories for more information. Here is a summary of the CC0 license:
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of his or her rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
- Splitting an arbitrary polygon by a line: Implementation of the algorithm to split an arbitrary, simple polygon by a line, described in this post.
- Optimized binary search: Binary search implementation optimized with the look-up table technique described in this post.
- Computing OMBBs in 2D: Implementation of the Rotating Calipers method for computing oriented minimum bounding boxes as described in this blog post.
- Operator system: Implementation of low-level argument passing for the operator system described in this post.
- Spinlocks: Implementation and benchmark of various spinlock types described in a series of posts (part 1, part 2, part 3).
- Advanced Octrees 4: finding neighbor nodes: Implementation of a pointer based neighbor finding algorithm for Quadtrees, described in this post.