Projects

We present an end-to-end learnable, differentiable method for pairwise relative pose registration of RGB-D frames. Our method is robust to big camera motions thanks to a self-supervised weighting of the predicted correspondences between the frames. Given a pair of frames, our method estimates matches of points and their visibility score. A self-supervised model predicts a confidence weight for visible matches. Finally, visible matches and their weight are fed into a differentiable weighted Procrustes aligner which estimates the rigid transformation between the input frames.

Implementation of the paper “Kinect Fusion: Real-Time Dense Surface Mapping and Tracking”

In this project, I worked on the SLAM pipeline for an autonomous driving vehicle. The tools I used for this project are, ROS, C++, PCL library, Ceres Solver, and Google Cartographer.

In this project, we extended the work of Eisenberger, Zorah, Cremers, “Divergence-Free Shape Interpolation and Correspondence” 1. In their work, they present a method to calculate deformation fields between shapes embedded in $\mathbb{R}^D$.

Bachelor’s thesis Boolean Satisfiability problems (SAT) consists of finding a valid assignment (model) for a set of Boolean variables. It was the first problem proven to be NP-Complete which allowed reducing many NP-Complete problems to it.

Writing about StirHack16, the first hackathon I ever attended, brings me very good memories. In this page I will focus on the project itself, although some day I should write about the hackathon experience.