IP Library Granted Patent US 7,164,369
Granted Patent B2
US 7,164,369 · App. 09/885,320 · Granted Jan 16, 2007

System for improving storage efficiency of digital files

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 7,164,369
App. No.
09/885,320
Granted
Jan 16, 2007
Kind
B2
Abstract

Data is partitioned and processed along a bit plane that includes symbols holding a particular place in the ordered symbol sequences of digital information to achieve efficient compression and reduce processing complexity.

Claims (10)

1. A method of compressing a digital image having a plurality of pixels, each of said plurality of pixels represented by a sequence including three ordered symbols, said method comprising:

(a) organizing a plurality of said symbols into a first bit plane, each said symbol in said first bit plane occupying the same position in a respective sequence of ordered symbols for a pixel, wherein said first bit plane represents the most significant bit;

(b) organizing a plurality of said symbols into a second bit plane, each said symbol in said second bit plane occupying the same position in a respective sequence of ordered symbols for a pixel;

(c) organizing a plurality of said symbols into a third bit plane, each said symbol in said third bit plane occupying the same position in a respective sequence of ordered symbols for a pixel;

(d) compressing said image by compressing said first bit plane;

(e) compressing said image by compressing said second and third bit planes together as a group, wherein said first bit plane is compressed separate from the combination of said second and third bit planes, wherein said compressed first bit plane has a lower degree of loss than said compressed second and third bit planes.

2. The method of claim 1 where said bit plane is compressed using a lossless compression algorithm.

3. The method of claim 2 where said algorithm is a Huffman encoding scheme.

4. The method of claim 2 where said algorithm is a run length encoding scheme.

5. The method of claim 1 where compression of said bit plane reduces the number of symbols in said bit plane.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 13, 2007
From: SHARP LABORATORIES OF AMERICA, INC.
To: SHARP KABUSHIKI KAISHA
Reel/Frame 019419/0551 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 19, 2001
From: GAEBEL, GARY; LEVIN, BURTON; NGUYEN, UOC
To: SHARP LABORATORIES OF AMERICA, INC.
Reel/Frame 011924/0146 →