A Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours Using Algebraic Surfaces

Abstract

We present a linear approach to the 3D reconstruction problem from occluding contours using algebraic surfaces. The problem of noise and missing data in the occluding contours extracted from the images leads us to this approach. Our approach is based first on the intensive use of the duality property between 3D points and tangent planes, and second on the algebraic representation of 3D surfaces by implicit polynomials of degree 2 and higher.

Cite

Text

Kang et al. "A Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours Using Algebraic Surfaces." IEEE/CVF International Conference on Computer Vision, 2001. doi:10.1109/ICCV.2001.10019

Markdown

[Kang et al. "A Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours Using Algebraic Surfaces." IEEE/CVF International Conference on Computer Vision, 2001.](https://mlanthology.org/iccv/2001/kang2001iccv-linear/) doi:10.1109/ICCV.2001.10019

BibTeX

@inproceedings{kang2001iccv-linear,
  title     = {{A Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours Using Algebraic Surfaces}},
  author    = {Kang, Kongbin and Tarel, Jean-Philippe and Fishman, Richard and Cooper, David B.},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {2001},
  pages     = {198-204},
  doi       = {10.1109/ICCV.2001.10019},
  url       = {https://mlanthology.org/iccv/2001/kang2001iccv-linear/}
}