Fast computation of a visual hull

Authors:
Sujung Kim;Hee-Dong Kim;Wook-Joong Kim;Seong-Dae Kim
Affiliations:
Department of Electrical Engineering, Korea Advanced Institute of Science and Technology, Korea;Department of Electrical Engineering, Korea Advanced Institute of Science and Technology, Korea;Department of Electrical Engineering, Korea Advanced Institute of Science and Technology, Korea;Department of Electrical Engineering, Korea Advanced Institute of Science and Technology, Korea
Venue:
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part IV
Year:
2010

Citing 10
Cited 0

Oriented projective geometry

Oriented projective geometry
Rapid octree construction from image sequences

CVGIP: Image Understanding
Image-based visual hulls

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
The Visual Hull Concept for Silhouette-Based Image Understanding

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-View Stereo Revisited

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Projective Visual Hulls

International Journal of Computer Vision
Efficient Polyhedral Modeling from Silhouettes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel high resolution real-time visual hull on GPU

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
A hybrid approach for computing visual hulls of complex objects

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two techniques for the fast computation of a visual hull without simplification are proposed. First, we tackle the most time consuming step for finding the intersections between projected rays and silhouette boundaries. We use the chain coding representation of silhouette boundaries for fast searching and computing with sub-pixel accuracy. Second, we analyze 3D-2D projection and back-projection relations and formulate them as 1D homographies. This formulation reduces computational cost and ambiguity that can be caused by measurement errors in the back-projection of 2D intersections to 3D. Furthermore, we show that the formulation is not limited to the projective space but also useful in the affine space. We generalize our techniques to an arbitrary 3D ray, so that the proposed method is directly applicable to both volume-based and surface-based visual hull methods. In our simulations, we compare the proposed algorithm with the state-of-the-art methods and show its advantages in terms of computational cost.