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

Multiscale coding of images

Assignee: Massachusetts Institute of Technology
•
Filing: 1989-07-11
•
Granted: 1991-01-22
•
Expires: 2009-07-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Image encoding apparatus and methods include recursively decomposing the luminance values of sequential frames into spatio-temporal spectral components, by quadrature mirror filter (QMF) processing of the luminance values. The filtered signals are subsampled, and each decomposed level of the spectral components is coded by vector quantization.

Inventors

  • 👤 Andrew B. Lippman
  • 👤 William J. Butera

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 17:05
CPC Classifications
H; H04; H04N; H04N11/00; H04N11/04; H04N11/042; H04N19/00; H04N19/10; H04N19/169; H04N19/186; H04N19/60; H04N19/61; H04N19/619; H04N19/62; H04N19/63; H04N19/90; H04N19/94

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 101 words
A method of encoding an image, the image including a plurality of frames defined by a set of chrominance and luminance values, the method comprising the steps of recursively decomposing, to at least two levels of recursion, the luminance values of sequential frames into spatio-temporal spectral components, said spatio-temporal spectral components including a plurality of spatial components and a plurality of temporal components, said decomposing step including the steps of quadrature mirror filtering signals representative of said luminance values and subsampling said filtered signals, and coding each recursively decomposed level of at least one of said spectral components by vector quantization.
Claim 2
Independent Claim 101 words
A method of encoding an image, the image including a plurality of frames defined by a set of chrominance and luminance values, the method comprising the steps of recursively decomposing, to at least two levels of recursion, the luminance values of sequential frames into spatio-temporal spectral components, said spatio-temporal spectral components including a plurality of spatial components and a plurality of temporal components, said decomposing step including the steps of quadrature mirror filtering signals representative of said luminance values and subsampling said filtered signals, and coding each recursively decomposed level of at least one of said spectral components by vector quantization.
Claim 3
Dependent Claim 28 words
The method of claim 1 wherein the step of decomposing the luminance into spectral components further comprises separating the luminance values into high and low horizontal frequency subbands.
Claim 4
Dependent Claim 28 words
The method of claim 1 wherein the step of decomposing the luminance into spectral components further comprises separating the luminance values into high and low vertical frequency subbands.
Claim 5
Dependent Claim 28 words
The method of claim 1 wherein the step of decomposing the luminance into spectral components further comprises separating the luminance values into high and low temporal frequency subbands.
Claim 6
Dependent Claim 21 words
The method of claim 1 comprising the further step of discarding at least one spectral component corresponding to diagonal image features.
Claim 7
Dependent Claim 18 words
The method of claim 1 wherein selected spectral components are transmitted without vector quantization to reduce bandwidth requirements.
Claim 8
Dependent Claim 19 words
The method of claim 1 wherein said decomposing step is executed on frame sets having at least two frames.
Claim 9
Dependent Claim 36 words
The method of claim 1 comprising the further steps of decomposing the chrominance values of sequential frames into at least two chrominance spectral components, and coding said at least two chrominance spectral components by vector quantization.
Claim 10
Dependent Claim 32 words
The method of claim 1 wherein the step of decomposing the luminance into spectral components further comprises separating the luminance values into high and low subbands for horizontal, vertical and temporal information.
Claim 11
Dependent Claim 32 words
The method of claim 9 wherein the method further comprises decomposing the subband containing low frequency horizontal, vertical and temporal information into finer high and low subbands of horizontal and vertical information.
Claim 12
Dependent Claim 60 words
The method of claim 5 comprising the further step of replacing the subband containing low frequency horizontal, low frequency vertical, and high frequency temporal information with a prediction error signal, said replacing step including the step of computing said prediction error signal by motion compensated interpolation between successive values of the subband corresponding to low horizontal, vertical and temporal information.
Claim 13
Dependent Claim 28 words
The method of claim 1 wherein said coding step includes the step of recursively constructing code tables for a given level from code tables utilized for preceding levels.
Claim 14
Dependent Claim 25 words
The method of claim 12 wherein said step of recursively constructing code tables includes the step of utilizing a different block size at each level.
Claim 15
Dependent Claim 20 words
The method of claim 12 wherein the step of constructing code tables includes the step of constructing orientation-independent code tables.
Claim 16
Dependent Claim 29 words
The method of claim 12 wherein the step of constructing code tables includes the step of controlling code table size by establishing address pointers to indirectly address code tables.
Claim 17
Dependent Claim 19 words
The method of claim 12 comprising the further step of entropy coding said code tables to reduce bandwidth requirements.
Claim 18
Dependent Claim 19 words
The method of claim 12 comprising the further step of transmitting code table update information during scene boundary periods.
Claim 19
Dependent Claim 39 words
The method of claim 17 wherein the step of transmitting code table update information includes the step of lookahead processing to determine any of scene boundaries or image sequence locations where bandwidth can be allocated to table update information.
Claim 20
Dependent Claim 107 words
Apparatus for encoding an image, the image including a plurality of frames defined by a set of chrominance and luminance values, the apparatus comprising decomposing means for recursively decomposing, to at least two levels of recursion, the luminance values of sequential frames into spatio-temporal spectral components, said spatio-temporal spectral components including a plurality of spatial components and a plurality of temporal components, said decomposing means including quadrature mirror filter means for filtering signals representative of said luminance values and subsampling means for subsampling said filtered signals, and vector quantization means for coding each recursively decomposed level of at least one of said spectral components by vector quantization.
Claim 21
Dependent Claim 107 words
Apparatus for encoding an image, the image including a plurality of frames defined by a set of chrominance and luminance values, the apparatus comprising decomposing means for recursively decomposing, to at least two levels of recursion, the luminance values of sequential frames into spatio-temporal spectral components, said spatio-temporal spectral components including a plurality of spatial components and a plurality of temporal components, said decomposing means including quadrature mirror filter means for filtering signals representative of said luminance values and subsampling means for subsampling said filtered signals, and vector quantization means for coding each recursively decomposed level of at least one of said spectral components by vector quantization.
Claim 22
Dependent Claim 23 words
Apparatus according to claim 19 wherein the decomposing means includes means for separating the luminance values into high and low horizontal frequency subbands.

References Cited (Backward Citations)

US4383272A Cited
US4743959A Cited
US4908698A Cited
US4857993A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-01-21 1994-07-23 1995-01-22 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-01-21 1998-07-23 1999-01-22 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-01-21 2002-07-23 2003-01-22 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag