A complete visual hull representation using bounding edges

Authors:
R. Raeesi N. Mohammad;Q. M. Jonathan Wu
Affiliations:
Electrical and Computer Engineering Department, University of Windsor, ON, Canada;Electrical and Computer Engineering Department, University of Windsor, ON, Canada
Venue:
PCM'10 Proceedings of the 11th Pacific Rim conference on Advances in multimedia information processing: Part I
Year:
2010

Citing 7
Cited 0

Image-based visual hulls

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Creating and Rendering Image-Based Visual Hulls

Creating and Rendering Image-Based Visual Hulls
Visual hull construction, alignment and refinement for human kinematic modeling, motion tracking and rendering

Visual hull construction, alignment and refinement for human kinematic modeling, motion tracking and rendering
Shape-From-Silhouette Across Time Part I: Theory and Algorithms

International Journal of Computer Vision
Shape-From-Silhouette Across Time Part II: Applications to Human Modeling and Markerless Motion Tracking

International Journal of Computer Vision
Projective Visual Hulls

International Journal of Computer Vision
Polyhedral visual hulls for real-time rendering

EGWR'01 Proceedings of the 12th Eurographics conference on Rendering

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this article, a complete visual hull model is introduced. The proposed model is based on bounding edge representation which is one of the fastest visual hull models. However, the bounding edge model has fundamental drawbacks, which make it inapplicable in some environments. The proposed model produces a refined result which represents a complete triangular mesh surface of the visual hull. Further, comparison of the results by the state-of-the-art methods shows that the proposed model is faster than most of modern approaches, while the results are qualitatively as precise as theirs. Of interest is that proposed model can be computed in parallel distributively over the camera networks, while there is no bandwidth penalty for the network. Consequently, the execution time is decreased by the number of the camera nodes dramatically.