# US 2015/0103910 A1 · Intra Block Copy (IntraBC) Cost Estimation

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

- Number: US 2015/0103910 A1
- Document ID: US20150103910A1
- Status: Published application
- Kind: A1
- Application number: 14/506,085
- Filed: 2014-10-03
- Published: 2015-04-16
- Earliest claimed: 2013-10-14
- Assignees: Texas Instruments Incorporated
- Applicants: Texas Instruments Incorporated
- Inventors: Do-Kyoung Kwon; Madhukar Budagavi
- Web page: https://patentgrep.com/patent/US20150103910A1

## CPC

- H04N 19/567: Motion estimation based on rate distortion criteria
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A method for encoding a video stream is provided that includes computing activity of a block of video data in the video stream when a parent block of the block is not predicted in intra block copy (IntraBC) mode, computing an IntraBC coding cost of the block based on a two dimensional (2D) search when the activity is not less than an activity threshold, computing the IntraBC coding cost of the block based on a one dimensional (1D) search when the activity is less than the activity threshold, and selecting a best mode for encoding the block based on the IntraBC coding cost.

## Claims

### Claim 1

A method for encoding a video stream, the method comprising:
computing activity of a block of video data in the video stream when a parent block of the block is not predicted in intra block copy (IntraBC) mode;
computing an IntraBC coding cost of the block based on a two dimensional (2D) search when the activity is not less than an activity threshold;
computing the IntraBC coding cost of the block based on a one dimensional (1D) search when the activity is less than the activity threshold; and
selecting a best mode for encoding the block based on the IntraBC coding cost.

### Claim 2 (depends on 1)

The method of claim 1, wherein computing activity comprises computing min(ActH, ActV) wherein
Act
H
=
∑
j
=
0
N
-
1

∑
i
=
1
N
-
1


p

(
j
,
i
)
-
p

(
j
,
i
-
1
)



and
Act
V
=
∑
i
=
0
N
-
1

∑
j
=
1
N
-
1


p

(
j
,
i
)
-
p

(
j
-
1
,
i
)

and p(j,i) is an original pixel at the j-th row and i-th column of the block.

### Claim 3 (depends on 1)

The method of claim 1, wherein the activity threshold is computed as 168×(1<<(bitDepth−8)).

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
determining whether or not a parent block of the block was predicted in IntraBC mode before computing activity of the block; and
computing an IntraBC coding cost of the block based on a two dimensional (2D) search when the parent block was predicted in IntraBC mode.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
computing an inter-prediction cost for the block;
computing an intra-prediction cost for the block; and
selecting a best mode for encoding the block based on the inter-prediction cost and the intra-prediction cost when a minimum the inter-prediction cost and the intra-prediction cost is less than a cost threshold.

### Claim 6 (depends on 5)

The method of claim 5, wherein the cost threshold is computed as a minimum of 48 and 32×λ, wherein λ is a Lagrange multiplier depending on a value of a quantization parameter.

### Claim 7

A method for encoding a video stream, the method comprising:
computing an inter-prediction cost for a block of video data in the video stream;
computing an intra-prediction cost for the block;
selecting a best mode for encoding the block based on the inter-prediction cost and the intra-prediction cost when a minimum the inter-prediction cost and the intra-prediction cost is less than a cost threshold;
determining whether or not a parent block of the block was predicted in IntraBC mode when the minimum is not less than the cost threshold;
computing an IntraBC coding cost of the block with a two dimensional (2D) search when the parent block was predicted in IntraBC mode;
computing activity of the block when the parent block of the block was not predicted in intra block copy (IntraBC) mode;
computing an IntraBC coding cost of the block based on a two dimensional (2D) search when the activity is not less than an activity threshold;
computing the IntraBC coding cost of the block based on a one dimensional (1D) search when the activity is less than the activity threshold; and
selecting a best mode for encoding the block based on the IntraBC coding cost.

### Claim 8 (depends on 7)

The method of claim 7, wherein computing activity comprises computing min(ActH, ActV) wherein
Act
H
=
∑
j
=
0
N
-
1

∑
i
=
1
N
-
1


p

(
j
,
i
)
-
p

(
j
,
i
-
1
)



and
Act
V
=
∑
i
=
0
N
-
1

∑
j
=
1
N
-
1


p

(
j
,
i
)
-
p

(
j
-
1
,
i
)

and p(j,i) is an original pixel at the j-th row and i-th column of the block.

### Claim 9 (depends on 7)

The method of claim 7, wherein the activity threshold is computed as 168×(1<<(bitDepth−8)).

### Claim 10

An apparatus for encoding a video stream, the apparatus comprising:
means for computing activity of a block of video data in the video stream when a parent block of the block is not predicted in intra block copy (IntraBC) mode;
means for computing an IntraBC coding cost of the block with a two dimensional (2D) search when the activity is not less than an activity threshold;
means for computing the IntraBC coding cost of the block based on a one dimensional (1D) search when the activity is less than the activity threshold; and
means for selecting a best mode for encoding the block based on the IntraBC coding cost.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein the means for computing activity computes activity as min(ActH, ActV) wherein
Act
H
=
∑
j
=
0
N
-
1

∑
i
=
1
N
-
1


p

(
j
,
i
)
-
p

(
j
,
i
-
1
)



and
Act
V
=
∑
i
=
0
N
-
1

∑
j
=
1
N
-
1


p

(
j
,
i
)
-
p

(
j
-
1
,
i
)

and p(j,i) is an original pixel at the j-th row and i-th column of the block.

### Claim 12 (depends on 10)

The apparatus of claim 10, wherein the activity threshold is computed as 168×(1<<(bitDepth−8)).

### Claim 13 (depends on 10)

The apparatus of claim 10, further comprising:
means for determining whether or not a parent block of the block was predicted in IntraBC mode before computing activity of the block; and
means for computing an IntraBC coding cost of the block based on a two dimensional (2D) search when the parent block was predicted in IntraBC mode.

### Claim 14 (depends on 13)

The apparatus of claim 13, further comprising:
computing an inter-prediction cost for the block;
computing an intra-prediction cost for the block; and
selecting a best mode for encoding the block based on the inter-prediction cost and the intra-prediction cost when a minimum the inter-prediction cost and the intra-prediction cost is less than a cost threshold.

### Claim 15 (depends on 14)

The apparatus of claim 14, wherein the cost threshold is computed as a minimum of 48 and 32×λ, wherein λ is a Lagrange multiplier depending on a value of a quantization parameter.
