Low-Complexity Multiple Transform Selection Combining Multi-Type Tree Partition Algorithm for Versatile Video Coding

. 2022 Jul 25;22(15):5523. doi: 10.3390/s22155523

Algorithm 1 The proposed MTS early skipping method

Input:

R D_{i} (1 \leq i \leq N - 1)

R D_{p}

H_{1}

H_{2}

Output:

i s S k i p M T S

1:
intialize $i s S k i p M T S$ to false
2:
if partition mode is binary splitting and $0.9 \leq \frac{H_{2}}{H_{1}} \leq 1.1$ then
3:
if $R D_{p} \leq \sum_{i = 1}^{N - 2} R D_{i} + (1 + \frac{H_{2}}{H_{1}}) \times R D_{N - 1}$ then
4:
$i s S k i p M T S = t r u e$
5:
end if
6:
else if partition mode is not quad-tree splitting then
7:
calculat RD cost of primary transform $R D_p r i$
8:
if $R D_{p} \leq \sum_{i = 1}^{N - 1} R D_{i} + R D_p r i$ then
9:
$i s S k i p M T S = t r u e$
10:
end if
11:
else
12:
calculate RD costs of primary transform $R D_p r i$ and MTS $R D_m t s$
13:
if $R D_{p} \leq \sum_{i = 1}^{N - 1} R D_{i} + m i n (R D_p r i, R D_m t s)$ then
14:
$i s S k i p M T S = t r u e$
15:
end if
16:
end if
17:
return $i s S k i p M T S$