585 research outputs found

    Raster Metafile and Raster Metafile Translator

    Get PDF
    The intent is to present an effort undertaken at NASA Langley Research Center to design a generic raster image format and to develop tools for processing images prepared in this format. Both the Raster Metafile (RM) format and the Raster Metafile Translator (RMT) are addressed. This document is intended to serve a varied audience including: users wishing to display and manipulate raster image data, programmers responsible for either interfacing the RM format with other raster formats or for developing new RMT device drivers, and programmers charged with installing the software on a host platform

    R_Contrast: Rapid measurement of recognition contrast thresholds.

    Get PDF
    R_Contrast is a program for the rapid assessment of recognition contrast thresholds on the PC

    Improvements to the color quantization process

    Get PDF
    The presentation of color images on devices with limited color capabilities requires a reduction in the number of colors contained in the images. Color image quantization is the process of reducing the number of colors used in an image while maintaining its appearance as much as possible. This reduction is performed using a color image quantization algorithm. The quantization algorithm attempts to select k colors that best represent the contents of the image. The original image is then recolored using the representative colors. to improve the resulting image, a dithering process can be used in place of the recoloring.;This dissertation deals with several areas of the color image quantization process. The main objective, however, is new or improved algorithms for the production of images with a better visual quality than those produced by existing algorithms while maintaining approximately the same running time. First, a new algorithm is developed for the selection of the representative color set. The results produced by the new algorithm are better both visually and quantitatively when compared to existing algorithms. Second, a new nearest-neighbor search algorithm that is based on the Locally Sorted Search algorithm is developed to reduce the time required to map the input colors to a representative color. Finally, two modifications are made to the error-diffusion dithering technique that improve the execution time. These modifications include the use of a two-weight matrix for the distribution of the error values and the presentation of a method to parallelize the error-diffusion technique. Furthermore, the analytical results of several experiments are provided to show the effectiveness each of these additions and improvements

    Secret Key Cryptography Using Graphics Cards

    Get PDF
    One frequently cited reason for the lack of wide deployment of cryptographic protocols is the (perceived) poor performance of the algorithms they employ and their impact on the rest of the system. Although high-performance dedicated cryptographic accelerator cards have been commercially available for some time, market penetration remains low. We take a different approach, seeking to exploit {\it existing system resources,} such as Graphics Processing Units (GPUs) to accelerate cryptographic processing. We exploit the ability for GPUs to simultaneously process large quantities of pixels to offload cryptographic processing from the main processor. We demonstrate the use of GPUs for stream ciphers, which can achieve 75\% the performance of a fast CPU. We also investigate the use of GPUs for block ciphers, discuss operations that make certain ciphers unsuitable for use with a GPU, and compare the performance of an OpenGL-based implementation of AES with implementations utilizing general CPUs. In addition to offloading system resources, the ability to perform encryption and decryption within the GPU has potential applications in image processing by limiting exposure of the plaintext to within the GPU
    • …
    corecore