Computing Visibility for Triangulated Panoramas
- A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially useful when depth information is not available, such as in the case of real-world photographs. Based on the optical flow information and the image intensity, the panorama is subdivided into variable-sized triangles, image warping is then efficiently applied on these triangles using existing graphics hardware. The visibility problem is resolved by drawing the warped triangles in a specific order. This drawing order is derived from epipolar geometry. Using this partial drawing order, a graph can be built and topological sorting is applied on the graph to obtain the complete drawing order of all triangles. We will show that the time complexity of graph construction and topological sorting are both linear to the total number of triangles.
Blending of Two Warped Panoramas
Image warped from the first node alone (holes are highlighted in green)
Drawing order of triangles in the first warped panorama
Image warped from the second panoramic node
Drawing order of triangles in the second warped panorama
Blending two warped panoramas together
AnimationThe following animations demonstrate the warping and blending result of combining two panoramas. Both animations are in QuickTime movie format.
- " Triangle-based View Interpolation Without Depth Buffering",
C. W. Fu, T. T. Wong and P. A. Heng,
Journal of Graphics Tools, Vol. 3, No. 4, 1998, pp. 13-31.
- " Binary-Space-Partitioned Images for Resolving Image-based Visibility",
C. W. Fu, T. T. Wong, W. S. Tong, C. K. Tang and A. J. Hanson,
IEEE Transactions on Visualization and Computer Graphics, Vol. 10, No. 1, January-February 2004, pp. 58-71.
Home Copyright © 1996-2012 Tien-Tsin Wong. All rights reserved.