DeepTAM: Deep Tracking and Mapping
lmb.informatik.uni-freiburg.de
lmb.informatik.uni-freiburg.de
https://github.com/magican/OpenDTAM.git
If you don't publish code your paper will have less impact. We want to test your algorithm on different data, not painstakingly reimplement it from incomplete descriptions.
There are literally thousands of papers in the field every year, you want to be accessible not baroque.
[1]: https://lmb.informatik.uni-freiburg.de/people/ummenhof/depth...
The current outlook from what I found to reconstruct such depth maps is bleak as far as speed goes, with the alternative being a drop in density/resolution too low to be useful (capturing is cheap but not free). If there is some magic based on deep learning I'd like to forgo having to split part of these algorithms to e.g. an FPGA or so (the parts that sort and arrange the patches that should be hit with brute-force number crunching), as it seems from what I understand about them that it's near-impossible to decide these arrangements efficiently on a CPU or even GPU, seeing how sparse the math and how dense/wide the branching is. (I'm considering feeding lists of to-be-compared patches to a GPU and the results back, the technique is somewhat similar to Dijkstra's algorithm for deciding in what order to compare and what starting values to use in the iterative optimization of depth and surface normals, and that branching currently takes 80% of CPU time without the actual number crunching even using vectorization, combined with GPU speed I expect two magnitudes of improvement as a minimum, and hope for closer to three)
If you know the depth of a few pixels in the image, e.g. from a sparse keypoint-based SLAM / visual-inertial odometry system, then you can do better: https://arxiv.org/pdf/1709.07492.pdf
If you already have accurate camera positions, you can use something like occupancy grid mapping or poisson reconstruction to build the mesh.