Commit b88f50a0 authored by Debargha Mukherjee's avatar Debargha Mukherjee

A better trade-off for ext-partition-types search

Changes a pruning criterion that seems to give a little better
compression efficiency at a little faster speed.

Change-Id: I8e3f9aa552b093c4af4ba615bb6ce29587bc8c36
parent ab8bb8b8
......@@ -3077,7 +3077,7 @@ static void rd_pick_partition(const AV1_COMP *const cpi, ThreadData *td,
horz4_partition_allowed &= (pc_tree->partitioning == PARTITION_HORZ ||
pc_tree->partitioning == PARTITION_HORZ_A ||
pc_tree->partitioning == PARTITION_HORZ_B ||
pc_tree->partitioning == PARTITION_SPLIT);
pc_tree->partitioning == PARTITION_NONE);
}
if (horz4_partition_allowed && !force_horz_split &&
(do_rectangular_split || av1_active_h_edge(cpi, mi_row, mi_step))) {
......@@ -3116,7 +3116,7 @@ static void rd_pick_partition(const AV1_COMP *const cpi, ThreadData *td,
vert4_partition_allowed &= (pc_tree->partitioning == PARTITION_VERT ||
pc_tree->partitioning == PARTITION_VERT_A ||
pc_tree->partitioning == PARTITION_VERT_B ||
pc_tree->partitioning == PARTITION_SPLIT);
pc_tree->partitioning == PARTITION_NONE);
}
if (vert4_partition_allowed && !force_vert_split &&
(do_rectangular_split || av1_active_v_edge(cpi, mi_row, mi_step))) {
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment