← Back to Patent Explorer
US4797729A Expired / Lapsed US ⏱️ 0.0 years remaining

System incorporating an error tolerant picture compression algorithm

Assignee: Eastman Kodak Co
•
Filing: 1988-02-05
•
Granted: 1989-01-10
•
Expires: 2008-02-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The system and method of the present invention compresses digitized color image signals in real time with an error tolerant compression algorithm utilizing block truncation coding. The system operates upon the digitized color components Y, I and Q derived from scanning an image plane. Memory buffers, under control of an address generator, receive digitized color components and store them in a 4×4 block format. The system further subdivides each Y and I block into four 2×2 blocks. An I avg . signal is derived by averaging 4 neighboring pixels in each 2×2 block of the I image plane, and a Q avg . signal is derived by averaging the 16 pixel values forming the 4×4 block of the Q image plane. Signal compression is accomplished by representing the Y and I blocks with two values and a bitmap. Three pipelined signal channels work in parallel to real-time process the signals. The processed signals are encoded for transmission over a channel. At the channels receiver a decoder decodes the signals and a decompression circuit reconstructs the Y, I and Q signals.

Inventors

  • 👤 Yusheng T. Tsai

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 09:12
CPC Classifications
H; H04; H04N; H04N11/00; H04N11/04; H04N11/042; H04N19/00; H04N19/90; H04N19/98; H04N19/10; H04N19/102; H04N19/13; H04N19/60; H04N19/91

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 200 words
A method for processing Y, I and Q color plane image signals representing pixel values, comprising the steps of: (a) grouping the Y color image plane elements into groups of four 2×2 blocks with each element formed from the average value of 4 neighboring pixels values; (b) grouping I color image plane elements into one 2×2 block with each element formed from the average value of 4 neighboring pixels values; (c) computing an average threshold value for each Y and I block of picture elements; (d) generating a bitmap of one value for each associated picture element equal to or above the average threshold value and of another value for each picture element having a value below the average threshold value; (e) generating a Hi average signal for the picture elements associated with said one bitmap value; (f) generating a Lo average signal for the picture elements associated with said another bitmap value; (g) average all of the elements of one 4×4 group of Q color image plane elements to provide a Q avg . signal; (h) quantizing said Hi, Lo and Q avg . signals; and (i) encoding said quantized signals and said generated bitmaps for compressed signal processing.
Claim 2
Independent Claim 200 words
A method for processing Y, I and Q color plane image signals representing pixel values, comprising the steps of: (a) grouping the Y color image plane elements into groups of four 2×2 blocks with each element formed from the average value of 4 neighboring pixels values; (b) grouping I color image plane elements into one 2×2 block with each element formed from the average value of 4 neighboring pixels values; (c) computing an average threshold value for each Y and I block of picture elements; (d) generating a bitmap of one value for each associated picture element equal to or above the average threshold value and of another value for each picture element having a value below the average threshold value; (e) generating a Hi average signal for the picture elements associated with said one bitmap value; (f) generating a Lo average signal for the picture elements associated with said another bitmap value; (g) average all of the elements of one 4×4 group of Q color image plane elements to provide a Q avg . signal; (h) quantizing said Hi, Lo and Q avg . signals; and (i) encoding said quantized signals and said generated bitmaps for compressed signal processing.
Claim 3
Dependent Claim 55 words
The method of claim 1 and further comprising the steps of: I. transmitting said encoded, quantized signals, and said generated bitmaps to a decoder; II. decoding said encoded, quantized signals, and said generated bitmaps; and III. decompressing said decoded quantized signals, and said generated bitmaps to form reconstructed Y, I and Q image plane signals.
Claim 4
Dependent Claim 23 words
The method according to claim 1 wherein the signal processing for the Y, I and Q plane image signals is performed in parallel.
Claim 5
Independent Claim 135 words
A system for compressing and decompressing digitized color image signals comprising: input buffer means for receiving and storing digitized Y, I and Q image plane signals in a block format; an image compressor means having three parallel internal signal channels coupled to said input buffer means for receiving the block stored Y, I, and Q signals one per internal signal channel, and for compressing said Y, I and Q signals by block truncating in parallel; an encoder means coupled to said image compressor for encoding said compressed Y, I and Q signals for transmission; a decoder means for decoding said encoded compressed Y, I and Q signals; a transmission channel coupling said encoder to said decoder; and decompression means coupled to said decoder for decompressing the compressed digitized Y, I and Q color image signals.
Claim 6
Independent Claim 135 words
A system for compressing and decompressing digitized color image signals comprising: input buffer means for receiving and storing digitized Y, I and Q image plane signals in a block format; an image compressor means having three parallel internal signal channels coupled to said input buffer means for receiving the block stored Y, I, and Q signals one per internal signal channel, and for compressing said Y, I and Q signals by block truncating in parallel; an encoder means coupled to said image compressor for encoding said compressed Y, I and Q signals for transmission; a decoder means for decoding said encoded compressed Y, I and Q signals; a transmission channel coupling said encoder to said decoder; and decompression means coupled to said decoder for decompressing the compressed digitized Y, I and Q color image signals.
Claim 7
Dependent Claim 95 words
The system according to claim 4 wherein said input buffer means is comprised of: a pair of memory banks for each of said Y, I and Q signals; an input switching means for toggling between said pair of memory banks to fill first one bank and then the other; an output switching means for toggling between said pair of memory banks to empty filled memory banks; and an address generator means coupled to said memory banks for addressing the locations in said memory banks for storing said Y, I and Q signals in block format.
Claim 8
Dependent Claim 92 words
The system according to claim 5 wherein said address generator means is comprised of: a counter having an input for receiving a system clock signal and having multiple outputs corresponding in number to the number of binary bits forming the Y, I or Q signal on which outputs the bits corresponding to the count in the counter appear; and memory addressing means responsive to the bit count on the multiple outputs of said counter for addressing said pair of memory banks so as to fill said memory banks in a block format.
Claim 9
Dependent Claim 89 words
The system according to claim 6 wherein said counter is a 12-bit counter having outputs A 0 -A 11 ; and wherein said memory addressing means has address inputs A 0 -A 11 and wherein the outputs of said counter are connected to the address inputs of said memory addressing means as follows: ______________________________________ counter means memory addressing means ______________________________________ A.sub.0 A.sub.0 A.sub.1 A.sub.2 A.sub.2 A.sub.4 A.sub.3 A.sub.5 A.sub.4 A.sub.6 A.sub.5 A.sub.7 A.sub.6 A.sub.8 A.sub.7 A.sub.9 A.sub.8 .sub. A.sub.10 A.sub.9 .sub. A.sub.11 .sub. A.sub.10 A.sub.1 .sub. A.sub.11 A.sub.3 ______________________________________
Claim 10
Dependent Claim 278 words
The system according to claim 4 wherein said image compressor means is comprised of: a first internal signal channel for said Y signal comprising: first averaging means receiving said Y signal for providing an average valve of a block of Y signal values; first comparing means for comparing each Y signal value in a block against the provided average value so as to generate a two-level bitmap signal; second averaging means for averaging all Y signals having a value corresponding to one level of said two-level bitmap; third averaging means for averaging all Y signals having a value corresponding to the second level of said two-level bitmap; and means for quantizing the averaged signals from said second and said third averaging means; a second internal signal channel for said I signal comprising: fourth averaging means for providing an average signal representing a block of I signal values; fifth averaging means for providing an average signal representing blocks of averaged signals from said fourth averaging means; second comparing for comparing each averaging signal from said fourth averaging means against the average signal from said fifth averaging means so as to generate a two-level bitmap; sixth averaging means for averaging all average signals from said fourth averaging means having a value corresponding to one level of said two-level bitmap; seventh averaging means for averaging all average signals from said fourth averaging means having a value corresponding to the second level of said two-level bitmap; and means for quantizing the averaged signals from said sixth and said seventh averaging means; a third internal signal channel for said Q signal comprising: eighth averaging means for averaging a block of Q signal values.
Claim 11
Dependent Claim 136 words
The system according to claim 8 wherein said image compressor means is further comprised of: a first demultiplexer means having an input coupled to receive said Y signal values, said demultiplexer responsive to the two-level bitmap signal from said first comparing means for directing said Y signal values to said second averaging means or said third averaging means as a function of the level of the two-level bit map signal; and a second demultiplexer means having an input coupled to receive the provided averaging signal from said fourth averaging means, said demultiplexer responsive to the two-level bitmap signal from said second comparing means for directing the provided averaging signal from said fourth averaging means to said sixth averaging means or said seventh averaging means as a function of the level of the two-level bit map signal.
Claim 12
Dependent Claim 45 words
The system according to claim 9 wherein said eight averaging means is comprised of: an accumulator for accumulating the values of all the Q signal values corresponding to a block; and means for dividing the accumulated values by the number of values in a block.

References Cited (Backward Citations)

US3403226A Cited
US4205341A Cited
US4319267A Cited
US4672427A Cited
US4716453A Cited
US4740832A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-01-10 1992-07-11 1993-01-10 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-01-10 1996-07-11 1997-01-10 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-01-10 2000-07-11 2001-01-10 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag