CVIVSep 16, 2024

Depth from Coupled Optical Differentiation

arXiv:2409.10725v13 citationsh-index: 2
Originality Incremental advance
AI Analysis

This work addresses the problem of efficient and robust 3D sensing for applications like robotics or imaging, though it appears incremental as it builds on existing depth-from-defocus techniques.

The paper tackles depth estimation from defocused images by introducing a method based on coupled optical derivatives, which is proven to be universal across aperture codes and robust to noise, resulting in a sensor that reduces computation to 36 FLOPOP per pixel and doubles the working range compared to previous methods.

We propose depth from coupled optical differentiation, a low-computation passive-lighting 3D sensing mechanism. It is based on our discovery that per-pixel object distance can be rigorously determined by a coupled pair of optical derivatives of a defocused image using a simple, closed-form relationship. Unlike previous depth-from-defocus (DfD) methods that leverage spatial derivatives of the image to estimate scene depths, the proposed mechanism's use of only optical derivatives makes it significantly more robust to noise. Furthermore, unlike many previous DfD algorithms with requirements on aperture code, this relationship is proved to be universal to a broad range of aperture codes. We build the first 3D sensor based on depth from coupled optical differentiation. Its optical assembly includes a deformable lens and a motorized iris, which enables dynamic adjustments to the optical power and aperture radius. The sensor captures two pairs of images: one pair with a differential change of optical power and the other with a differential change of aperture scale. From the four images, a depth and confidence map can be generated with only 36 floating point operations per output pixel (FLOPOP), more than ten times lower than the previous lowest passive-lighting depth sensing solution to our knowledge. Additionally, the depth map generated by the proposed sensor demonstrates more than twice the working range of previous DfD methods while using significantly lower computation.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes