The Experts below are selected from a list of 21 Experts worldwide ranked by ideXlab platform

Paula J. Reitan - One of the best experts on this subject based on the ideXlab platform.

  • 3D visualization of color Image histograms
    Computer Networks and Isdn Systems, 1998
    Co-Authors: Paula J. Reitan
    Abstract:

    Color quantization is a useful method for obtaining high-quality compressed Images for storage and subsequent distribution via the World Wide Web. The first step of most color quantization techniques is to create a histogram of the colors in the Truecolor Image. The dramatic differences in time and space efficiency of various data structures used to represent Truecolor Image histograms are visually explored in 3D. Spatial subdivisions use buckets to store colors in a portion of the RGB cube. Linked lists are the typical data structure used for buckets; we propose using red-black trees and treaps. Our visualizations highlight the clustering property of spatial subdivision methods.

  • 3D Visualization of Truecolor Image Histograms
    1997
    Co-Authors: Paula J. Reitan
    Abstract:

    The dramatic differences in time and space efficiency of various data structures used to represent Truecolor Image histograms are visually explored in 3D. Spatial subdivisions use buckets to store colors in a portion of the RGB cube. Linked lists are the typical data structure used for buckets; we propose using red-black trees and treaps. Our visualizations highlight the clustering property of spatial subdivision methods

M.a. Karagodin - One of the best experts on this subject based on the ideXlab platform.

Russian Federation - One of the best experts on this subject based on the ideXlab platform.

  • for the Truecolor Image Compression Algorithm
    2005
    Co-Authors: Russian Federation
    Abstract:

    Authors suggest the new method of 2D Walsh transform calculation. This makes the Image compression algorithm orthogonal transform stage more fast and easy. This method increases the Walsh-based Image covpression algorithm speed by 30% for compression and by 60% for decompression. Compression is a source data coding process forced for decreasing of information block physical size. Obviousty, it is indispensable for transmit, keeping and processing of the large graphical data volumes. The PEG algorithm is a "de-facto" standard for Image compression. It is the loosy compression algorithm based on DCT (Discrete Cosine Transform) (l). The authors were developed the compression algorithm (Z) similar to PEG but based on 2D Walsh transform (3):

A.n. Osokin - One of the best experts on this subject based on the ideXlab platform.

Paula Reitan - One of the best experts on this subject based on the ideXlab platform.

  • Weighted Minmax Algorithm for Color Image Quantization
    1999
    Co-Authors: Paula Reitan
    Abstract:

    The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color Image quantization. A fast and effective (improves Image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique called weighted MinMax that is a hybrid between the MinMax and Linde-Buzo-Gray (LBG) algorithms is also described. The weighted MinMax algorithm incorporates activity weighting and seeks to minimize WRMSE, whereby obtaining high quality quantized Images with significantly less visual distortion than the MinMax algorithm. Key words and phrases: color Image quantization, minimizing maximum intercluster distance, nonhierarchical clustering, Image compression. 1. INTRODUCTION In color quantization a Truecolor Image is irreversibly transformed into a color-mapped Image consisting of K carefully select..