IP Library Granted Patent US 11,490,102
Granted Patent B2
US 11,490,102 · App. 16/917,796 · Granted Nov 1, 2022

Resilient image compression and decompression

Inventors: Christopher J. Hillar (San Francisco, CA); Ram Mehta (San Francisco, CA); Kilian Koepsell (San Francisco, CA); Charles Garfinkle (Ottawa, CA)
Assignee: Awecom, Inc.
H04N19/33H04N11/02H04N19/423H04N19/60
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 11,490,102
App. No.
16/917,796
Granted
Nov 1, 2022
Kind
B2
Abstract

An image processing method includes selecting an image in fixed storage of a computer and loading the selected image into memory of the computer. The method further includes representing the loaded image by a processor of the computer in the memory as an initial two-dimensional array of pixel values. Thereafter, the initial two-dimensional array of pixel values may be transformed into a hierarchy of progressively axially decremented two-dimensional arrays of signs and a pair of one-dimensional values for each 2×2 array of signs amongst the decremented two-dimensional arrays of signs. Finally, each of the two-dimensional arrays of signs and each pair of one-dimensional values may be stored in the fixed storage as a compressed form of the selected image.

Claims (36)

1. An image processing method comprising:

selecting an image in fixed storage of a computer;

loading the selected image into memory of the computer;

representing the loaded image by a processor of the computer in the memory as an initial two-dimensional array of pixel values;

transforming the initial two-dimensional array of pixel values into a hierarchy of progressively axially decremented two-dimensional arrays of signs, the signs comprising either a positive indication or a negative indication, and a pair of one-dimensional values for each 2×2 array of signs amongst the decremented two-dimensional arrays of signs; and,

storing in the fixed storage each of the two-dimensional arrays of signs and each pair of one-dimensional values as a compressed form of the selected image.

2. The method of claim 1 , wherein the pixel values include at least one color intensity value.

3. The method of claim 2 , wherein each color intensity value is a combination of three eight-bit intensity values of a color space.

4. The method of claim 1 , further comprising:

loading the hierarchy into the memory of the computer; and,

generating a reconstructed two-dimensional array of pixel values from the hierarchy of progressively axially decremented two-dimensional arrays of signs and the pair of one-dimensional values for each 2×2 array of signs amongst the decremented two-dimensional arrays of sign.

5. An image processing data processing system comprising:

a host computer with memory and at least one central processing unit (CPU);

fixed storage storing an image; and,

an image processing module comprising computer program instructions executing in the memory of the computer and adapted to perform:

selecting an image in the fixed storage;

loading the selected image into the memory;

representing the loaded image in the memory by the CPU as an initial two-dimensional array of pixel values;

transforming by the CPU the initial two-dimensional array of pixel values into a hierarchy of progressively axially decremented two-dimensional arrays of signs, the signs comprising either a positive indication or a negative indication, and a pair of one-dimensional values for each 2×2 array of signs amongst the decremented two-dimensional arrays of signs; and,

storing by the CPU in the fixed storage each of the two-dimensional arrays of signs and each pair of one-dimensional values as a compressed form of the selected image.

6. The system of claim 5 , wherein the pixel values include at least one color intensity value.

7. The system of claim 6 , wherein each color intensity value is a combination of three eight-bit intensity values of a color space.

8. The system of claim 5 , further comprising:

loading the hierarchy into the memory; and,

generating by the CPU in the memory a reconstructed two-dimensional array of pixel values from the hierarchy of progressively axially decremented two-dimensional arrays of signs and the pair of one-dimensional values for each 2×2 array of signs amongst the decremented two-dimensional arrays of sign.

9. A computer program product for image processing, the computer program product including a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method including:

selecting an image in fixed storage of a computer;

loading the selected image into memory of the computer;

representing the loaded image by a processor of the computer in the memory as an initial two-dimensional array of pixel values;

transforming the initial two-dimensional array of pixel values into a hierarchy of progressively axially decremented two-dimensional arrays of signs and a pair of one-dimensional values for each 2×2 array of signs, the signs comprising either a positive indication or a negative indication, amongst the decremented two-dimensional arrays of signs; and,

storing in the fixed storage each of the two-dimensional arrays of signs and each pair of one-dimensional values as a compressed form of the selected image.

10. The computer program product of claim 9 , wherein the pixel values include at least one color intensity value.

11. The method of claim 10 , wherein each color intensity value is a combination of three eight-bit intensity values of a color space.

12. The computer program product of claim 10 , further comprising:

loading the hierarchy into the memory of the computer; and,

generating a reconstructed two-dimensional array of pixel values from the hierarchy of progressively axially decremented two-dimensional arrays of signs and the pair of one-dimensional values for each 2×2 array of signs amongst the decremented two-dimensional arrays of sign.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 15, 2024
From: AWECOM, INC.
To: HILLAR, CHRIS
Reel/Frame 066475/0858 →
Continuity (2)
Continuation 16027759 · Jul 5, 2018
Related Publication 20200336751A1 · Oct 22, 2020