Large occlusion completion using normal maps

Dense disparity maps can be computed from wide-baseline stereo pairs but will inevitably contain large areas where the depth cannot be estimated accurately because the pixels are seen in one view only. A traditional approach to this problem is to introduce a global optimization scheme to fill-in the missing information by enforcing spatial-consistency, which usually means introducing a geometric regularization term that promotes smoothness. The world, however, is not necessarily smooth and we argue that a better approach is to monocularly estimate the surface normals and to use them to supply the required constraints. We will show that, even though the estimates are very rough, we nevertheless obtain more accurate depth-maps than by enforcing smoothness. Furthermore, this can be done effectively by solving large but sparse linear systems.

Présenté à:
Asian Conference on Computer Vision, Queenstown, New Zealand, November 8-12, 2010

 Notice créée le 2011-03-03, modifiée le 2019-02-13

Publisher's version:
Télécharger le documentPDF
Lien externe:
Télécharger le documentURL
Évaluer ce document:

Rate this document:
(Pas encore évalué)