Accelerated Backward Warping

In this paper a plane-based backward warping algorithm is proposed to generate novel viwews from multiple reference images.First.depth information is employed to reconstruct space planes from individual refernce images and calculate the potential occluding relationship between these planes.Then the planes which represent each identical space plane from different reference images are compared with each other to decide the one with the best sample rate to be preserved and used in the later warping period while the other samples are abandoned.While the image of a novel view is produced,traditional methods in computer graphics,such as visibility test.and clipping,are used to process the planes reconstructed.Then the planes processed are projected onto the desired image form the knowledge on which plane the desired image pixels are warped from can be acquired.Finally,pixels‘ depth of the desired image is calculated and then a ackwared warping is performed from these pixels to the reference images to obtain their colors.The storage requirement in the algorithm is small and increases slowly with the number of reference images increases.By combining the strategy of only preserving the best sample parts and the backward warping algorithm ,the sample problem could be well tackled.

Accelerated backward warping

In this paper a plane-based backward warping algorithm is proposed to generate novel views from multiple reference images. First, depth information is employed to reconstruct space planes from individual reference images and calculate the potential occluding relationship between these planes. Then the planes which represent each identical space plane from different reference images are compared with each other to decide the one with the best sample rate to be preserved and used in the later warping period while the other samples are abandoned. While the image of a novel view is produced, traditional methods in computer graphics, such as visibility test and clipping, are used to process the planes reconstructed. Then the planes processed are projected onto the desired image from the knowledge on which plane the desired image pixels are warped from can be acquired. Finally, pixels' depth of the desired image is calculated and then a backward warping is performed from these pixels to the reference images to obtain their colors. The storage requirement in the algorithm is small and increases slowly with the number of reference images increases. By combining the strategy of only preserving the best sample parts and the backward warping algorithm, the sample problem could be well tackled.