I have highly refined the depth map algorithm, which has helped my project with the final result a ton. The computer keys are still the worst-case scenario from what I’ve tested, but it even handles them much better than the previous method. In order to achieve such a drastic difference, I have used a correction algorithm and an infill algorithm (see previous journal where parts were black (undefined). One of the big problems with the keyboard was that it would create a halo. Bokeh is still sharp, but it is also unfocused. This caused the SML algorithm to fail and create these “rings” around the true depth. To mitigate this, the correction algorithm calculates the edge of it’s own region. If a region is thick enough (this is a constant within the code), it is marked as trustworthy. Thin ribbons will fail this test.The black parts (missing data) is solved using an infill algorithm. It uses the original photo as a guide and assumes that if two adjacent pixels have the same color, they probably belong to the same object and should have the same depth. For every unsolved pixel, it looks at it’s neighbours and calculates the “color weight” (closeness in color). If the pixel has a high color weight, it likely belongs to the same object. If it has a low color weight, it is likely something like an edge. This process is repeated 40 times to ensure the entire frame is filled.