{'fraction_non_alphanumeric': 0.014066496163682864, 'fraction_numerical': 0.016624040920716114, 'mean_word_length': 4.673913043478261, '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}}
GPU Implementation of the Affine Transform for 3D Image Registration

Recent developments in 3D low-light level CCD (L3CCD) image capture have resulted in vast volumes of data being produced in real time which require image registration. The amount of data involved means that acceleration of the processing is essential. One of the key steps in one iterative registration algorithm is the application of an affine transform to all the planes of a 3D image. This paper presents details and performance results for a number of parallelized implementations of the affine transform on the NVIDIA 8800 GPU series, and shows that the transform runs 128 times faster on the GPU than a C++ version on a PC, or 54 times faster when data transfer between the GPU and the host PC is included.