{'fraction_non_alphanumeric': 0.019464720194647202, 'fraction_numerical': 0.0, 'mean_word_length': 5.5638297872340425, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimizing an inverse warper

Traditionally, in the field of computer graphics, three-dimensional objects and scenes have been represented by geometric models. Image-based rendering is a powerful new approach to computer graphics in which two-dimensional images, rather than threedimensional models, act as the underlying scene representation. Warping is an image-based rendering method in which the points in a reference image are mapped to their corresponding locations in a desired image. Inverse warping is a displaydriven approach to warping. An inverse warping algorithm first constructs a continuous representation of a reference image. Then, it maps reference-image points to desiredimage points by sampling the continuous reference image with rays sent out from the desired image. Inverse warping has major advantages over forward warping methods in image recon struction and warping from multiple reference images, but implementations of the algo rithm have proved to be very slow. This paper presents two optimizations for inverse warping -a hierarchical implementation and an improved clipping method -that improve inverse warping's performance dramatically. Thesis Supervisor: Leonard McMillan Title: Assistant Professor