Patent US5883979A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5883979A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for selecting JPEG quantization tables for low bandwidth applications

Assignee: Hewlett Packard Development Co LP
•
Filing: 1997-09-23
•
Granted: 1999-03-16
•
Expires: 2017-09-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of compressing color source image data includes forming a quantization table with a "supra-threshold" term. This method includes a step of selecting a set of target images, where each target image includes one or more image elements such as text. These image elements are then analyzed to identify those that are more important for visual quality. These "supra-threshold" terms are then selected that gives a larger weight to the quantization table elements that correspond to important image elements and a smaller weight to the table elements that correspond to less important image elements. This process selectively weights the characteristics of each DCT basis vectors. By giving larger weights to the table elements that correspond to the "up-downness" of the image, i.e., the vertical attributes of the image elements, and the "left-rightness" of the image, i.e., the horizontal attributes of the image elements, and smaller weights to the table elements corresponding to the "criss-crossedness" of the image, i.e., the diagonal attributes of the image elements, the visual quality of an image that includes text can be preserved while significantly increasing the compression ratio.

Inventors

  • 👤 Giordano Beretta
  • 👤 Vasudev Bhaskaran
  • 👤 Konstantinos Konstantinides
  • 👤 Balas K. Natarajan

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 11:46
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/46; H04N1/64; H04N1/41; H04N19/00; H04N19/10; H04N19/102; H04N19/124; H04N19/126; H04N19/60; H04N19/13; H04N19/90; H04N19/91

Claims Analysis

Total Claims: 27
Claim 1
Independent Claim 300 words
A machine for transmitting color images containing text characters, the machine comprising: a scanner configured to render a color image into color source image data representing the color image; a compression engine that compresses the source image data into compressed image data, the engine including: means for converting the source image data into transformed image data using a discrete cosine transform function, the transformed image data including one or more blocks of data (Y), each block including a plurality of data elements (Y(k,l)) corresponding to a respective transform basis vector, means for storing a multi-element quantization table, each quantization table element (Q(k,l)) corresponding to a respective transform basis vector, wherein each quantization table element (Q(k,l)) includes corresponding weighting factor (w(k,l)) that represents a number of bits allocated to encoding the quantization table element (Q(k,l)) and the value of w(k,l) is determined based on the importance of the quantization table element (Q(k,l)) in preserving elements of the text characters that enhance reading efficiency of the text, and wherein the value of w(k,l) is equal to a first predetermined value for quantization elements that correspond to transform basis vectors representing at least one of the `up-downness` and the `right-leftness` of the text characters, a second predetermined value for quantization elements that are adjacent to only one of the quantization elements having weighting factors equal to the first predetermined value, and a third predetermined value for quantization elements that are adjacent to two or more of the quantization elements having weighting factors equal to the first predetermined value, a quantizer that converts the transformed image data into quantized image data (Y Q ) in accordance with the quantization table elements, and an entropy encoder that transforms the quantized image data into the compressed image data; and means for transmitting the compressed image data.
Claim 2
Dependent Claim 300 words
A machine for transmitting color images containing text characters, the machine comprising: a scanner configured to render a color image into color source image data representing the color image; a compression engine that compresses the source image data into compressed image data, the engine including: means for converting the source image data into transformed image data using a discrete cosine transform function, the transformed image data including one or more blocks of data (Y), each block including a plurality of data elements (Y(k,l)) corresponding to a respective transform basis vector, means for storing a multi-element quantization table, each quantization table element (Q(k,l)) corresponding to a respective transform basis vector, wherein each quantization table element (Q(k,l)) includes corresponding weighting factor (w(k,l)) that represents a number of bits allocated to encoding the quantization table element (Q(k,l)) and the value of w(k,l) is determined based on the importance of the quantization table element (Q(k,l)) in preserving elements of the text characters that enhance reading efficiency of the text, and wherein the value of w(k,l) is equal to a first predetermined value for quantization elements that correspond to transform basis vectors representing at least one of the `up-downness` and the `right-leftness` of the text characters, a second predetermined value for quantization elements that are adjacent to only one of the quantization elements having weighting factors equal to the first predetermined value, and a third predetermined value for quantization elements that are adjacent to two or more of the quantization elements having weighting factors equal to the first predetermined value, a quantizer that converts the transformed image data into quantized image data (Y Q ) in accordance with the quantization table elements, and an entropy encoder that transforms the quantized image data into the compressed image data; and means for transmitting the compressed image data.
Claim 3
Dependent Claim 64 words
A machine according to claim 1 wherein the value of w(k,l) is equal to a fourth predetermined value for any quantization elements that are adjacent to those elements having the second predetermined value and wherein the value of w(k,l) is equal to a fifth predetermined value for any quantization elements not assigned the predetermined value, the second, the third, or the fourth predetermined values.
Claim 4
Dependent Claim 47 words
A machine according to claim 2 wherein the predetermined value is equal to 1, the second predetermined value is equal to 1/2, the third predetermined value is equal to 3/4, and the fourth predetermined value is equal to 1/4and the fifth predetermined value is equal to 1/8.
Claim 5
Dependent Claim 28 words
A machine according to claim 1 wherein the means for storing a multi-element quantization table includes a memory storage device having the plurality of quantization elements stored therein.
Claim 6
Dependent Claim 41 words
A machine according to claim 1 wherein the means for transmitting the compressed image data includes: means for packetizing the compressed image data according to a predetermined format; and means for transmitting the compressed image data over a predetermined electrical interface.
Claim 7
Dependent Claim 27 words
A machine according to claim 1 wherein the scanner includes a color scanner that converts a physical image into color source image data representing the physical image.
Claim 8
Dependent Claim 25 words
A machine according to claim 1 wherein the scanner includes a digital computer programmed to convert a computer displayable image into color source image data.
Claim 9
Dependent Claim 57 words
A machine according to claim 1 wherein each quantization table element (Q(k,l)) corresponds to a respective transform basis vector y(k,l) and is described by the following expression: Q(k,l)=M/ (2** N.sub.k,l) where N k ,l represents the expected number of bits allocated for the corresponding data element (Y(k,l)) and M represents the maximal range of the data element.
Claim 10
Dependent Claim 91 words
A machine according to claim 8 wherein the value of N k ,l is described by the following expression: N.sub.k,l =(1/2)×log.sub.2 (w(k,l)×V.sub.y (k,l)/D)) where w(k,l) is equal to a weighting factor that allocates more bits to the data elements that preserve the visual quality of the image and fewer bits to the data elements that do not have a significant impact on the visual quality, where V y (k,l) is equal to the variance of the Y(k,l)-th data element of the image, and D is equal to a predetermined scaling factor.
Claim 11
Dependent Claim 170 words
A quantizer for use in conjunction with a compression engine quantization table for quantizing source image data into quantized image data in accordance with a predetermined compression standard using a discrete cosine transform, the quantizer comprising: means for receiving source image data; means for storing a plurality of quantization table elements, each table element corresponding to a respective transform basis vector and being organized as an MxM matrix; each quantization table element (Q(k,l)) including: a threshold term that produces a perceptually lossless quantization of the image, a bit rate term that results in the expected value of the compressed image size being equal a predetermined size, and a supra-threshold term that produces a perceptually lossy compression of the image but where the supra-threshold term is selected to preserve critical textual elements; means for dividing a source image datum by a corresponding quantization table element to produce an integer and a fractional remainder; means for providing the integer part as a quantized image datum; and means for outputting quantized image data.
Claim 12
Dependent Claim 170 words
A quantizer for use in conjunction with a compression engine quantization table for quantizing source image data into quantized image data in accordance with a predetermined compression standard using a discrete cosine transform, the quantizer comprising: means for receiving source image data; means for storing a plurality of quantization table elements, each table element corresponding to a respective transform basis vector and being organized as an MxM matrix; each quantization table element (Q(k,l)) including: a threshold term that produces a perceptually lossless quantization of the image, a bit rate term that results in the expected value of the compressed image size being equal a predetermined size, and a supra-threshold term that produces a perceptually lossy compression of the image but where the supra-threshold term is selected to preserve critical textual elements; means for dividing a source image datum by a corresponding quantization table element to produce an integer and a fractional remainder; means for providing the integer part as a quantized image datum; and means for outputting quantized image data.
Claim 13
Dependent Claim 22 words
A quantizer according to claim 10 wherein each supra-threshold term is selected to preserve predetermined textual elements having a predetermined physical dimension.
Claim 14
Dependent Claim 21 words
A quantizer according to claim 10 wherein each supra-threshold term is selected to preserve horizontal image elements having a predetermined width.
Claim 15
Dependent Claim 35 words
A quantizer according to claim 12 wherein each supra-threshold term is selected to preserve horizontal image elements having a predetermined width by more heavily weighting quantization elements residing in a first column of the matrix.
Claim 16
Dependent Claim 21 words
A quantizer according to claim 10 wherein each supra-threshold term is selected to preserve vertical image elements having a predetermined height.
Claim 17
Dependent Claim 35 words
A quantizer according to claim 14 wherein each supra-threshold term is selected to preserve vertical image elements having a predetermined height by more heavily weighting quantization elements residing in a first row of the matrix.
Claim 18
Independent Claim 114 words
A method of quantizing source image data using a discrete cosine transform function, the method comprising: receiving source image data representing a source image; selecting a threshold term that results in perceptually lossless quantization of the image; selecting a bit rate term so that the expected value of the compressed image size equals a predetermined size; selecting a supra-threshold term that results in perceptually lossy compression but where the supra-threshold term is selected to preserve critical textual elements; combining the threshold term, the bit rate term, and the supra-threshold term to form a corresponding quantization table element; dividing each source image datum by a respective quantization table element to form a quantized image datum.
Claim 19
Independent Claim 114 words
A method of quantizing source image data using a discrete cosine transform function, the method comprising: receiving source image data representing a source image; selecting a threshold term that results in perceptually lossless quantization of the image; selecting a bit rate term so that the expected value of the compressed image size equals a predetermined size; selecting a supra-threshold term that results in perceptually lossy compression but where the supra-threshold term is selected to preserve critical textual elements; combining the threshold term, the bit rate term, and the supra-threshold term to form a corresponding quantization table element; dividing each source image datum by a respective quantization table element to form a quantized image datum.
Claim 20
Dependent Claim 82 words
A method of quantizing source image data according to claim 16 wherein the step of selecting a supra-threshold term includes: selecting a set of target images, each target image having one or more image elements; identifying image elements that enhance reading efficiency of text; and selecting a supra-threshold term that gives a larger weight to the table elements that correspond to the identified image elements and a smaller weight to the table elements that do not correspond to the identified image elements.
Claim 21
Dependent Claim 35 words
A method of quantizing source image data according to claim 17 wherein the step of selecting a supra-threshold term includes giving a larger weight to the table elements corresponding to the "up-downness" of the image.
Claim 22
Dependent Claim 35 words
A method of quantizing source image data according to claim 17 wherein the step of selecting a supra-threshold term includes giving a larger weight to table elements along a first row of the quantization table.
Claim 23
Dependent Claim 35 words
A method of quantizing source image data according to claim 17 wherein the step of selecting a supra-threshold term includes giving a larger weight to the table elements corresponding to the "left-rightness" of the image.
Claim 24
Dependent Claim 35 words
A method of quantizing source image data according to claim 17 wherein the step of selecting a supra-threshold term includes giving a larger weight to table elements along a first column of the quantization table.
Claim 25
Dependent Claim 35 words
A method of quantizing source image data according to claim 17 wherein the step of selecting a supra-threshold term includes giving a smaller weight to the table elements corresponding to the "criss-crossedness" of the image.
Claim 26
Dependent Claim 29 words
A method of quantizing source image data according to claim 17 wherein the step of identifying image elements that enhance reading efficiency of text includes identifying parts of text.
Claim 27
Dependent Claim 27 words
A method of quantizing source image data according to claim 23 wherein the step of identifying parts of text includes identifying ears, bars, stems, stresses, and serifs.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-03-15 2002-09-14 2003-03-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-03-15 2006-09-14 2007-03-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-03-15 2010-09-14 2011-03-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag