# US 2014/0192866 A1 · Data Remapping for Predictive Video Coding

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

- Number: US 2014/0192866 A1
- Document ID: US20140192866A1
- Status: Published application
- Kind: A1
- Application number: 14/035,391
- Filed: 2013-09-24
- Published: 2014-07-10
- Earliest claimed: 2013-01-09
- Assignees: Mitsubishi Electric Research Laboratories, Inc.
- Applicants: Mitsubishi Electric Research Laboratories, Inc.
- Inventors: Robert A. Cohen; Anthony Vetro
- Web page: https://patentgrep.com/patent/US20140192866A1

## CPC

- H04N 19/146: Data rate or code amount at the encoder output
- H04N 19/117: Filters, e.g. for pre-processing or post-processing (sub-band filter banks H04N19/635)
- H04N 19/14: Coding unit complexity, e.g. amount of activity or edge presence estimation (H04N19/146 takes precedence)
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/593: involving spatial prediction techniques
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Specifically, a method decodes a picture. The picture is encoded and represented by blocks in a bitstream. For each block, a remap flag is obtained from the bit-stream. The block is either a remapped reconstructed block or a non-remapped reconstructed block. Either the non-mapped reconstructed block or an inverse remapped reconstructed block is output according to the remap flag. The remapped reconstructed block maximizes a similarity with the neighboring blocks, as compared to the similarity of the non-mapped reconstructed block and the neighboring blocks, by applying point operations to the remapped reconstructed block.

## Claims

### Claim 1

A method for decoding a picture, wherein the picture is encoded and represented by blocks in a bitstream, comprising the steps of:
obtaining, for each block, a remap flag from the bit-stream, Wherein the block is either a remapped reconstructed block or a non-remapped reconstructed block; and
selecting, either the non-mapped reconstructed block, or an inverse remapped reconstructed block as a reconstructed block according to the rump flag, wherein the remapped reconstructed block maximized a similarity with neighboring blocks, as compared to the similarity of the non-mapped reconstructed block and the neighboring blocks, by applying point operations to the remapped it reconstructed block, wherein the steps are performed in a decoder.

### Claim 2

The method of claim. 1, wherein the point operation minimizes a coding cost based on predictions from pixels in the neighboring blocks.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
determining the reconstructed block by combining a prediction residual block with a set of previously reconstructed blocks;
inverse remapping the reconstructed block to produce the inverse remapped reconstructed block; and
storing the inverse remapped reconstructed block for subsequent use by a prediction process.

### Claim 4 (depends on 1)

The method of claim 1, wherein the inverse remapped reconstructed block is always used as the reconstructed block.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
combining the set of previously reconstructed blocks and the remapped reconstructed block to determine a type of inverse remapping to perform.

### Claim 6 (depends on 5)

The method of claim 5, wherein the set of previously reconstructed blocks is used to determine the type.

### Claim 7 (depends on 5)

The method of claim 5, wherein the remapped reconstructed block is used t determine the type.

### Claim 8 (depends on 1)

The method of claim 1, wherein the selecting depends on other coding modes.

### Claim 9 (depends on 1)

The method of claim 1, wherein the inverse remapping subtracts pixels in the remapped reconstructed block from a constant value.

### Claim 10 (depends on 9)

The method of claim 9, wherein the constant value is a maximal possible intensity of the pixels in the picture.

### Claim 11 (depends on 9)

The method of claim 9, wherein the constant value is based on a number of bits used to represent the pixels.

### Claim 12 (depends on 1)

The method of claim 1, wherein the inverse remapping is a rotation, flipping, or other rearrangement of pixels in the block.

### Claim 13 (depends on 1)

The method of claim 1, further comprising:
remapping an input block of an input video to form a remapped block;
selecting the remapped block and the input block as input for a difference calculation; and
subtracting a prediction block to determine a prediction residual block.

### Claim 14 (depends on 1)

The method of claim 1, further comprising:
determining the similarity by computing signs and magnitudes of differences between pixels in the blocks and corresponding adjacent pixels along the shared edge in a previously reconstructed block;
comparing the magnitudes of the differences to a threshold;
counting a number of times the signs differ along the shared edge; and
applying an inverse remapping to the block according to the number of times the signs differ.

### Claim 15 (depends on 3)

The method of claim 3, wherein the remapped reconstructed blocks is stored as a previously reconstructed block for subsequent use by a prediction process.

### Claim 16 (depends on 1)

The method of claim 1, wherein the remapping maximizes a continuity of structure or minimizes differences in texture orientation between the block and adjacent previously-reconstructed blocks.