IP Library Granted Patent US 8,320,687
Granted Patent B2
US 8,320,687 · App. 12/701,484 · Granted Nov 27, 2012

Universal lossy compression methods

Assignee: The Board of Trustees of the Leland Stanford Junior University
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,320,687
App. No.
12/701,484
Granted
Nov 27, 2012
Kind
B2
Abstract

The present invention provides methods for universal lossy compression that provide performance at or near the rate-distortion limit and that are based on universal, implementable lossy source coding algorithms.

Claims (10)

1. A lossy data compression method, the method comprising:

receiving data from a source alphabet to be encoded, the source alphabet including one or more symbols; assigning coded bits to each symbol of the received data based on a probability distribution, wherein the probability distribution is obtained by sampling a sequence for reconstruction from a Boltzmann distribution associated with an energy function, the energy function depending on distortion between the source alphabet and the reconstruction; the energy function further depending on the reconstruction being compressible and on the desired distortion between the source alphabet and the reconstruction.

2. The method of claim 1 , further comprising: receiving compressed data, the compressed data including the coded bits representing the received data; and decoding the compressed data to recover and reconstruct each symbol of the received data based on the probability distribution.

3. The method of claim 1 , wherein assigning coded bits to each symbol of the received data based on a probability distribution comprises, at every iteration, the selection of an index I and replacement of the i-th sequence component.

4. The method of claim 1 , wherein the source alphabet is of small size.

5. The method of claim 1 , wherein the source alphabet is binary.

6. The method of claim 1 , wherein the lossy compression is sought for data for which no statistical characteristics are known.

7. The method of claim 1 , wherein the receiving/received data are still images.

8. The method of claim 1 , wherein the receiving/received data are images in motion including video and movies.

9. The method of claim 1 , wherein the receiving/received data are sounds including speech, voice and audio.

Assignments (2)
CONFIRMATORY LICENSE Recorded May 13, 2010
From: THE BOARD OF TRUSTEES OF THE LELAND STANFORD JUNIOR UNIVERSITY
To: NATIONAL SCIENCE FOUNDATION
Reel/Frame 024381/0384 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 10, 2010
From: JALALI, SHIRIN; WEISSMAN, ITSCHAK
To: THE BOARD OF TRUSTEES OF THE LELAND STANFORD JUNIOR UNIVERSITY
Reel/Frame 023920/0800 →
Continuity (2)
Provisional Application 61207018 · Feb 5, 2009
Related Publication 20100195921A1 · Aug 5, 2010