| SlipStream Data Inc. Patent applications |
| Patent application number | Title | Published |
|---|
| 20120039530 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR PROVIDING ENTROPY CONSTRAINED COLOR SPLITTING FOR PALETTE IMAGES WITH COLOR-WISE SPLITTING - A method, system and computer program product for progressively encoding a digitized color image is provided. This involves: initializing a tree structure with at least one starting leaf node; determining at least one representative color for each starting leaf node; and growing the tree structure by (i) selecting a leaf node n to become a non-leaf node n linked to two new leaf nodes based on an associated achievable cost; (ii) creating the two new leaf nodes by re-allocating each color in n; (iii) determining a representative color for each of the two new leaf nodes; and (iv) encoding the index information associated with the leaf node n, the representative colors of the two new leaf nodes, and information regarding a plurality of pixels of the digitized color image corresponding to the two representative colors of the two new leaf nodes. | 02-16-2012 |
| 20120014615 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION - A sequence of n coefficients is compressed by determining a cost-determined sequence of n coefficient indices represented by a cost-determined sequence of (run, index derivative) pairs under a given quantization table and run-index derivative coding distribution, wherein each sequence of (run, index derivative) pairs defines a corresponding sequence of coefficient indices such that (i) each index in the corresponding sequence of coefficient indices is a digital number, (ii) the corresponding sequence of coefficient indices includes a plurality of values including a special value, and (iii) each (run, index derivative) pair defines a run value representing a number of consecutive indices of the special value, and an index-based value derived from a value of the index following the number of consecutive indices of the special value. This involves (a) using the given quantization table and run-index derivative coding distribution to formulate a cost function for a plurality of possible sequences of (run, index derivative) pairs; (b) applying the cost function to each possible sequence in the plurality of possible sequences of (run, index derivative) pairs to determine an associated cost; and, (c) selecting the cost-determined sequence of (run, index derivative) pairs from the plurality of possible sequences of (run, index derivative) pairs based on the associated cost of each of the plurality of possible sequences of (run, index derivative) pairs; and encoding the corresponding selected cost-determined sequence of (run, index derivative) pairs using entropy coding based on a run-index derivative coding distribution. | 01-19-2012 |
| 20110279474 | Method, System and Software Product for Color Image Encoding - The present invention relates to the compression of color image data. A combination of hard decision pixel mapping and soft decision pixel mapping is used to jointly address both quantization distortion and compression rate while maintaining low computational complexity and compatibility with standard decoders, such as, for example, the GIF/PNG decoder. | 11-17-2011 |
| 20110170771 | Method, System and Software Product for Color Image Encoding - The present invention relates to the compression of color image data. A combination of hard decision pixel mapping and soft decision pixel mapping is used to jointly address both quantization distortion and compression rate while maintaining low computational complexity and compatibility with standard decoders, such as, for example, the GIF/PNG decoder. | 07-14-2011 |
| 20110123110 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR ENTROPY CONSTRAINED COLOR SPLITTING FOR PALETTE IMAGES WITH PIXEL-WISE SPLITTING - A method, system and computer program product are provided for progressively encoding a digitized color image using a data processing system, the digitized color image being provided by assigning each of the M distinct colors to at least one pixel in the set of pixels. This involves initializing and growing the tree structure by selecting a leaf node n to become a non-leaf node n linked to two new leaf nodes based on an associated achievable cost, wherein the associated achievable cost is based on 1) a determined associated change in distortion resulting from turning the leaf node into the non-leaf node linked to the two new leaf nodes; and 2) a determined associated increase in entropy rate resulting from turning the leaf node into the non-leaf node linked to the two new leaf nodes. | 05-26-2011 |
| 20100272373 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION - A sequence of n coefficients is compressed by determining a cost-determined sequence of n coefficient indices represented by a cost-determined sequence of (run, index derivative) pairs under a given quantization table and run-index derivative coding distribution, wherein each sequence of (run, index derivative) pairs defines a corresponding sequence of coefficient indices such that (i) each index in the corresponding sequence of coefficient indices is a digital number, (ii) the corresponding sequence of coefficient indices includes a plurality of values including a special value, and (iii) each (run, index derivative) pair defines a run value representing a number of consecutive indices of the special value, and an index-based value derived from a value of the index following the number of consecutive indices of the special value. This involves (a) using the given quantization table and run-index derivative coding distribution to formulate a cost function for a plurality of possible sequences of (run, index derivative) pairs; (b) applying the cost function to each possible sequence in the plurality of possible sequences of (run, index derivative) pairs to determine an associated cost; and, (c) selecting the cost-determined sequence of (run, index derivative) pairs from the plurality of possible sequences of (run, index derivative) pairs based on the associated cost of each of the plurality of possible sequences of (run, index derivative) pairs; and encoding the corresponding selected cost-determined sequence of (run, index derivative) pairs using entropy coding based on a run-index derivative coding distribution. | 10-28-2010 |
| 20100223398 | METHOD AND APPARATUS FOR CREATING SIDE INFORMATION FROM DATA FOR USE IN INTERACTIVE COMPRESSION - A computer-implemented method of creating side information from data for use in interactive compression includes identifying constituents of the data, extracting at least one of the constituents, and retaining the extracted constituents for use as a unit of side information. | 09-02-2010 |
| 20100049850 | BROWSER-PLUGIN BASED METHOD FOR ADVANCED HTTPS DATA PROCESSING - The invention described here deals with implementing custom data processing of HTTPS based on a Browser-Plugin Method. Such custom data processing may include, but is not limited to, custom data compression, custom data encryption, data monitoring, data modification. There are two distinct methods to implement the Browser-Plugin Method for Advanced HTTPS Data Processing of the subject invention (BPAHDP). In both cases, BPAHDP provides the option of conducting custom data processing that co-exists with data compression, data encryption, or other types of data processing operations supported by the HTTP standard. Additionally, both BPAHDP methods ensure that the web-browser still implements and executes the underlying SSL/TLS channel setup and encryption operations. In both embodiments of BPAHDP, the most critical functionality is the ability to modify HTTP request/response headers and data sent over a TLS/SSL channel. In the regular HTTP case (HTTP over TCP) headers and data are sent as clear-text (i.e., as unencrypted data). Therefore, any HTTP proxy component can intercept and modify header/data as it chooses—allowing custom data processing operations (including a custom compression operation) to be implemented. For HTTPS traffic, the data leaving a web-browser is encrypted. Therefore, a proxy cannot modify encrypted data, hence the novelty of the BPAHDP methodology. Both methods require specific implementation methods that are described. In particular, both embodiments of BPAHDP require specific techniques to facilitate the use of Microsoft Internet Explorer as a BPAHDP enabled web-browser. Microsoft COM (Component Object Model) interfaces and IE's Pluggable Protocol capabilities are utilized to meet all requirements of both BPAHDP embodiments. | 02-25-2010 |
| 20090317012 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION - A method, system and computer software product for improving rate-distortion performance while remaining faithful to JPEG/MPEG syntax, involving joint optimization of Huffman tables, quantization step sizes and quantized coefficients of a JPEG/MPEG encoder. This involves finding the optimal coefficient indices in the form of (run, size) pairs. By employing an interative process including this search for optimal coefficient indices, joint improvement of run-length coding, Huffman coding and quantization table selection may be achieved. Additionally, the compression of quantized DC coefficients may also be improved using a trellis-structure. | 12-24-2009 |
| 20090220163 | METHOD AND SYSTEM FOR DECODING ENCODED IMAGES AND REDUCING THE SIZE OF SAID IMAGES - A method and system for reducing the number of mathematical operations required in the JPEG decoding process without substantially impacting the quality of the image displayed is disclosed. Embodiments provide an efficient JPEG decoding process for the purposes of displaying an image on a display smaller than the source image, for example, the screen of a handheld device. According to one aspect of the invention, this is accomplished by reducing the amount of processing required for dequantization and inverse DCT (IDCT) by effectively reducing the size of the image in the quantized, DCT domain prior to dequantization and IDCT. This can be done, for example, by discarding unnecessary DCT index rows and columns prior to dequantization and IDCT. In one embodiment, columns from the right, and rows from the bottom are discarded such that only the top left portion of the block of quantized, and DCT coefficients are processed. | 09-03-2009 |
| 20090210479 | METHOD AND APPARATUS FOR COMMUNICATING COMPRESSION STATE INFORMATION FOR INTERACTIVE COMPRESSION - A method of determining, at a mobile device, side information including compression state information. The method includes receiving, from a server, a unique side information identifier identifying a unit of side information used by the server for compressing data, determining, based on the side information identifier, if the unit of side information is resident on said device, and if the unit of side information is resident on the mobile device, loading the side information for decompressing the data. Otherwise, if the unit of side information is not resident on the mobile device, the method includes requesting the unit of side information from one of the server and another device. | 08-20-2009 |
| 20090103825 | ARBITRARY RATIO IMAGE RESIZING IN THE DCT DOMAIN - A method and system for arbitrary resizing of a compressed image in the discrete cosine transform (DCT) domain. First and second scaling parameters P and Q are determined in accordance with the block numbers L and M and the scaling ratio L/M or M/L. A non-uniform, or uneven, sampling in the DCT domain is then applied to coefficients of successive blocks in the compressed image in accordance with the scaling parameters. In an embodiment, P blocks are sampled and transformed from a given block length to |P| according to a |P|-point IDCT, while Q blocks are sampled and transformed from a given block length to |Q| according to a |Q|-point IDCT. The non-uniformly sampled and transformed pixel domain samples are then regrouped into a predetermined block size and transformed back to generate the DCT coefficient of the compressed image. The proposed method significantly reduces the computational complexity compared with other DCT domain arbitrary ratio image resizing approach. It also facilitates the practical implementations since only the fast implementations of IDCT with length N (1| 04-23-2009 | |
| 20090021403 | METHOD AND SYSTEM FOR REDUCING CONTEXTS FOR CONTEXT BASED COMPRESSION SYSTEMS - For context based compression techniques, for example Context Based YK compression, a method and system for grouping contexts from a given context model together to create a new context model that has fewer contexts, but retains acceptable compression gains compared to the context model with more contexts is provided. According to an exemplary embodiment a set of files that are correlated to the file to be compressed (hereafter called training files) are read to determine, for an initial context model, the empirical statistics of contexts and symbols. In some embodiments, this includes determining the estimated joint and conditional probabilities of the various contexts and symbols (or blocks of symbols). The initial context model is then reduced to a desired number of contexts, for example, by applying a grouping function g to the original set of contexts to obtain a new and smaller set of contexts. In some embodiments the step of applying a grouping function comprises iteratively grouping a pair of contexts together to form a grouped context, wherein each grouped context represents a local minimum based on the empirical statistics. | 01-22-2009 |
| 20080301290 | METHOD AND APPARATUS FOR MANAGEMENT OF COMMON SIDE INFORMATION - The invention is directed at a method of managing side information, used during interactive compression, common to a server and one of multiple devices. In order to manage common side information, a global common side information table including entries for the side information is maintained. The entries store characteristics of the common side information and include a reserve counter whereby entries can be reserved so that they are not erroneously deleted from the server. | 12-04-2008 |
