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

Image compression method

Assignee: Thales SA
•
Filing: 1992-08-25
•
Granted: 1994-05-17
•
Expires: 2012-08-25
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for the compression of images comprises two steps. A first step of vector quantization compresses a source image into an image of indices that is coherent in relation to the source image. A second step again compresses this image of the indices according to a prediction method using a network of multilayer neurons. Application: compression of images for their storage and transmission.

Inventors

  • 👤 Gilles Burel

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 05:22
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/002; G06N; G06N3/00; G06N3/02; G06N3/04; G06N3/0499; G06N3/08; G06N3/09; H; H03; H03M; H03M7/00; H03M7/30; H03M7/3082; H04; H04N; H04N19/00; H04N19/50; H04N19/593; H04N19/90; H04N19/94

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 217 words
A method for transmitting or storing a source image, said method using vector quantization, a prediction network, and an encoder to compress the source image, said method comprising the steps of (a) dividing the source image into blocks of pixels, (b) comparing each block with a plurality of vectors stored in a dictionary, each vector having an index, (c) replacing each block of the source image with an index of the vector in the dictionary that is closest to the block of the image to obtain a compressed image, wherein blocks from the source image with similar content are replaced by indices located close to one another in the dictionary so that the compressed image is coherent with respect to the source image, and wherein i(x,y) is the index located at column x and row y of the compressed image, (d) using a prediction network, generating a prediction i(x,y) for each index i(x,y) by receiving at an input of the prediction network a vector comprised of indices in the compressed image which are neighbors of i(x,y), (e) transmitting a prediction error of each index, i(x,y)-i(x,y), to an encoder, (f) at the encoder, encoding the prediction errors to generate encoded data, and (g) transmitting the encoded data via transmission means or storing the encoded data in storage means.
Claim 2
Independent Claim 217 words
A method for transmitting or storing a source image, said method using vector quantization, a prediction network, and an encoder to compress the source image, said method comprising the steps of (a) dividing the source image into blocks of pixels, (b) comparing each block with a plurality of vectors stored in a dictionary, each vector having an index, (c) replacing each block of the source image with an index of the vector in the dictionary that is closest to the block of the image to obtain a compressed image, wherein blocks from the source image with similar content are replaced by indices located close to one another in the dictionary so that the compressed image is coherent with respect to the source image, and wherein i(x,y) is the index located at column x and row y of the compressed image, (d) using a prediction network, generating a prediction i(x,y) for each index i(x,y) by receiving at an input of the prediction network a vector comprised of indices in the compressed image which are neighbors of i(x,y), (e) transmitting a prediction error of each index, i(x,y)-i(x,y), to an encoder, (f) at the encoder, encoding the prediction errors to generate encoded data, and (g) transmitting the encoded data via transmission means or storing the encoded data in storage means.
Claim 3
Dependent Claim 15 words
The method of claim 1 wherein said prediction network comprises a plurality of multi-layer neurons.
Claim 4
Dependent Claim 18 words
The method of claim 1 wherein said prediction errors are encoded by said encoder using a Huffman code.

References Cited (Backward Citations)

US3980809A Cited
EP0280313A2 Cited
US4797739A Cited
JPH02179166A Cited
US5048112A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-05-16 1997-11-15 1998-05-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-05-16 2001-11-15 2002-05-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-05-16 2005-11-15 2006-05-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag