2010-05-18 19:58:33 +04:00
|
|
|
/*
|
2010-09-09 16:16:39 +04:00
|
|
|
* Copyright (c) 2010 The WebM project authors. All Rights Reserved.
|
2010-05-18 19:58:33 +04:00
|
|
|
*
|
2010-06-18 20:39:21 +04:00
|
|
|
* Use of this source code is governed by a BSD-style license
|
2010-06-05 00:19:40 +04:00
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
2010-06-18 20:39:21 +04:00
|
|
|
* in the file PATENTS. All contributing project authors may
|
2010-06-05 00:19:40 +04:00
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
2010-05-18 19:58:33 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
2012-11-28 22:41:40 +04:00
|
|
|
#include "vp9/common/vp9_entropy.h"
|
2010-05-18 19:58:33 +04:00
|
|
|
#include "string.h"
|
2012-11-28 22:41:40 +04:00
|
|
|
#include "vp9/common/vp9_blockd.h"
|
|
|
|
#include "vp9/common/vp9_onyxc_int.h"
|
|
|
|
#include "vp9/common/vp9_entropymode.h"
|
2011-08-17 00:21:21 +04:00
|
|
|
#include "vpx_mem/vpx_mem.h"
|
2010-05-18 19:58:33 +04:00
|
|
|
|
|
|
|
#define uchar unsigned char /* typedefs can clash */
|
|
|
|
#define uint unsigned int
|
|
|
|
|
|
|
|
typedef const uchar cuchar;
|
|
|
|
typedef const uint cuint;
|
|
|
|
|
2012-11-01 01:40:53 +04:00
|
|
|
typedef vp9_prob Prob;
|
2010-05-18 19:58:33 +04:00
|
|
|
|
2012-11-28 22:41:40 +04:00
|
|
|
#include "vp9/common/vp9_coefupdateprobs.h"
|
2010-05-18 19:58:33 +04:00
|
|
|
|
2012-10-31 04:12:12 +04:00
|
|
|
const int vp9_i8x8_block[4] = {0, 2, 8, 10};
|
2012-09-10 09:42:35 +04:00
|
|
|
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(16, const unsigned char, vp9_norm[256]) = {
|
2012-07-14 02:21:29 +04:00
|
|
|
0, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
|
|
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
|
2011-07-19 17:17:25 +04:00
|
|
|
};
|
|
|
|
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(16, const int, vp9_coef_bands[16]) = {
|
2012-07-27 22:29:46 +04:00
|
|
|
0, 1, 2, 3, 6, 4, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7
|
|
|
|
};
|
2011-07-19 17:17:25 +04:00
|
|
|
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(16, cuchar, vp9_prev_token_class[MAX_ENTROPY_TOKENS]) = {
|
2012-07-27 22:29:46 +04:00
|
|
|
0, 1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 0
|
|
|
|
};
|
2011-07-19 17:17:25 +04:00
|
|
|
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(16, const int, vp9_default_zig_zag1d[16]) = {
|
2012-07-14 02:21:29 +04:00
|
|
|
0, 1, 4, 8,
|
|
|
|
5, 2, 3, 6,
|
|
|
|
9, 12, 13, 10,
|
|
|
|
7, 11, 14, 15,
|
2010-05-18 19:58:33 +04:00
|
|
|
};
|
2012-06-25 23:26:09 +04:00
|
|
|
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(16, const int, vp9_col_scan[16]) = {
|
2012-06-25 23:26:09 +04:00
|
|
|
0, 4, 8, 12,
|
|
|
|
1, 5, 9, 13,
|
|
|
|
2, 6, 10, 14,
|
|
|
|
3, 7, 11, 15
|
|
|
|
};
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(16, const int, vp9_row_scan[16]) = {
|
2012-06-25 23:26:09 +04:00
|
|
|
0, 1, 2, 3,
|
|
|
|
4, 5, 6, 7,
|
|
|
|
8, 9, 10, 11,
|
|
|
|
12, 13, 14, 15
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(64, const int, vp9_coef_bands_8x8[64]) = { 0, 1, 2, 3, 5, 4, 4, 5,
|
2012-08-03 04:03:14 +04:00
|
|
|
5, 3, 6, 3, 5, 4, 6, 6,
|
|
|
|
6, 5, 5, 6, 6, 6, 6, 6,
|
|
|
|
6, 6, 6, 6, 6, 6, 6, 6,
|
|
|
|
6, 6, 6, 6, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7
|
|
|
|
};
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(64, const int, vp9_default_zig_zag1d_8x8[64]) = {
|
2012-07-14 02:21:29 +04:00
|
|
|
0, 1, 8, 16, 9, 2, 3, 10, 17, 24, 32, 25, 18, 11, 4, 5,
|
|
|
|
12, 19, 26, 33, 40, 48, 41, 34, 27, 20, 13, 6, 7, 14, 21, 28,
|
|
|
|
35, 42, 49, 56, 57, 50, 43, 36, 29, 22, 15, 23, 30, 37, 44, 51,
|
|
|
|
58, 59, 52, 45, 38, 31, 39, 46, 53, 60, 61, 54, 47, 55, 62, 63,
|
2011-02-15 01:18:18 +03:00
|
|
|
};
|
2010-05-18 19:58:33 +04:00
|
|
|
|
2012-08-03 04:03:14 +04:00
|
|
|
// Table can be optimized.
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(16, const int, vp9_coef_bands_16x16[256]) = {
|
2012-08-03 04:03:14 +04:00
|
|
|
0, 1, 2, 3, 5, 4, 4, 5, 5, 3, 6, 3, 5, 4, 6, 6,
|
|
|
|
6, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
|
|
|
|
6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
};
|
2012-10-31 04:12:12 +04:00
|
|
|
DECLARE_ALIGNED(16, const int, vp9_default_zig_zag1d_16x16[256]) = {
|
2012-08-03 04:03:14 +04:00
|
|
|
0, 1, 16, 32, 17, 2, 3, 18, 33, 48, 64, 49, 34, 19, 4, 5,
|
|
|
|
20, 35, 50, 65, 80, 96, 81, 66, 51, 36, 21, 6, 7, 22, 37, 52,
|
|
|
|
67, 82, 97, 112, 128, 113, 98, 83, 68, 53, 38, 23, 8, 9, 24, 39,
|
|
|
|
54, 69, 84, 99, 114, 129, 144, 160, 145, 130, 115, 100, 85, 70, 55, 40,
|
|
|
|
25, 10, 11, 26, 41, 56, 71, 86, 101, 116, 131, 146, 161, 176, 192, 177,
|
|
|
|
162, 147, 132, 117, 102, 87, 72, 57, 42, 27, 12, 13, 28, 43, 58, 73,
|
|
|
|
88, 103, 118, 133, 148, 163, 178, 193, 208, 224, 209, 194, 179, 164, 149, 134,
|
|
|
|
119, 104, 89, 74, 59, 44, 29, 14, 15, 30, 45, 60, 75, 90, 105, 120,
|
|
|
|
135, 150, 165, 180, 195, 210, 225, 240, 241, 226, 211, 196, 181, 166, 151, 136,
|
|
|
|
121, 106, 91, 76, 61, 46, 31, 47, 62, 77, 92, 107, 122, 137, 152, 167,
|
|
|
|
182, 197, 212, 227, 242, 243, 228, 213, 198, 183, 168, 153, 138, 123, 108, 93,
|
|
|
|
78, 63, 79, 94, 109, 124, 139, 154, 169, 184, 199, 214, 229, 244, 245, 230,
|
|
|
|
215, 200, 185, 170, 155, 140, 125, 110, 95, 111, 126, 141, 156, 171, 186, 201,
|
|
|
|
216, 231, 246, 247, 232, 217, 202, 187, 172, 157, 142, 127, 143, 158, 173, 188,
|
|
|
|
203, 218, 233, 248, 249, 234, 219, 204, 189, 174, 159, 175, 190, 205, 220, 235,
|
|
|
|
250, 251, 236, 221, 206, 191, 207, 222, 237, 252, 253, 238, 223, 239, 254, 255,
|
|
|
|
};
|
2010-12-10 02:00:30 +03:00
|
|
|
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-08 02:45:05 +04:00
|
|
|
DECLARE_ALIGNED(16, const int, vp9_coef_bands_32x32[1024]) = {
|
|
|
|
0, 1, 2, 3, 5, 4, 4, 5, 5, 3, 6, 3, 5, 4, 6, 6,
|
|
|
|
6, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
|
|
|
|
6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
|
|
};
|
|
|
|
DECLARE_ALIGNED(16, const int, vp9_default_zig_zag1d_32x32[1024]) = {
|
|
|
|
0, 1, 32, 64, 33, 2, 3, 34, 65, 96, 128, 97, 66, 35, 4, 5, 36, 67, 98, 129, 160, 192, 161, 130, 99, 68, 37, 6, 7, 38, 69, 100,
|
|
|
|
131, 162, 193, 224, 256, 225, 194, 163, 132, 101, 70, 39, 8, 9, 40, 71, 102, 133, 164, 195, 226, 257, 288, 320, 289, 258, 227, 196, 165, 134, 103, 72,
|
|
|
|
41, 10, 11, 42, 73, 104, 135, 166, 197, 228, 259, 290, 321, 352, 384, 353, 322, 291, 260, 229, 198, 167, 136, 105, 74, 43, 12, 13, 44, 75, 106, 137,
|
|
|
|
168, 199, 230, 261, 292, 323, 354, 385, 416, 448, 417, 386, 355, 324, 293, 262, 231, 200, 169, 138, 107, 76, 45, 14, 15, 46, 77, 108, 139, 170, 201, 232,
|
|
|
|
263, 294, 325, 356, 387, 418, 449, 480, 512, 481, 450, 419, 388, 357, 326, 295, 264, 233, 202, 171, 140, 109, 78, 47, 16, 17, 48, 79, 110, 141, 172, 203,
|
|
|
|
234, 265, 296, 327, 358, 389, 420, 451, 482, 513, 544, 576, 545, 514, 483, 452, 421, 390, 359, 328, 297, 266, 235, 204, 173, 142, 111, 80, 49, 18, 19, 50,
|
|
|
|
81, 112, 143, 174, 205, 236, 267, 298, 329, 360, 391, 422, 453, 484, 515, 546, 577, 608, 640, 609, 578, 547, 516, 485, 454, 423, 392, 361, 330, 299, 268, 237,
|
|
|
|
206, 175, 144, 113, 82, 51, 20, 21, 52, 83, 114, 145, 176, 207, 238, 269, 300, 331, 362, 393, 424, 455, 486, 517, 548, 579, 610, 641, 672, 704, 673, 642,
|
|
|
|
611, 580, 549, 518, 487, 456, 425, 394, 363, 332, 301, 270, 239, 208, 177, 146, 115, 84, 53, 22, 23, 54, 85, 116, 147, 178, 209, 240, 271, 302, 333, 364,
|
|
|
|
395, 426, 457, 488, 519, 550, 581, 612, 643, 674, 705, 736, 768, 737, 706, 675, 644, 613, 582, 551, 520, 489, 458, 427, 396, 365, 334, 303, 272, 241, 210, 179,
|
|
|
|
148, 117, 86, 55, 24, 25, 56, 87, 118, 149, 180, 211, 242, 273, 304, 335, 366, 397, 428, 459, 490, 521, 552, 583, 614, 645, 676, 707, 738, 769, 800, 832,
|
|
|
|
801, 770, 739, 708, 677, 646, 615, 584, 553, 522, 491, 460, 429, 398, 367, 336, 305, 274, 243, 212, 181, 150, 119, 88, 57, 26, 27, 58, 89, 120, 151, 182,
|
|
|
|
213, 244, 275, 306, 337, 368, 399, 430, 461, 492, 523, 554, 585, 616, 647, 678, 709, 740, 771, 802, 833, 864, 896, 865, 834, 803, 772, 741, 710, 679, 648, 617,
|
|
|
|
586, 555, 524, 493, 462, 431, 400, 369, 338, 307, 276, 245, 214, 183, 152, 121, 90, 59, 28, 29, 60, 91, 122, 153, 184, 215, 246, 277, 308, 339, 370, 401,
|
|
|
|
432, 463, 494, 525, 556, 587, 618, 649, 680, 711, 742, 773, 804, 835, 866, 897, 928, 960, 929, 898, 867, 836, 805, 774, 743, 712, 681, 650, 619, 588, 557, 526,
|
|
|
|
495, 464, 433, 402, 371, 340, 309, 278, 247, 216, 185, 154, 123, 92, 61, 30, 31, 62, 93, 124, 155, 186, 217, 248, 279, 310, 341, 372, 403, 434, 465, 496,
|
|
|
|
527, 558, 589, 620, 651, 682, 713, 744, 775, 806, 837, 868, 899, 930, 961, 992, 993, 962, 931, 900, 869, 838, 807, 776, 745, 714, 683, 652, 621, 590, 559, 528,
|
|
|
|
497, 466, 435, 404, 373, 342, 311, 280, 249, 218, 187, 156, 125, 94, 63, 95, 126, 157, 188, 219, 250, 281, 312, 343, 374, 405, 436, 467, 498, 529, 560, 591,
|
|
|
|
622, 653, 684, 715, 746, 777, 808, 839, 870, 901, 932, 963, 994, 995, 964, 933, 902, 871, 840, 809, 778, 747, 716, 685, 654, 623, 592, 561, 530, 499, 468, 437,
|
|
|
|
406, 375, 344, 313, 282, 251, 220, 189, 158, 127, 159, 190, 221, 252, 283, 314, 345, 376, 407, 438, 469, 500, 531, 562, 593, 624, 655, 686, 717, 748, 779, 810,
|
|
|
|
841, 872, 903, 934, 965, 996, 997, 966, 935, 904, 873, 842, 811, 780, 749, 718, 687, 656, 625, 594, 563, 532, 501, 470, 439, 408, 377, 346, 315, 284, 253, 222,
|
|
|
|
191, 223, 254, 285, 316, 347, 378, 409, 440, 471, 502, 533, 564, 595, 626, 657, 688, 719, 750, 781, 812, 843, 874, 905, 936, 967, 998, 999, 968, 937, 906, 875,
|
|
|
|
844, 813, 782, 751, 720, 689, 658, 627, 596, 565, 534, 503, 472, 441, 410, 379, 348, 317, 286, 255, 287, 318, 349, 380, 411, 442, 473, 504, 535, 566, 597, 628,
|
|
|
|
659, 690, 721, 752, 783, 814, 845, 876, 907, 938, 969, 1000, 1001, 970, 939, 908, 877, 846, 815, 784, 753, 722, 691, 660, 629, 598, 567, 536, 505, 474, 443, 412,
|
|
|
|
381, 350, 319, 351, 382, 413, 444, 475, 506, 537, 568, 599, 630, 661, 692, 723, 754, 785, 816, 847, 878, 909, 940, 971, 1002, 1003, 972, 941, 910, 879, 848, 817,
|
|
|
|
786, 755, 724, 693, 662, 631, 600, 569, 538, 507, 476, 445, 414, 383, 415, 446, 477, 508, 539, 570, 601, 632, 663, 694, 725, 756, 787, 818, 849, 880, 911, 942,
|
|
|
|
973, 1004, 1005, 974, 943, 912, 881, 850, 819, 788, 757, 726, 695, 664, 633, 602, 571, 540, 509, 478, 447, 479, 510, 541, 572, 603, 634, 665, 696, 727, 758, 789,
|
|
|
|
820, 851, 882, 913, 944, 975, 1006, 1007, 976, 945, 914, 883, 852, 821, 790, 759, 728, 697, 666, 635, 604, 573, 542, 511, 543, 574, 605, 636, 667, 698, 729, 760,
|
|
|
|
791, 822, 853, 884, 915, 946, 977, 1008, 1009, 978, 947, 916, 885, 854, 823, 792, 761, 730, 699, 668, 637, 606, 575, 607, 638, 669, 700, 731, 762, 793, 824, 855,
|
|
|
|
886, 917, 948, 979, 1010, 1011, 980, 949, 918, 887, 856, 825, 794, 763, 732, 701, 670, 639, 671, 702, 733, 764, 795, 826, 857, 888, 919, 950, 981, 1012, 1013, 982,
|
|
|
|
951, 920, 889, 858, 827, 796, 765, 734, 703, 735, 766, 797, 828, 859, 890, 921, 952, 983, 1014, 1015, 984, 953, 922, 891, 860, 829, 798, 767, 799, 830, 861, 892,
|
|
|
|
923, 954, 985, 1016, 1017, 986, 955, 924, 893, 862, 831, 863, 894, 925, 956, 987, 1018, 1019, 988, 957, 926, 895, 927, 958, 989, 1020, 1021, 990, 959, 991, 1022, 1023,
|
|
|
|
};
|
2010-05-18 19:58:33 +04:00
|
|
|
|
|
|
|
/* Array indices are identical to previously-existing CONTEXT_NODE indices */
|
|
|
|
|
2012-11-01 01:40:53 +04:00
|
|
|
const vp9_tree_index vp9_coef_tree[ 22] = /* corresponding _CONTEXT_NODEs */
|
2010-05-18 19:58:33 +04:00
|
|
|
{
|
2012-07-14 02:21:29 +04:00
|
|
|
-DCT_EOB_TOKEN, 2, /* 0 = EOB */
|
|
|
|
-ZERO_TOKEN, 4, /* 1 = ZERO */
|
|
|
|
-ONE_TOKEN, 6, /* 2 = ONE */
|
|
|
|
8, 12, /* 3 = LOW_VAL */
|
|
|
|
-TWO_TOKEN, 10, /* 4 = TWO */
|
|
|
|
-THREE_TOKEN, -FOUR_TOKEN, /* 5 = THREE */
|
|
|
|
14, 16, /* 6 = HIGH_LOW */
|
|
|
|
-DCT_VAL_CATEGORY1, -DCT_VAL_CATEGORY2, /* 7 = CAT_ONE */
|
|
|
|
18, 20, /* 8 = CAT_THREEFOUR */
|
|
|
|
-DCT_VAL_CATEGORY3, -DCT_VAL_CATEGORY4, /* 9 = CAT_THREE */
|
|
|
|
-DCT_VAL_CATEGORY5, -DCT_VAL_CATEGORY6 /* 10 = CAT_FIVE */
|
2010-05-18 19:58:33 +04:00
|
|
|
};
|
|
|
|
|
2012-11-01 01:40:53 +04:00
|
|
|
struct vp9_token_struct vp9_coef_encodings[MAX_ENTROPY_TOKENS];
|
2010-05-18 19:58:33 +04:00
|
|
|
|
|
|
|
/* Trees for extra bits. Probabilities are constant and
|
|
|
|
do not depend on previously encoded bits */
|
|
|
|
|
|
|
|
static const Prob Pcat1[] = { 159};
|
|
|
|
static const Prob Pcat2[] = { 165, 145};
|
|
|
|
static const Prob Pcat3[] = { 173, 148, 140};
|
|
|
|
static const Prob Pcat4[] = { 176, 155, 140, 135};
|
|
|
|
static const Prob Pcat5[] = { 180, 157, 141, 134, 130};
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-08 02:45:05 +04:00
|
|
|
static const Prob Pcat6[] = {
|
|
|
|
254, 254, 254, 252, 249, 243, 230, 196, 177, 153, 140, 133, 130, 129
|
|
|
|
};
|
2010-05-18 19:58:33 +04:00
|
|
|
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-08 02:45:05 +04:00
|
|
|
static vp9_tree_index cat1[2], cat2[4], cat3[6], cat4[8], cat5[10], cat6[28];
|
2010-05-18 19:58:33 +04:00
|
|
|
|
2012-11-01 01:40:53 +04:00
|
|
|
static void init_bit_tree(vp9_tree_index *p, int n) {
|
2012-07-14 02:21:29 +04:00
|
|
|
int i = 0;
|
2010-05-18 19:58:33 +04:00
|
|
|
|
2012-07-14 02:21:29 +04:00
|
|
|
while (++i < n) {
|
|
|
|
p[0] = p[1] = i << 1;
|
|
|
|
p += 2;
|
|
|
|
}
|
2010-05-18 19:58:33 +04:00
|
|
|
|
2012-07-14 02:21:29 +04:00
|
|
|
p[0] = p[1] = 0;
|
2010-05-18 19:58:33 +04:00
|
|
|
}
|
|
|
|
|
2012-07-14 02:21:29 +04:00
|
|
|
static void init_bit_trees() {
|
|
|
|
init_bit_tree(cat1, 1);
|
|
|
|
init_bit_tree(cat2, 2);
|
|
|
|
init_bit_tree(cat3, 3);
|
|
|
|
init_bit_tree(cat4, 4);
|
|
|
|
init_bit_tree(cat5, 5);
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-08 02:45:05 +04:00
|
|
|
init_bit_tree(cat6, 14);
|
2010-05-18 19:58:33 +04:00
|
|
|
}
|
|
|
|
|
2012-11-01 01:40:53 +04:00
|
|
|
vp9_extra_bit_struct vp9_extra_bits[12] = {
|
2012-07-14 02:21:29 +04:00
|
|
|
{ 0, 0, 0, 0},
|
|
|
|
{ 0, 0, 0, 1},
|
|
|
|
{ 0, 0, 0, 2},
|
|
|
|
{ 0, 0, 0, 3},
|
|
|
|
{ 0, 0, 0, 4},
|
|
|
|
{ cat1, Pcat1, 1, 5},
|
|
|
|
{ cat2, Pcat2, 2, 7},
|
|
|
|
{ cat3, Pcat3, 3, 11},
|
|
|
|
{ cat4, Pcat4, 4, 19},
|
|
|
|
{ cat5, Pcat5, 5, 35},
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-08 02:45:05 +04:00
|
|
|
{ cat6, Pcat6, 14, 67},
|
2012-07-14 02:21:29 +04:00
|
|
|
{ 0, 0, 0, 0}
|
2010-05-18 19:58:33 +04:00
|
|
|
};
|
2011-08-17 00:21:21 +04:00
|
|
|
|
2012-11-28 22:41:40 +04:00
|
|
|
#include "vp9/common/vp9_default_coef_probs.h"
|
2010-05-18 19:58:33 +04:00
|
|
|
|
2012-10-31 04:53:32 +04:00
|
|
|
void vp9_default_coef_probs(VP9_COMMON *pc) {
|
2012-12-08 04:09:59 +04:00
|
|
|
vpx_memcpy(pc->fc.coef_probs_4x4, default_coef_probs_4x4,
|
|
|
|
sizeof(pc->fc.coef_probs_4x4));
|
|
|
|
vpx_memcpy(pc->fc.hybrid_coef_probs_4x4, default_hybrid_coef_probs_4x4,
|
|
|
|
sizeof(pc->fc.hybrid_coef_probs_4x4));
|
2012-05-16 23:07:46 +04:00
|
|
|
|
2012-09-10 09:42:35 +04:00
|
|
|
vpx_memcpy(pc->fc.coef_probs_8x8, default_coef_probs_8x8,
|
2012-08-03 04:03:14 +04:00
|
|
|
sizeof(pc->fc.coef_probs_8x8));
|
2012-09-10 09:42:35 +04:00
|
|
|
vpx_memcpy(pc->fc.hybrid_coef_probs_8x8, default_hybrid_coef_probs_8x8,
|
|
|
|
sizeof(pc->fc.hybrid_coef_probs_8x8));
|
2012-02-29 05:11:12 +04:00
|
|
|
|
2012-09-10 09:42:35 +04:00
|
|
|
vpx_memcpy(pc->fc.coef_probs_16x16, default_coef_probs_16x16,
|
2012-08-03 04:03:14 +04:00
|
|
|
sizeof(pc->fc.coef_probs_16x16));
|
2012-09-10 09:42:35 +04:00
|
|
|
vpx_memcpy(pc->fc.hybrid_coef_probs_16x16,
|
|
|
|
default_hybrid_coef_probs_16x16,
|
|
|
|
sizeof(pc->fc.hybrid_coef_probs_16x16));
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-08 02:45:05 +04:00
|
|
|
|
|
|
|
#if CONFIG_TX32X32 && CONFIG_SUPERBLOCKS
|
|
|
|
vpx_memcpy(pc->fc.coef_probs_32x32, default_coef_probs_32x32,
|
|
|
|
sizeof(pc->fc.coef_probs_32x32));
|
|
|
|
#endif
|
2011-02-15 01:18:18 +03:00
|
|
|
}
|
2010-05-18 19:58:33 +04:00
|
|
|
|
2012-10-31 03:25:53 +04:00
|
|
|
void vp9_coef_tree_initialize() {
|
2012-07-14 02:21:29 +04:00
|
|
|
init_bit_trees();
|
2012-10-31 04:12:12 +04:00
|
|
|
vp9_tokens_from_tree(vp9_coef_encodings, vp9_coef_tree);
|
2010-05-18 19:58:33 +04:00
|
|
|
}
|
2012-06-06 02:25:07 +04:00
|
|
|
|
2012-07-14 02:21:29 +04:00
|
|
|
// #define COEF_COUNT_TESTING
|
2012-06-06 02:25:07 +04:00
|
|
|
|
|
|
|
#define COEF_COUNT_SAT 24
|
|
|
|
#define COEF_MAX_UPDATE_FACTOR 112
|
|
|
|
#define COEF_COUNT_SAT_KEY 24
|
|
|
|
#define COEF_MAX_UPDATE_FACTOR_KEY 112
|
|
|
|
#define COEF_COUNT_SAT_AFTER_KEY 24
|
|
|
|
#define COEF_MAX_UPDATE_FACTOR_AFTER_KEY 128
|
|
|
|
|
2012-12-08 04:09:59 +04:00
|
|
|
static void update_coef_probs(vp9_coeff_probs *dst_coef_probs,
|
|
|
|
vp9_coeff_probs *pre_coef_probs,
|
|
|
|
int block_types, vp9_coeff_count *coef_counts,
|
|
|
|
int count_sat, int update_factor) {
|
2012-07-14 02:21:29 +04:00
|
|
|
int t, i, j, k, count;
|
|
|
|
unsigned int branch_ct[ENTROPY_NODES][2];
|
2012-11-01 01:40:53 +04:00
|
|
|
vp9_prob coef_probs[ENTROPY_NODES];
|
2012-07-14 02:21:29 +04:00
|
|
|
int factor;
|
2012-12-08 04:09:59 +04:00
|
|
|
|
|
|
|
for (i = 0; i < block_types; ++i)
|
|
|
|
for (j = 0; j < COEF_BANDS; ++j)
|
|
|
|
for (k = 0; k < PREV_COEF_CONTEXTS; ++k) {
|
|
|
|
if (k >= 3 && ((i == 0 && j == 1) || (i > 0 && j == 0)))
|
|
|
|
continue;
|
|
|
|
vp9_tree_probs_from_distribution(MAX_ENTROPY_TOKENS,
|
|
|
|
vp9_coef_encodings, vp9_coef_tree,
|
|
|
|
coef_probs, branch_ct,
|
|
|
|
coef_counts[i][j][k], 256, 1);
|
|
|
|
for (t = 0; t < ENTROPY_NODES; ++t) {
|
|
|
|
int prob;
|
|
|
|
count = branch_ct[t][0] + branch_ct[t][1];
|
|
|
|
count = count > count_sat ? count_sat : count;
|
|
|
|
factor = (update_factor * count / count_sat);
|
|
|
|
prob = ((int)pre_coef_probs[i][j][k][t] * (256 - factor) +
|
|
|
|
(int)coef_probs[t] * factor + 128) >> 8;
|
|
|
|
dst_coef_probs[i][j][k][t] = clip_prob(prob);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void vp9_adapt_coef_probs(VP9_COMMON *cm) {
|
|
|
|
#ifdef COEF_COUNT_TESTING
|
|
|
|
int t, i, j, k;
|
|
|
|
#endif
|
2012-07-14 02:21:29 +04:00
|
|
|
int count_sat;
|
2012-12-08 04:09:59 +04:00
|
|
|
int update_factor; /* denominator 256 */
|
2012-07-14 02:21:29 +04:00
|
|
|
|
|
|
|
// printf("Frame type: %d\n", cm->frame_type);
|
|
|
|
if (cm->frame_type == KEY_FRAME) {
|
|
|
|
update_factor = COEF_MAX_UPDATE_FACTOR_KEY;
|
|
|
|
count_sat = COEF_COUNT_SAT_KEY;
|
|
|
|
} else if (cm->last_frame_type == KEY_FRAME) {
|
|
|
|
update_factor = COEF_MAX_UPDATE_FACTOR_AFTER_KEY; /* adapt quickly */
|
|
|
|
count_sat = COEF_COUNT_SAT_AFTER_KEY;
|
|
|
|
} else {
|
|
|
|
update_factor = COEF_MAX_UPDATE_FACTOR;
|
|
|
|
count_sat = COEF_COUNT_SAT;
|
|
|
|
}
|
2012-06-06 02:25:07 +04:00
|
|
|
|
|
|
|
#ifdef COEF_COUNT_TESTING
|
2012-07-14 02:21:29 +04:00
|
|
|
{
|
|
|
|
printf("static const unsigned int\ncoef_counts"
|
|
|
|
"[BLOCK_TYPES] [COEF_BANDS]"
|
|
|
|
"[PREV_COEF_CONTEXTS] [MAX_ENTROPY_TOKENS] = {\n");
|
|
|
|
for (i = 0; i < BLOCK_TYPES; ++i) {
|
|
|
|
printf(" {\n");
|
|
|
|
for (j = 0; j < COEF_BANDS; ++j) {
|
|
|
|
printf(" {\n");
|
|
|
|
for (k = 0; k < PREV_COEF_CONTEXTS; ++k) {
|
|
|
|
printf(" {");
|
2012-09-10 09:42:35 +04:00
|
|
|
for (t = 0; t < MAX_ENTROPY_TOKENS; ++t)
|
|
|
|
printf("%d, ", cm->fc.coef_counts[i][j][k][t]);
|
2012-07-14 02:21:29 +04:00
|
|
|
printf("},\n");
|
2012-06-06 02:25:07 +04:00
|
|
|
}
|
2012-07-14 02:21:29 +04:00
|
|
|
printf(" },\n");
|
2012-06-06 02:25:07 +04:00
|
|
|
}
|
2012-07-14 02:21:29 +04:00
|
|
|
printf(" },\n");
|
|
|
|
}
|
|
|
|
printf("};\n");
|
|
|
|
printf("static const unsigned int\ncoef_counts_8x8"
|
|
|
|
"[BLOCK_TYPES_8X8] [COEF_BANDS]"
|
|
|
|
"[PREV_COEF_CONTEXTS] [MAX_ENTROPY_TOKENS] = {\n");
|
|
|
|
for (i = 0; i < BLOCK_TYPES_8X8; ++i) {
|
|
|
|
printf(" {\n");
|
|
|
|
for (j = 0; j < COEF_BANDS; ++j) {
|
|
|
|
printf(" {\n");
|
|
|
|
for (k = 0; k < PREV_COEF_CONTEXTS; ++k) {
|
|
|
|
printf(" {");
|
2012-09-10 09:42:35 +04:00
|
|
|
for (t = 0; t < MAX_ENTROPY_TOKENS; ++t)
|
|
|
|
printf("%d, ", cm->fc.coef_counts_8x8[i][j][k][t]);
|
|
|
|
printf("},\n");
|
|
|
|
}
|
|
|
|
printf(" },\n");
|
|
|
|
}
|
|
|
|
printf(" },\n");
|
|
|
|
}
|
|
|
|
printf("};\n");
|
|
|
|
printf("static const unsigned int\nhybrid_coef_counts"
|
|
|
|
"[BLOCK_TYPES] [COEF_BANDS]"
|
|
|
|
"[PREV_COEF_CONTEXTS] [MAX_ENTROPY_TOKENS] = {\n");
|
|
|
|
for (i = 0; i < BLOCK_TYPES; ++i) {
|
|
|
|
printf(" {\n");
|
|
|
|
for (j = 0; j < COEF_BANDS; ++j) {
|
|
|
|
printf(" {\n");
|
|
|
|
for (k = 0; k < PREV_COEF_CONTEXTS; ++k) {
|
|
|
|
printf(" {");
|
|
|
|
for (t = 0; t < MAX_ENTROPY_TOKENS; ++t)
|
|
|
|
printf("%d, ", cm->fc.hybrid_coef_counts[i][j][k][t]);
|
2012-07-14 02:21:29 +04:00
|
|
|
printf("},\n");
|
2012-06-06 02:25:07 +04:00
|
|
|
}
|
2012-07-14 02:21:29 +04:00
|
|
|
printf(" },\n");
|
2012-06-06 02:25:07 +04:00
|
|
|
}
|
2012-07-14 02:21:29 +04:00
|
|
|
printf(" },\n");
|
2012-06-06 02:25:07 +04:00
|
|
|
}
|
2012-07-14 02:21:29 +04:00
|
|
|
printf("};\n");
|
|
|
|
}
|
2012-06-06 02:25:07 +04:00
|
|
|
#endif
|
|
|
|
|
2012-12-08 04:09:59 +04:00
|
|
|
update_coef_probs(cm->fc.coef_probs_4x4, cm->fc.pre_coef_probs_4x4,
|
|
|
|
BLOCK_TYPES_4X4, cm->fc.coef_counts_4x4,
|
|
|
|
count_sat, update_factor);
|
|
|
|
update_coef_probs(cm->fc.hybrid_coef_probs_4x4,
|
|
|
|
cm->fc.pre_hybrid_coef_probs_4x4,
|
|
|
|
BLOCK_TYPES_4X4, cm->fc.hybrid_coef_counts_4x4,
|
|
|
|
count_sat, update_factor);
|
|
|
|
update_coef_probs(cm->fc.coef_probs_8x8, cm->fc.pre_coef_probs_8x8,
|
|
|
|
BLOCK_TYPES_8X8, cm->fc.coef_counts_8x8,
|
|
|
|
count_sat, update_factor);
|
|
|
|
update_coef_probs(cm->fc.hybrid_coef_probs_8x8,
|
|
|
|
cm->fc.pre_hybrid_coef_probs_8x8,
|
|
|
|
BLOCK_TYPES_8X8, cm->fc.hybrid_coef_counts_8x8,
|
|
|
|
count_sat, update_factor);
|
|
|
|
update_coef_probs(cm->fc.coef_probs_16x16, cm->fc.pre_coef_probs_16x16,
|
|
|
|
BLOCK_TYPES_16X16, cm->fc.coef_counts_16x16,
|
|
|
|
count_sat, update_factor);
|
|
|
|
update_coef_probs(cm->fc.hybrid_coef_probs_16x16,
|
|
|
|
cm->fc.pre_hybrid_coef_probs_16x16,
|
|
|
|
BLOCK_TYPES_16X16, cm->fc.hybrid_coef_counts_16x16,
|
|
|
|
count_sat, update_factor);
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-08 02:45:05 +04:00
|
|
|
#if CONFIG_TX32X32 && CONFIG_SUPERBLOCKS
|
2012-12-08 04:09:59 +04:00
|
|
|
update_coef_probs(cm->fc.coef_probs_32x32, cm->fc.pre_coef_probs_32x32,
|
|
|
|
BLOCK_TYPES_32X32, cm->fc.coef_counts_32x32,
|
|
|
|
count_sat, update_factor);
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-08 02:45:05 +04:00
|
|
|
#endif
|
2012-06-06 02:25:07 +04:00
|
|
|
}
|