Abstract
We propose a novel scheme to recover depth maps containing thin structures based on nonlocal-means filtering regularization. The scheme imposes a distributed smoothness constraint by relying on the assumption that pixels with similar colors are likely to belong to the same surface, and therefore can be used jointly to obtain a robust estimate of their depth. This scheme can be used to solve shape-from-X problems and we demonstrate its use in the case of depth from defocus. We cast the problem in a variational framework and solve it by linearizing the corresponding Euler-Lagrange equations. The linearized system is then inverted by using efficient numerical methods such as successive overrelaxations or more general methods such as conjugate gradient when the system is not diagonally dominant. One of the main benefits of this formulation is that it can handle the regularization of highly fragmented surfaces, which require large neighborhood structures typically difficult to solve efficiently with graph-based methods. We compare the performance of the proposed algorithm with methods recently proposed in the literature that are analogous to neighborhood filters. Finally, experimental results are shown on synthetic and real data. ©2010 IEEE.
Original language | English |
---|---|
Title of host publication | 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010 |
Pages | 1133-1140 |
Number of pages | 8 |
DOIs | |
Publication status | Published - 2010 |
Event | 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - San Francisco, CA, United States Duration: 13 Jun 2010 → 18 Jun 2010 |
Conference
Conference | 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition |
---|---|
Abbreviated title | CVPR 2010 |
Country/Territory | United States |
City | San Francisco, CA |
Period | 13/06/10 → 18/06/10 |