Patent application number | Description | Published |
20080298699 | METHOD AND DEVICE FOR DOWN-SAMPLING A DCT IMAGE IN THE DCT DOMAIN - A method and device that uses transform matrices to down-sample a DCT image directly in the DCT domain. The transform matrices have been selected to minimize an optimization problem which is a function of the visual quality of down-sampled images obtained using the matrices and the computational complexity associated with using the transform matrices. The transform matrices comprise a row transform matrix and a column transform matrix. A down-sampled image is produced by determining an intermediary matrix as the product of the DCT image and one of either the row transform matrix or the column transform matrix and then determining the down-sampled image as the product of the intermediary matrix and the transform matrix not already used to determine the intermediary matrix. | 12-04-2008 |
20080298700 | METHOD AND DEVICE FOR SELECTING TRANSFORM MATRICES FOR DOWN-SAMPLING DCT IMAGE USING LEARNING WITH FORGETTING ALGORITHM - Down-sampling of an image may be performed in the DCT domain. A multiple layered network is used to select transform matrices for down-sampling a DCT image of size M×N to a DCT image of size I×J. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. A learning with forgetting algorithm is used to apply a decay to the elements of the transform matrix and select a transform matrices which solve an optimization problem. The optimization problem is a function of the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method. | 12-04-2008 |
20080298701 | Method and Device for Selecting Optimal Transform Matrices for Down-sampling DCT image - Down-sampling of an image may be performed in the DCT domain. Transform matrices are obtained for down-sampling a DCT image of size M×N to a down-sampled DCT image of size I×J. The transform matrices may be used to down-sample the DCT image directly in the DCT domain. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. The transform matrices are selected by solving an optimization problem, leading to transform matrices which achieve a desired trade-off between the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method. | 12-04-2008 |
20110235932 | METHOD AND DEVICE FOR SELECTING OPTIMAL TRANSFORM MATRICES FOR DOWN-SAMPLING DCT IMAGE - Down-sampling of an image may be performed in the DCT domain. Transform matrices are obtained for down-sampling a DCT image of size M×N to a down-sampled DCT image of size I×J. The transform matrices may be used to down-sample the DCT image directly in the DCT domain. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. The transform matrices are selected by solving an optimization problem, leading to transform matrices which achieve a desired trade-off between the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method. | 09-29-2011 |
20110249722 | METHOD AND DEVICE FOR SELECTING TRANSFORM MATRICES FOR DOWN-SAMPLING DCT IMAGE USING LEARNING WITH FORGETTING ALGORITHM - Down-sampling of an image may be performed in the DCT domain. A multiple layered network is used to select transform matrices for down-sampling a DCT image of size M×N to a DCT image of size I×J. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. A learning with forgetting algorithm is used to apply a decay to the elements of the transform matrix and select a transform matrices which solve an optimization problem. The optimization problem is a function of the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method. | 10-13-2011 |
20120093428 | METHOD AND DEVICE FOR DOWN-SAMPLING A DCT IMAGE IN THE DCT DOMAIN - A method and device that uses transform matrices to down-sample a DCT image directly in the DCT domain. The transform matrices have been selected to minimize an optimization problem which is a function of the visual quality of down-sampled images obtained using the matrices and the computational complexity associated with using the transform matrices. The transform matrices comprise a row transform matrix and a column transform matrix. A down-sampled image is produced by determining an intermediary matrix as the product of the DCT image and one of either the row transform matrix or the column transform matrix and then determining the down-sampled image as the product of the intermediary matrix and the transform matrix not already used to determine the intermediary matrix. | 04-19-2012 |
20120263375 | METHOD AND DEVICE FOR SELECTING OPTIMAL TRANSFORM MATRICES FOR DOWN-SAMPLING DCT IMAGE - Down-sampling of an image may be performed in the DCT domain. Transform matrices are obtained for down-sampling a DCT image of size M×N to a down-sampled DCT image of size I×J. The transform matrices may be used to down-sample the DCT image directly in the DCT domain. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. The transform matrices are selected by solving an optimization problem, leading to transform matrices which achieve a desired trade-off between the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method. | 10-18-2012 |
Patent application number | Description | Published |
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 (104-23-2009 | |
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 |
20100238997 | METHOD AND SYSTEM FOR OPTIMIZED VIDEO CODING - A method and encoder for full rate-distortion optimization of video coding over four free parameters; namely, coding mode, motion vector, quantizer scaling factor, and transform domain coefficients. In all cases, the rate-distortion cost for each combination of the parameters is determined based on soft decision quantization; specifically, a graph-based searching algorithm that reveals the optimal quantized transform domain coefficients for encoding a macroblock or sub-block of a macroblock. The full joint optimization includes a full search of the product space defined by the possible combinations of the free parameters without approximations. Approximations and simplifications to reduce complexity are also disclosed. | 09-23-2010 |
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 |
20110122950 | VIDEO DECODER AND METHOD FOR MOTION COMPENSATION FOR OUT-OF-BOUNDARY PIXELS - Methods and systems for decoding motion compensated video. In the decoding process a virtual predicted block is defined within memory to hold the pixel values of a reference block used in motion compensation with respect to a macroblock being reconstructed. If the reference block includes out-of-boundary pixels from the reference frame, the corresponding pixels within the virtual predicted block are padded using the boundary values of the reference frame. This avoids the need to pad the entire reference frame. | 05-26-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 |
20110125506 | RATE-DISTORTION OPTIMIZATION FOR ADVANCED AUDIO CODING - A method for optimization of rate-distortion for Advanced Audio Coding (AAC). The method provides for the identification of quantized spectral coefficient sequences for optimization of rate-distortion. The method also provides joint optimization of scale factors, Huffman codebooks and quantized spectral coefficient sequences for minimization of a rate-distortion cost. The method provides an iterative rate-distortion optimization algorithm for AAC encoding. In each iteration, the method first finds the optimal scale factors and quantized spectral coefficients when Huffman codebooks are fixed, then updates Huffman codebooks and quantized spectral coefficients given the optimized scale factors. The iterations may be applied until a predetermined threshold is attained. | 05-26-2011 |
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 |
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 |
20120224780 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION WITH ITERATIVE COST FUNCTION - 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. | 09-06-2012 |
20120263392 | ARBITRARY RATIO IMAGE RESIZING IN THE DCT DOMAIN - To resize a compressed image, 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. | 10-18-2012 |
20120308129 | 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. | 12-06-2012 |
20120321183 | 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 and updating an encoded image by repeatedly (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 selected 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. | 12-20-2012 |
20130028533 | 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. | 01-31-2013 |
20130336595 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION WITH ITERATIVE COST FUNCTION - 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-19-2013 |
20140294315 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION WITH ITERATIVE COST FUNCTION - 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. | 10-02-2014 |
Patent application number | Description | Published |
20100333233 | Cottonwood Growth eIF-5A - The present invention relates to unique isoforms of eukaryotic initiation Factor 5A (“eIF-5A”): senescence-induced eIF-5A; wounding/pathogen induced eIF-5A; stress eIF-5A and growth eIF-5A, as well as polynucleotides that encode these three factors. The present invention also relates to methods involving modulating the expression of these factors. The present invention also relates to deoxyhypusine synthase (“DHS”), polynucleotides that encode DHS, and methods involving modulating the expression of DHS. | 12-30-2010 |
20110172290 | Isoforms of eIF-5A: Senescence-induced eIF5A; Wounding-induced elF-5A; Growth elF-5A; and DHS - The present invention relates to unique isoforms of eukaryotic initiation Factor 5A (“eIF-5A”): senescence-induced eIF-5A; wounding-induced eIF-5A; and growth eIF-5A, as well as polynucleotides that encode these three factors. The present invention also relates to methods involving modulating the expression of these factors. The present invention also relates to deoxyhypusine synthase (“DHS”), polynucleotides that encode DHS, and methods involving modulating the expression of DHS. | 07-14-2011 |
20110196143 | DNA Encoding a Plant Lipase, Transgenic Plants and a Method for Controlling Senescence in Plants - Regulation of expression of senescence in plants is achieved by integration of a gene or gene fragment encoding senescence-induced lipase into the plant genome in antisense orientation. The carnation and Arabidopsis genes encoding senescence-induced lipase are identified and the nucleotide sequences are used to modify senescence in transgenic plants. | 08-11-2011 |
20110288156 | Nucleic Acids, Polypetides, and Methods for Modulating Apoptosis - The present invention relates to isolated and/or purified rat apoptosis-specific eucaryotic initiation Factor-5A (eIF-5A) and deoxyhypusine synthase (DHS) nucleic acids and polypeptides. The present invention also relates to methods of modulating apoptosis using apoptosis-specific eIF-5A and DHS, and antisense oligonucleotides and expression vectors of apoptosis-specific and DHS useful in such methods. | 11-24-2011 |
20120034673 | Isolated plant deoxyhypusine synthase and nucleotides encoding same - Regulation of expression of programmed cell death, including senescence, in plants is achieved by integration of a gene or gene fragment encoding senescence-induced deoxyhypusine synthase, senescence-induced eIF-5A or both into the plant genome in antisense orientation. Plant genes encoding senescence-induced deoxyhypusine synthase and senescence-induced eIF-5A are identified and the nucleotide sequences of each, alone and in combination are used to modify senescence in transgenic plants. | 02-09-2012 |
20120064625 | Nucleic Acids, Polypeptides, Compositions, and Methods for Modulating Apoptosis - The present invention relates to isolated and/or purified rat apoptosis-specific eucaryotic initiation Factor-5A (eIF-5A) and deoxyhypusine synthase (DHS) nucleic acids and polypeptides. The present invention also relates to methods of modulating apoptosis using apoptosis-specific eIF-5A and DHS, and antisense oligonucleotides and expression vectors of apoptosis-specific eIF-5A and DHS useful in such methods. | 03-15-2012 |
20130184449 | DNA Encoding a Plant Lipase, Transgenic Plants and a Method for Controlling Senescence in Plants - Regulation of expression of senescence in plants is achieved by integration of a gene or gene fragment encoding senescence-induced lipase into the plant genome in antisense orientation. The carnation and | 07-18-2013 |
20130280770 | Transgenic Algae with Enhanced Oil Expression - The present invention provides transgenic algal cells that produce an increased amount of oil, methods of making transgenic algal cells, and methods of obtaining biofuel from the transgenic algal cells. | 10-24-2013 |
20140182014 | Isolated eIF-5A and Polynucleotides Encoding Same - The present invention relates to unique isoforms of eukaryotic initiation Factor 5A (“eIF-5A”): senescence-induced eIF-5A; wounding-induced eIF-5A; and growth eIF-5A, as well as polynucleotides that encode these three factors. The present invention also relates to methods involving modulating the expression of these factors. The present invention also relates to deoxyhypusine synthase (“DHS”), polynucleotides that encode DHS, and methods involving modulating the expression of DHS. | 06-26-2014 |
20140212969 | Nucleic Acids, Polypetides, and Methods for Modulating Apoptosis - The present invention relates to isolated and/or purified rat apoptosis-specific eucaryotic initiation Factor-5A (eIF-5A) and deoxyhypusine synthase (DHS) nucleic acids and polypeptides. The present invention also relates to methods of modulating apoptosis using apoptosis-specific eIF-5A and DHS, and antisense oligonucleotides and expression vectors of apoptosis-specific and DHS useful in such methods. | 07-31-2014 |