This Article 
 Bibliographic References 
 Add to: 
Binary-Space-Partitioned Images for Resolving Image-Based Visibility
January-February 2004 (vol. 10 no. 1)
pp. 58-71

Abstract-We propose a novel 2D representation for 3D visibility sorting, the Binary-Space-Partitioned Image (BSPI), to accelerate real-time image-based rendering. BSPI is an efficient 2D realization of a 3D BSP tree, which is commonly used in computer graphics for time-critical visibility sorting. Since the overall structure of a BSP tree is encoded in a BSPI, traversing a BSPI is comparable to traversing the corresponding BSP tree. BSPI performs visibility sorting efficiently and accurately in the 2D image space by warping the reference image triangle-by-triangle instead of pixel-by-pixel. Multiple BSPIs can be combined to solve “disocclusion,” when an occluded portion of the scene becomes visible at a novel viewpoint. Our method is highly automatic, including a tensor voting preprocessing step that generates candidate image partition lines for BSPIs, filters the noisy input data by rejecting outliers, and interpolates missing information. Our system has been applied to a variety of real data, including stereo, motion, and range images.

[1] M. Abrash, Inside Quake: Visible-Surface Determination Dr. Dobb's Sourcebook, pp. 41-45, Jan./Feb. 1996.
[2] P.K. Agarwal, J. Erickson, and L.J. Guibas, Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 107-116, Jan. 1998.
[3] J.M. Airey, J.H. Rohlf, and F.P. Brooks, Towards Image Realism with Interactive Update Rates in Complex Virtual Building Environments ACM SIGGRAPH Special Issue 1990 Symp. Interactive 3D Graphics, pp. 41-50, 1990.
[4] D.P. Anderson, Hidden Line Elimination in Projected Grid Surfaces ACM Trans. Graphics, vol. 1, no. 4, 274-288, Oct. 1982.
[5] S. Baker, R. Szeliski, and P. Anadan, A Layered Approach to Stereo Reconstruction Proc. IEEE Computer Vision and Pattern Recognition 1998 (CVPR '98) Conf., 1998.
[6] M. De Berg, M.M. De Groot, and M.H. Overmars, Perfect Binary Space Partitions CGTA: Computational Geometry: Theory and Applications, vol. 7, pp. 81-91, Jan. 1997.
[7] W. Bouknight, A Procedure for Generation of Three-Dimensional Halftoned Computer Graphics Presentations, 1970.
[8] W. Bouknight and K. Kelly, An Algorithm for Producing Halftone Computer Graphics Presentations with Shadows and Movable Light Sources, 1970.
[9] T. Cassen, K.R. Subramanian, and Z. Michalewicz, Near-Optimal Construction of Partitioning Trees by Evolutionary Techniques Proc. Graphics Interface '95, W.A. Davis and P. Prusinkiewicz, eds., pp. 263-271, 1995.
[10] E.E. Catmull, A Subdivision Algorithm for Computer Display of Curved Surfaces PhD thesis, Dept. of Computer Science, Univ. of Utah, 1974.
[11] C.-F. Chang, G. Bishop, and A. Lastra, LDI Tree: A Hierarchical Representation for Image-Based Rendering SIGGRAPH '99 Conf. Proc., pp. 291-298, Aug. 1999.
[12] H.-M. Chen and W.-T. Wang, The Feudal Priority Algorithm on Hidden-Surface Removal Proc. SIGGRAPH '96, pp. 55-64, Aug. 1996.
[13] S.E. Chen and L. Williams, View Interpolation for Image Synthesis Computer Graphics (SIGGRAPH '93 Proc.), vol. 27, pp. 279-288, Aug. 1993.
[14] N. Chin and S. Feiner, Near Real-Time Shadow Generation Using BSP Trees SIGGRAPH '89 Conf. Proc., vol. 23, pp. 99-106, July 1989.
[15] N. Chin and S. Feiner, Fast Object-Precision Shadow Generation for Areal Light Sources Using BSP Trees Computer Graphics (1992 Symp. Interactive 3D Graphics), vol. 25, pp. 21-30, Mar. 1992.
[16] J.L.D. Comba, Kinetic Vertical Decomposition Trees PhD thesis, Dept. of Computer Science, Stanford Univ., 1999.
[17] G. Crocker, Invisibility Coherence for Faster Scan-Line Hidden Surface Algorithms SIGGRAPH '84 Conf. Proc., vol. 18, pp. 95-102, July 1984.
[18] P.E. Debevec, C.J. Taylor, and J. Malik, Modeling and Rendering Architecture from Photographs: A Hybrid Geometry- and Image-Based Approach SIGGRAPH '96 Conf. Proc., H. Rushmeier, ed., pp. 11-20, Aug. 1996.
[19] O. Faugeras and L. Robert, What Can Two Images Tell Us about a Third One? technical report, INRIA, July 1993.
[20] C.-W. Fu, T.-T. Wong, and P.-A. Heng, Computing Visibility for Triangulated Panorama Proc. 10th Eurographics Rendering Workshop, June 1999.
[21] H. Fuchs, G. Abram, and E. Grant, Near Real-Time Shade Display of Rigid Objects SIGGRAPH '83 Conf. Proc., vol. 17, pp. 65-72, July 1983.
[22] H. Fuchs, Z.M. Kedem, and B.F. Naylor, On Visible Surface Generation by A Priori Tree Structures SIGGRAPH '80 Conf. Proc., vol. 14, pp. 124-133, July 1980.
[23] T.A. Funkhouser, C.H. Séquin, and S.J. Teller, Management of Large Amounts of Data in Interactive Building Walkthroughs ACM SIGGRAPH Special Issue 1992 Symp. Interactive 3D Graphics, pp. 11-20, 1992.
[24] T.A. Funkhouser and C.H. Séquin, Adaptive Display Algorithm for Interactive Frame Rates during Visualization of Complex Virtual Environments SIGGRAPH '93 Conf. Proc., J.T. Kajiya, ed., vol. 27, pp. 247-254, Aug. 1993.
[25] L. Gaucher and G. Medioni, Accurate Motion Flow Estimation with Discontinuities Proc. Seventh Int'l Conf. Computer Vision (ICCV '99), pp. 695-702, Sept. 1999.
[26] A.S. Glassner, Space Subdivision for Fast Ray Tracing IEEE Computer Graphics and Applications, vol. 4, no. 10, pp. 15-22, Oct. 1984.
[27] S.J. Gortler, R. Grzeszczuk, R. Szeliski, and M.F. Cohen, The Lumigraph Computer Graphics Proc., Ann. Conf. Series, SIGGRAPH '96, pp. 43-54, Aug. 1996.
[28] N. Greene, Hierarchical Polygon Tiling with Coverage Masks SIGGRAPH '96 Conf. Proc., pp. 65-74, Aug. 1996.
[29] N. Greene and M. Kass, Hierarchical Z-Buffer Visibility Computer Graphics Proc., Ann. Conf. Series, pp. 231-240, 1993.
[30] J. Jia and C.-K. Tang, Texture Synthesis in the Presence of Discontinuities from Noisy Data Proc. Eurographics Rendering Workshop 2002, submitted.
[31] S. Laveau and O. Faugeras, “3-D Scene Representation as a Collection of Images,” Proc. 12th Int'l Conf. Pattern Recognition, vol. 1, pp. 689-691, 1994.
[32] M.S. Lee and G. Medioni, "Inferring Segmented Surface Description from Stereo Data," Proc. Computer Vision and Pattern Recognition, pp. 346-352,Santa Barbara, Calif., June 1998.
[33] J. Lengyel and J. Snyder, Rendering with Coherent Layers Computer Graphics Proc., Ann. Conf. Series, SIGGRAPH '97, pp. 233-242, Aug. 1997.
[34] M. Levoy and P. Hanrahan, Light Field Rendering Computer Graphics Proc., Ann. Conf. Series, SIGGRAPH '96, pp. 31-42, Aug. 1996.
[35] M. Lhuillier and L. Quan, “Image Interpolation by Joint View Triangulation,” Proc. Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 139-145, 1999.
[36] W.R. Mark and G. Bishop, Memory Access Patterns of Occlusion-Compatible 3D Image Warping Proc. 1997 Siggraph/Eurographics Workshop Graphics Hardware, pp. 35-44, Aug. 1997.
[37] M. McKenna, Worst-Case Optimal Hidden-Surface Removal ACM Trans. Graphics, vol. 6, no. 1, pp. 19-28, Jan. 1987.
[38] L. McMillan and G. Bishop, Plenoptic Modeling: An Image-Based Rendering System Computer Graphics Proc., Ann. Conf. Series, SIGGRAPH '95, pp. 39-46, Aug. 1995.
[39] L. McMillan, An Image-Based Approach to Three-Dimensional Computer Graphics PhD thesis, Dept. of Computer Science, Univ. of North Carolina at Chapel Hill, Chapel Hill, 1997.
[40] G. Medioni, M.-S. Lee, and C.-K. Tang, A Computational Framework for Feature Extraction and Segmentation. Amsterdam: Elseviers Science, 2000.
[41] K. Mulmuley, An Efficient Algorithm for Hidden Surface Removal Computer Graphics (Proc. SIGGRAPH '89), vol. 23, no. 3, pp. 379-388, July 1989.
[42] B. Naylor, J. Amanatides, and W. Thibault, Merging BSP Trees Yields Polyhedral Set Operations SIGGRAPH '90 Conf. Proc., vol. 24, pp. 115-124, Aug. 1990.
[43] B.F. Naylor, Partitioning Tree Image Representation and Generation from 3D Geometric Models Proc. Graphics Interface '92, pp. 201-212, May 1992.
[44] B.F. Naylor, Constructing Good Partitioning Trees Proc. Graphics Interface '93, pp. 181-191, May 1993.
[45] M.E. Newell, R.G. Newell, and T.L. Sancha, A Solution to the Hidden Surface Problem Proc. ACM Ann. Conf., vol. I, pp. 443-450, 1972.
[46] M.S. Paterson and F.F. Yao, Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling Discrete&Computational Geometry, vol. 5, pp. 485-503, 1990.
[47] G. Qiu and S. Sudirman, Color Image Coding, Indexing and Retrieval Using Binary Space Partitioning Tree Proc. IEEE Int'l Conf. Image Processing, Oct. 2001.
[48] H.R. Rabiee, R.L. Kashyap, and H. Radha, Multiresolution Image Compression with BSP Trees and Multi-Level Block Truncation Coding Proc. IEEE Second Int'l Conf. Image Processing, pp. 600-603, 1995.
[49] H. Radha, M. Vetterli, and R. Leonardi, Image Compression Using Binary Space Partitioning Trees IEEE Trans. Image Processing, vol. 5, no. 12, pp. 1610-1624, Dec. 1996.
[50] H. Rahda, R. Leonardi, M. Vetterli, and B.F. Naylor, Binary Space Partitioning Tree Representation of Images Visual Comm. and Image Representation, vol. 2, no. 3, pp. 201-221, Sept. 1991.
[51] G. Schaufler and M. Priglinger, Efficient Displacement Mapping by Image Warping Proc. 10th Eurographics Workshop Rendering, pp. 175-186, 1999.
[52] S. Sechrest and D.P. Greenberg, A Visible Polygon Reconstruction Algorithm ACM Trans. Graphics, vol. 1, no. 1, pp. 25-42, Jan. 1982.
[53] J. Shade, S. Gortler, L.-W. He, and R. Szeliski, Layered Depth Images SIGGRAPH '98 Conf. Proc., Ann. Conf. Series, July 1998.
[54] J. Snyder and J. Lengyel, Visibility Sorting and Compositing without Splitting for Image Layer Decomposition Proc. SIGGRAPH '98, pp. 219-230, July 1998.
[55] K.R. Subramanian and B.F. Naylor, Converting Discrete Images to Partitioning Trees IEEE Trans. Visualization and Computer Graphics, vol. 3, no. 3, pp. 273-288, July-Sept. 1997.
[56] O. Sudarsky and C. Gotsman, Output-Sensitive Visibility Algorithms for Dynamic Scenes with Applications to Virtual Reality Computer Graphics Forum, vol. 15, no. 3, pp. 249-258, Aug. 1996.
[57] C.-K. Tang, G. Medioni, and M.-S. Lee, N-Dimensional Tensor Voting, and Application to Epipolar Geometry Estimation IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 8, pp. 829-844, Aug. 2001.
[58] S. Teller and P. Hanrahan, Global Visibility Algorithms for Illumination Computations Proc. SIGGRAPH '93, pp. 239-246, Aug. 1993.
[59] S.J. Teller and C.H. Séquin, Visibility Preprocessing for Interactive Walkthroughs Computer Graphics (Proc. SIGGRAPH '91), T.W. Sederberg, ed., vol. 25, pp. 61-69, July 1991.
[60] W.-S. Tong and C.-K. Tang, First Order Tensor Voting, and Application to 3D Scale Analysis Proc. IEEE CS Conf. Computer Vision and Pattern Recognition 2001 (CVPR '01), Dec. 2001.
[61] E. Torres, Optimization of the Binary Space Partition Algorithm (BSP) for the Visualization of Dynamic Scenes Proc. Eurographics '90, pp. 507-518, Sept. 1990.
[62] J.Y.A. Wang and E. Adelson, "Layered Representation for Motion Analysis," Proc. Computer Vision and Pattern Recognition Conf., 1993.
[63] J. Warnock, A Hidden-Surface Algorithm for Computer Generated Half-Tone Pictures Technical Report TR 4-15, NTIS AD-753 671, Computer Science Dept., Univ. of Utah, 1969.
[64] G.S. Watkins, A Real-Time Visible Surface Algorithm Technical Report UTECH-CSc-70-101, Salt Lake City, Utah, 1970.
[65] C. Wylie, G. Romney, D. Evans, and A. Erdahl, Half-Tone Perspective Drawings by Computer Proc. AFIPS 1967 FJCC, vol. 31, pp. 49-58, 1967.
[66] H. Zhang, D. Manocha, T. Hudson, and K.E. Hoff III, Visibility Culling Using Hierarchical Occlusion Maps Proc. SIGGRAPH '97, pp. 77-88, Aug. 1997.

Index Terms:
Visibility sorting, binary space partitioning, image-based rendering, segmentation.
Chi-Wing Fu, Tien-Tsin Wong, Wai-Shun Tong, Chi-Keung Tang, Andrew J. Hanson, "Binary-Space-Partitioned Images for Resolving Image-Based Visibility," IEEE Transactions on Visualization and Computer Graphics, vol. 10, no. 1, pp. 58-71, Jan.-Feb. 2004, doi:10.1109/TVCG.2004.1260758
Usage of this product signifies your acceptance of the Terms of Use.