Abstract
This paper introduces a new probabilistic framework for Space Carving [9]. In this framework each voxel is assigned a probability, which is computed by comparing the likelihoods for the voxel existing and not existing. This new framework avoids many of the difficulties associated with the original Space Carving algorithm. Specifically, it does not need a global threshold parameter, and it guarantees that no holes will be carved in the model. This paper also proposes that a voxel-based thick texture is a realistic and efficient representation for scenes which contain dominant planes. The algorithm is tested using both real and synthetic data, and both qualitative and quantitative results are presented.
| Original language | English |
|---|---|
| Pages | 388-393 |
| Number of pages | 6 |
| Publication status | Published - 1 Jan 2001 |
| Externally published | Yes |
| Event | IEEE International Conference on Computer Vision 2001 - Vancouver, Canada Duration: 7 Jul 2001 → 14 Jul 2001 Conference number: 8th https://ieeexplore.ieee.org/xpl/conhome/7460/proceeding?isnumber=20293 (Proceedings) |
Conference
| Conference | IEEE International Conference on Computer Vision 2001 |
|---|---|
| Abbreviated title | ICCV 2001 |
| Country/Territory | Canada |
| City | Vancouver |
| Period | 7/07/01 → 14/07/01 |
| Internet address |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver