# US 10,313,704 B2 · Multilevel video compression, decompression, and display for 4K and 8K applications

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

- Number: US 10,313,704 B2
- Document ID: US10313704B2
- Status: Granted
- Kind: B2
- Application number: 15/325,066
- Filed: 2015-07-13
- Published: 2017-06-08
- Granted: 2019-06-04
- Earliest claimed: 2014-07-16
- Assignees: Yamzz IP BV
- Applicants: Yamzz IP BV
- Inventors: Angel Decegama
- Web page: https://patentgrep.com/patent/US10313704B2

## CPC

- H04N 19/85: using pre-processing or post-processing specially adapted for video compression
- G06F 17/145: {Square transforms, e.g. Hadamard, Walsh, Haar, Hough, Slant transforms}
- H04N 7/12: Systems in which the television signal is transmitted via one channel or a plurality of parallel channels, the bandwidth of each channel being less than the bandwidth of the television signal (H04N7/24 takes precedence)
- H04N 19/587: involving temporal sub-sampling or interpolation, e.g. decimation or subsequent interpolation of pictures in a video sequence
- H04N 19/59: involving spatial sub-sampling or interpolation, e.g. alteration of picture size or resolution
- H04N 19/61: in combination with predictive coding
- H04N 19/63: using sub-band based transform, e.g. wavelets
- H04N 19/82: involving filtering within a prediction loop
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments of this invention include computer-implemented methods for use of Haar wavelet transforms (HWT) to pre-process video frames that can then be compressed using a codec to produce a compressed video frame. A compressed video frame can then be transmitted, decompressed, post-processed and displayed in their original size and quality, thereby producing real-time high-quality reproduction of video sequences. Devices can implement methods of this invention and include mainframe computers, desktop computers, personal computers, laptop computers, tablet computers, wireless computers, television sets, set top boxes, cellular telephones, and computer readable media. Computer implemented steps can be easily and efficiently implemented in multicore parallel hardware architectures.

## Claims

### Claim 1

A method for producing a video image of an object, comprising the steps:
a. providing a digitized image frame of said object and storing said digitized image frame in a memory device of a computer processor;
b. providing a decimated Haar wavelet transform (WT) of said digitized image frame;
c. discarding high-frequency components of said decimated WT thereby producing a pre-processed frame according to the following steps:
i. for all rows i, store a first pixel in a first element of original frame W0(i, 0) and compute all low frequency values of HWT and store them in frames W0(i, j); and
ii. for all columns j of each frame W0(i, j), store a first pixel in a first element of frame W(0, j) and compute all low frequency values of HWT and store them in frames W(i, j);
d. pass each frame W(i, j) to the video codec;
e. compress said pre-processed frame using a video codec thereby producing a compressed video frame;
f. decompress said compressed video frame using said codec; and
g. recreate a full sized image of said frame using post-processing using low-frequency parts of the WT and the first pixel of every row and column of the original image before the WT by carrying out the following steps:
i. for all rows i of frame Wx(i, j), copy the first row to F0(0, j)=Wx(0, j);
ii. for all columns j, compute the next row F0(1,j)=2*Wx(1, j)−F0(0, j);
iii. for all columns j, compute the next row F0(2, j)=(2*Wx(2, j)+F0(1, j))/3;
iv. for all columns j, compute the next row F0(3, j)=2*Wx(2, j)−F0(2, j);
v. for all columns j, compute subsequent rows similarly;
vi. copy the first column of F0(i,j) to F(i,0), F(i,0)=F0(i,0)
vii. for all rows i of F0(i j), compute the next columns
F(i,1)=2F0(i,1)−F(i,0);
F(i,2)=2F0(i,2)+F(i,1))/3;
F(i,3)=2F0(i,2)−F(i,2);
viii. for all columns j>3, compute subsequent columns similarly; and
h. display frame F(i, j).

### Claim 2 (depends on 1)

The method of claim 1, comprising a single level frame size reduction.

### Claim 3 (depends on 2)

The method of claim 2, further comprising a second level of frame size reduction.

### Claim 4 (depends on 3)

The method of claim 3, further comprising a third level of frame size reduction.

### Claim 5 (depends on 1)

The method of claim 1, comprising a single level frame size expansion.

### Claim 6 (depends on 5)

The method of claim 5, further comprising a second level frame size expansion.

### Claim 7 (depends on 6)

The method of claim 6, further comprising a third level frame size expansion.