title: Binary-space-partitioned images for resolving image-based visibility.
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.
authors.affiliation: Computer Science Department, Indiana University, Bloomington, IN 47405, USA. cwfu@cs.indiana.edu
authors.forename: Chi-Wing
authors.initials: CW
authors.lastname: Fu
authors.forename: Tien-Tsin
authors.initials: TT
authors.lastname: Wong
authors.forename: Wai-Shun
authors.initials: WS
authors.lastname: Tong
authors.forename: Chi-Keung
authors.initials: CK
authors.lastname: Tang
authors.forename: Andrew J
authors.initials: AJ
authors.lastname: Hanson
mesh_terms: D000465:Algorithms; D003196:Computer Graphics; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D009862:Online Systems; D010363:Pattern Recognition, Automated; D012815:Signal Processing, Computer-Assisted; D014584:User-Computer Interface; D014785:Vision, Ocular