# US 2015/0146993 A1 · Generalization of methods and systems for image compression while encoding at least one extra bit

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0146993 A1
- Document ID: US20150146993A1
- Status: Published application
- Kind: A1
- Application number: 14/091,188
- Filed: 2013-11-26
- Published: 2015-05-28
- Earliest claimed: 2013-11-26
- Assignees: NVIDIA Corporation
- Applicants: Nvidia Corporation
- Inventors: Walter E. DONOVAN; Marilyn J. LANG
- Web page: https://patentgrep.com/patent/US20150146993A1

## CPC

- H04N 19/90: using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- G06T 2210/08: Bandwidth reduction
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

A method for encoding at least one extra bit in an image compression and decompression system. The method includes accessing an input image, and compressing the input image into a compressed image using an encoder system, wherein said encoding system implements an algorithm for encoding at least one extra bit. The method further includes communicatively transferring the compressed image to a decoding system, and decompressing the compressed image into a resulting uncompressed image that is unaltered from said input image, wherein the algorithm for encoding enables the recovery of the at least one extra bit.

## Claims

### Claim 1

A method for encoding at least one extra bit in an image compression and decompression system, comprising:
accessing an input image;
compressing the input image into a compressed image using an encoder system, wherein said encoding system implements an algorithm for encoding at least one extra bit;
communicatively transferring the compressed image to a decoding system; and
decompressing the compressed image into a resulting uncompressed image that is unaltered from said input image, wherein the algorithm for encoding enables the recovery of the at least one extra bit.

### Claim 2 (depends on 1)

The method of claim 1, wherein said algorithm for encoding one bit comprises f(x, y) generalized using a plurality of stages, wherein each stage takes 1 bit from a previous stage and k≧1 successive bits from X and Y and computes 1 bit using a truth table, which is then passed on to a next stage.

### Claim 3 (depends on 2)

The method of claim 2, wherein identical or different truth tables can be used at each stage.

### Claim 4 (depends on 1)

The method of claim 1, wherein said algorithm for encoding one bit comprises two separate sets of truth tables and where a first function, Fn takes two 1-bit inputs and returns a 3-state output, while a second function, fn takes two 3-state inputs and returns a 3-state output, where the second function is called repeatedly on outputs of other additional second functions.

### Claim 5 (depends on 4)

The method of claim 4, wherein the 3 state output comprises 0 or 1, and where ? is associated with either 0 or 1.

### Claim 6 (depends on 1)

The method of claim 1, wherein the image compression and decompression system is lossy.

### Claim 7

A non-transitory computer readable media for encoding at least one extra bit in an image compression and decompression system, which when executed by an image compression and decompression system causes said set image compression and decompression system to implement a method, comprising:
accessing an input image;
compressing the input image into a compressed image using an encoder system, wherein said encoding system implements an algorithm for encoding at least one extra bit;
communicatively transferring the compressed image to a decoding system; and
decompressing the compressed image into a resulting uncompressed image that is unaltered from said input image, wherein the algorithm for encoding enables the recovery of the at least one extra bit.

### Claim 8 (depends on 1)

The computer readable media of claim 1, wherein said algorithm for encoding one bit comprises f(x, y) generalized using a plurality of stages, wherein each stage takes 1 bit from a previous stage and k≧1 successive bits from X and Y and computes 1 bit using a truth table, which is then passed on to a next stage.

### Claim 9 (depends on 2)

The computer readable media of claim 2, wherein identical or different truth tables can be used at each stage.

### Claim 10 (depends on 1)

The computer readable media of claim 1, wherein said algorithm for encoding one bit comprises two separate sets of truth tables and where a first function, Fn takes two 1-bit inputs and returns a 3-state output, while a second function, fn takes two 3-state inputs and returns a 3-state output, where the second function is called repeatedly on outputs of other additional second functions.

### Claim 11 (depends on 4)

The computer readable media of claim 4, wherein the 3 state output comprises 0 or 1, and where ? is associated with either 0 or 1.

### Claim 12 (depends on 1)

The computer readable media of claim 1, wherein the image compression and decompression system is lossy.

### Claim 13

A computer system, comprising:
a computer system having a processor coupled to a computer readable storage media and executing computer readable code which causes the computer system to:
access an input image;
compressed the input image into a compressed image using an encoder system, wherein said encoding system implements an algorithm for encoding at least one extra bit;
communicatively transfer the compressed image to a decoding system; and
decompress the compressed image into a resulting uncompressed image that is unaltered from said input image, wherein the algorithm for encoding enables the recovery of the at least one extra bit.

### Claim 14 (depends on 1)

The system of claim 1, wherein said algorithm for encoding one bit comprises f(x, y) generalized using a plurality of stages, wherein each stage takes 1 bit from a previous stage and k≧1 successive bits from X and Y and computes 1 bit using a truth table, which is then passed on to a next stage.

### Claim 15 (depends on 2)

The system of claim 2, wherein identical or different truth tables can be used at each stage.

### Claim 16 (depends on 1)

The system of claim 1, wherein said algorithm for encoding one bit comprises two separate sets of truth tables and where a first function, Fn takes two 1-bit inputs and returns a 3-state output, while a second function, fn takes two 3-state inputs and returns a 3-state output, where the second function is called repeatedly on outputs of other additional second functions.

### Claim 17 (depends on 4)

The system of claim 4, wherein the 3 state output comprises 0 or 1, and where ? is associated with either 0 or 1.

### Claim 18 (depends on 1)

The system of claim 1, wherein the image compression and decompression system is lossy.

### Claim 19 (depends on 13)

The computer system of claim 13, wherein the image compression and decompression system implements x<y, x<=y, x>y, and x>=y and 4 similar functions without doing an explicit subtraction.
