Paper Info
Title
Fast computation of a visual hull
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.
Year
DOI
Venue
2010
10.1007/978-3-642-19282-1_1
ACCV (4)
Keywords
Field
DocType
surface-based visual hull method,visual hull,projective space,fast computation,affine space,back-projection relation,computational cost,proposed algorithm,silhouette boundary,chain code,measurement error
Computer vision,Affine space,Visual hull,Epipolar geometry,Silhouette,Computer science,Coding (social sciences),Artificial intelligence,Projective space,Chain code,Computation
Conference
Volume
ISSN
Citations 
6495
0302-9743
2
PageRank 
References 
Authors
0.36
11
4
Name
Order
Citations
PageRank
Sujung Kim1324.98
Hee-Dong Kim2402.61
Wook-Joong Kim3488.00
Seong-Dae Kim418425.81