## Oriented Visibility for Multiview Reconstruction (2006)

Venue: | In European Conference on Computer Vision |

Citations: | 24 - 4 self |

### BibTeX

@INPROCEEDINGS{Lempitsky06orientedvisibility,

author = {Victor Lempitsky and Yuri Boykov and Denis Ivanov and D. Ivanov},

title = {Oriented Visibility for Multiview Reconstruction},

booktitle = {In European Conference on Computer Vision},

year = {2006},

pages = {226--238}

}

### Years of Citing Articles

### OpenURL

### Abstract

Visibility estimation is arguably the most di#cult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating visibility based on position and orientation of local surface patches. Using our concept of oriented visibility, we present a new algorithm for multiview reconstruction based on exact global optimization of surface photoconsistency using graph cuts on a CW-complex. In contrast to many previous methods for 3D reconstruction from arbitrary views, our method does not depend on initialization and is robust to photometrically di#cult situations.

### Citations

7102 |
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- Pearl
- 1988
(Show Context)
Citation Context ...the coordinates of its projection onto each view. Recent advances in multiview reconstruction are by far concerned with discrete optimization methods. Such methods (graph cuts [5], belief propagation =-=[12]-=-, tree-reweighted message passing [19]) allow efficient minimization of a specific class of energies that can be associated with Markov random fields (MRF). These methods do not require initialization... |

820 | An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
- Boykov, Kolmogorov
- 2004
(Show Context)
Citation Context ... configurations, the best Cconsistent configuration can be found in a low order polynomial on K time using graph cuts, recently employed for the optimization of energies in many vision problems (e.g. =-=[1, 14, 2]-=-; the last one having the most similar optimization scheme to ours). Under graph cuts, they usually mean the mincut/maxflow algorithm solving the following problem. Consider a directed graph with two ... |

709 | What Energy Functions Can Be Minimized via Graph Cuts
- Kolmogorov, Zabih
- 2004
(Show Context)
Citation Context ...do not require initialization and converge to strong minima of the energy functionals; in particular, graph cuts are able to find a globally optimal labelling for a wide class of binary-labelled MRFs =-=[10]-=-. Due to all these benefits, approaches based on discrete optimization methods are now considered as state-of-the-art for several special cases of multiview reconstruction, namely, reconstruction from... |

459 | A theory of shape by space carving
- Kutulakos, Seitz
- 1999
(Show Context)
Citation Context ...ace element one needs to know the true scene geometry and vice versa. To solve this chicken-and-egg problem, it is necessary to use some approximation of visibility. Current approaches (space carving =-=[7]-=-, level sets stereo [4]) reconstruct the scene geometry during iterative process, and at each moment of time, a point is considered visible from a viewpoint if it is not occluded with current scene co... |

330 |
Exact maximum a posteriori estimation for binary images
- Greig, Porteous, et al.
- 1989
(Show Context)
Citation Context ...s possible to determine the coordinates of its projection onto each view. Recent advances in multiview reconstruction are by far concerned with discrete optimization methods. Such methods (graph cuts =-=[5]-=-, belief propagation [12], tree-reweighted message passing [19]) allow efficient minimization of a specific class of energies that can be associated with Markov random fields (MRF). These methods do n... |

258 | Multi-camera scene reconstruction via graph cuts
- Kolmogorov, Zabih
- 2002
(Show Context)
Citation Context ...ethods are now considered as state-of-the-art for several special cases of multiview reconstruction, namely, reconstruction from a stereo pair [8], from a set of views with similar viewing directions =-=[9, 11]-=-, and from a set of views with controlled background [16].sIn this paper, we consider the most general case of multiview reconstruction, i.e. reconstruction from the views observing the scene from the... |

235 | A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
- Roy, Cox
- 1998
(Show Context)
Citation Context ... configurations, the best Cconsistent configuration can be found in a low order polynomial on K time using graph cuts, recently employed for the optimization of energies in many vision problems (e.g. =-=[1, 14, 2]-=-; the last one having the most similar optimization scheme to ours). Under graph cuts, they usually mean the mincut/maxflow algorithm solving the following problem. Consider a directed graph with two ... |

136 | Multiview stereo via volumetric graph-cuts and occlusion robust photo-consistency
- Vogiatzis, Hernandez, et al.
- 2007
(Show Context)
Citation Context ...ete optimization methods become really inefficient for such energies with long-range dependence. One possible way to get rid of long-range dependence and to apply discrete optimization is proposed in =-=[15, 17, 18]-=-. There, the reconstruction is initialized with some given-from-aside approximation, and the state-based visibility is cal− + φ X n − + −sculated based on this approximation. As the true surface is as... |

135 | MAP Estimation Via Agreement on Trees: MessagePassing and Linear Programming
- Wainwright, Jaakkola, et al.
- 2005
(Show Context)
Citation Context ... each view. Recent advances in multiview reconstruction are by far concerned with discrete optimization methods. Such methods (graph cuts [5], belief propagation [12], tree-reweighted message passing =-=[19]-=-) allow efficient minimization of a specific class of energies that can be associated with Markov random fields (MRF). These methods do not require initialization and converge to strong minima of the ... |

104 | KERIVEN R.: Complete dense stereovision using level set methods
- FAUGERAS
- 1998
(Show Context)
Citation Context ...o know the true scene geometry and vice versa. To solve this chicken-and-egg problem, it is necessary to use some approximation of visibility. Current approaches (space carving [7], level sets stereo =-=[4]-=-) reconstruct the scene geometry during iterative process, and at each moment of time, a point is considered visible from a viewpoint if it is not occluded with current scene configuration (Fig. 1-lef... |

82 | Exact Voxel Occupancy with Graph Cuts, in
- Snow, Viola, et al.
- 1999
(Show Context)
Citation Context ...ecial cases of multiview reconstruction, namely, reconstruction from a stereo pair [8], from a set of views with similar viewing directions [9, 11], and from a set of views with controlled background =-=[16]-=-.sIn this paper, we consider the most general case of multiview reconstruction, i.e. reconstruction from the views observing the scene from the arbitrarily distributed viewpoints. Only this case allow... |

51 | A surface reconstruction method using global graph cut optimization
- Paris, Sillion, et al.
- 2004
(Show Context)
Citation Context ...ethods are now considered as state-of-the-art for several special cases of multiview reconstruction, namely, reconstruction from a stereo pair [8], from a set of views with similar viewing directions =-=[9, 11]-=-, and from a set of views with controlled background [16].sIn this paper, we consider the most general case of multiview reconstruction, i.e. reconstruction from the views observing the scene from the... |

49 | Multi-View Reconstruction Using PhotoConsistency and Exact Silhouette Constraints: A Maximum Flow Formulation
- Sinha, Pollefeys
- 2005
(Show Context)
Citation Context ...ete optimization methods become really inefficient for such energies with long-range dependence. One possible way to get rid of long-range dependence and to apply discrete optimization is proposed in =-=[15, 17, 18]-=-. There, the reconstruction is initialized with some given-from-aside approximation, and the state-based visibility is cal− + φ X n − + −sculated based on this approximation. As the true surface is as... |

22 | A discrete global minimization algorithm for continuous variational prob
- Kirsanov, Gortler
- 2004
(Show Context)
Citation Context ...me positions and with some orientations more frequently then others. An interesting option for implementing this are random grids arranged in BSP-trees proposed for discrete minimal surface search in =-=[6]-=-. The second deficiency of our method is the difficulties it faces while recovering the protruding parts of objects (e.g. camel ears). This problem is, however, inherent to all minimal surface methods... |

17 | R.: Reconstructing relief surfaces
- Vogiatzis, Torr, et al.
(Show Context)
Citation Context ...ete optimization methods become really inefficient for such energies with long-range dependence. One possible way to get rid of long-range dependence and to apply discrete optimization is proposed in =-=[15, 17, 18]-=-. There, the reconstruction is initialized with some given-from-aside approximation, and the state-based visibility is cal− + φ X n − + −sculated based on this approximation. As the true surface is as... |

5 |
Minimal Surfaces for Stereo Vision
- Buehler, Gortler, et al.
(Show Context)
Citation Context ... configurations, the best Cconsistent configuration can be found in a low order polynomial on K time using graph cuts, recently employed for the optimization of energies in many vision problems (e.g. =-=[1, 14, 2]-=-; the last one having the most similar optimization scheme to ours). Under graph cuts, they usually mean the mincut/maxflow algorithm solving the following problem. Consider a directed graph with two ... |