2010-05-18 17:58:33 +02:00
|
|
|
/*
|
2010-09-09 14:16:39 +02:00
|
|
|
* Copyright (c) 2010 The WebM project authors. All Rights Reserved.
|
2010-05-18 17:58:33 +02:00
|
|
|
*
|
2010-06-18 18:39:21 +02:00
|
|
|
* Use of this source code is governed by a BSD-style license
|
2010-06-04 22:19:40 +02: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 18:39:21 +02:00
|
|
|
* in the file PATENTS. All contributing project authors may
|
2010-06-04 22:19:40 +02:00
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
2010-05-18 17:58:33 +02:00
|
|
|
*/
|
|
|
|
|
2012-11-30 01:36:10 +01:00
|
|
|
#ifndef VP9_COMMON_VP9_ENTROPY_H_
|
|
|
|
#define VP9_COMMON_VP9_ENTROPY_H_
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-12-19 00:31:19 +01:00
|
|
|
#include "vpx/vpx_integer.h"
|
2013-10-07 22:55:56 +02:00
|
|
|
|
2012-11-28 19:41:40 +01:00
|
|
|
#include "vp9/common/vp9_blockd.h"
|
|
|
|
#include "vp9/common/vp9_common.h"
|
2013-10-07 22:55:56 +02:00
|
|
|
#include "vp9/common/vp9_scan.h"
|
|
|
|
#include "vp9/common/vp9_treecoder.h"
|
2013-11-19 23:31:38 +01:00
|
|
|
#include "vp9/common/vp9_entropymode.h"
|
2012-06-20 14:07:24 +02:00
|
|
|
|
2013-10-11 19:47:22 +02:00
|
|
|
#define DIFF_UPDATE_PROB 252
|
|
|
|
|
2013-12-04 02:23:03 +01:00
|
|
|
// Coefficient token alphabet
|
|
|
|
#define ZERO_TOKEN 0 // 0 Extra Bits 0+0
|
|
|
|
#define ONE_TOKEN 1 // 1 Extra Bits 0+1
|
|
|
|
#define TWO_TOKEN 2 // 2 Extra Bits 0+1
|
|
|
|
#define THREE_TOKEN 3 // 3 Extra Bits 0+1
|
|
|
|
#define FOUR_TOKEN 4 // 4 Extra Bits 0+1
|
|
|
|
#define CATEGORY1_TOKEN 5 // 5-6 Extra Bits 1+1
|
|
|
|
#define CATEGORY2_TOKEN 6 // 7-10 Extra Bits 2+1
|
|
|
|
#define CATEGORY3_TOKEN 7 // 11-18 Extra Bits 3+1
|
|
|
|
#define CATEGORY4_TOKEN 8 // 19-34 Extra Bits 4+1
|
|
|
|
#define CATEGORY5_TOKEN 9 // 35-66 Extra Bits 5+1
|
|
|
|
#define CATEGORY6_TOKEN 10 // 67+ Extra Bits 14+1
|
|
|
|
#define EOB_TOKEN 11 // EOB Extra Bits 0+0
|
|
|
|
|
|
|
|
#define ENTROPY_TOKENS 12
|
|
|
|
|
|
|
|
#define ENTROPY_NODES 11
|
|
|
|
|
|
|
|
extern DECLARE_ALIGNED(16, const uint8_t, vp9_pt_energy_class[ENTROPY_TOKENS]);
|
|
|
|
|
|
|
|
#define EOB_MODEL_TOKEN 3
|
2013-05-17 15:40:25 +02:00
|
|
|
extern const vp9_tree_index vp9_coefmodel_tree[];
|
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
typedef struct {
|
2013-11-12 23:21:15 +01:00
|
|
|
const vp9_tree_index *tree;
|
2012-10-31 22:40:53 +01:00
|
|
|
const vp9_prob *prob;
|
2013-04-19 20:14:33 +02:00
|
|
|
int len;
|
2012-07-14 00:21:29 +02:00
|
|
|
int base_val;
|
2013-04-19 20:14:33 +02:00
|
|
|
} vp9_extra_bit;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-10-15 05:33:37 +02:00
|
|
|
// indexed by token value
|
2013-12-04 02:23:03 +01:00
|
|
|
extern const vp9_extra_bit vp9_extra_bits[ENTROPY_TOKENS];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
#define MAX_PROB 255
|
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-07 23:45:05 +01:00
|
|
|
#define DCT_MAX_VALUE 16384
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
/* Coefficients are predicted via a 3-dimensional probability table. */
|
|
|
|
|
2013-02-15 21:09:05 +01:00
|
|
|
/* Outside dimension. 0 = Y with DC, 1 = UV */
|
2013-02-19 22:36:38 +01:00
|
|
|
#define BLOCK_TYPES 2
|
|
|
|
#define REF_TYPES 2 // intra=0, inter=1
|
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-07 23:45:05 +01:00
|
|
|
|
2013-02-19 19:12:00 +01:00
|
|
|
/* Middle dimension reflects the coefficient position within the transform. */
|
|
|
|
#define COEF_BANDS 6
|
|
|
|
|
|
|
|
/* Inside dimension is measure of nearby complexity, that reflects the energy
|
|
|
|
of nearby coefficients are nonzero. For the first coefficient (DC, unless
|
|
|
|
block type is 0), we look at the (already encoded) blocks above and to the
|
|
|
|
left of the current block. The context index is then the number (0,1,or 2)
|
|
|
|
of these blocks having nonzero coefficients.
|
|
|
|
After decoding a coefficient, the measure is determined by the size of the
|
|
|
|
most recently decoded coefficient.
|
2010-05-18 17:58:33 +02:00
|
|
|
Note that the intuitive meaning of this measure changes as coefficients
|
|
|
|
are decoded, e.g., prior to the first token, a zero means that my neighbors
|
|
|
|
are empty while, after the first token, because of the use of end-of-block,
|
|
|
|
a zero means we just decoded a zero and hence guarantees that a non-zero
|
|
|
|
coefficient will appear later in this block. However, this shift
|
|
|
|
in meaning is perfectly OK because our context depends also on the
|
|
|
|
coefficient band (and since zigzag positions 0, 1, and 2 are in
|
|
|
|
distinct bands). */
|
|
|
|
|
2013-12-06 02:08:06 +01:00
|
|
|
#define COEFF_CONTEXTS 6
|
|
|
|
#define BAND_COEFF_CONTEXTS(band) ((band) == 0 ? 3 : COEFF_CONTEXTS)
|
2012-03-21 23:22:21 +01:00
|
|
|
|
2013-05-08 19:04:14 +02:00
|
|
|
// #define ENTROPY_STATS
|
2013-04-26 20:13:26 +02:00
|
|
|
|
2013-12-06 02:08:06 +01:00
|
|
|
typedef unsigned int vp9_coeff_count[REF_TYPES][COEF_BANDS][COEFF_CONTEXTS]
|
2013-12-04 02:23:03 +01:00
|
|
|
[ENTROPY_TOKENS];
|
2013-12-06 02:08:06 +01:00
|
|
|
typedef unsigned int vp9_coeff_stats[REF_TYPES][COEF_BANDS][COEFF_CONTEXTS]
|
2012-12-08 01:09:59 +01:00
|
|
|
[ENTROPY_NODES][2];
|
|
|
|
|
2012-06-06 00:25:07 +02:00
|
|
|
#define SUBEXP_PARAM 4 /* Subexponential code parameter */
|
|
|
|
#define MODULUS_PARAM 13 /* Modulus parameter */
|
2012-03-21 23:22:21 +01:00
|
|
|
|
2012-10-31 01:53:32 +01:00
|
|
|
struct VP9Common;
|
2013-08-24 04:30:33 +02:00
|
|
|
void vp9_default_coef_probs(struct VP9Common *cm);
|
|
|
|
void vp9_adapt_coef_probs(struct VP9Common *cm);
|
2012-08-03 02:03:14 +02:00
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static INLINE void reset_skip_context(MACROBLOCKD *xd, BLOCK_SIZE bsize) {
|
2013-04-29 19:37:25 +02:00
|
|
|
int i;
|
|
|
|
for (i = 0; i < MAX_MB_PLANE; i++) {
|
2013-08-12 20:24:24 +02:00
|
|
|
struct macroblockd_plane *const pd = &xd->plane[i];
|
2013-08-26 20:33:16 +02:00
|
|
|
const BLOCK_SIZE plane_bsize = get_plane_block_size(bsize, pd);
|
2013-08-22 01:31:51 +02:00
|
|
|
vpx_memset(pd->above_context, 0, sizeof(ENTROPY_CONTEXT) *
|
|
|
|
num_4x4_blocks_wide_lookup[plane_bsize]);
|
|
|
|
vpx_memset(pd->left_context, 0, sizeof(ENTROPY_CONTEXT) *
|
|
|
|
num_4x4_blocks_high_lookup[plane_bsize]);
|
2013-04-29 19:37:25 +02:00
|
|
|
}
|
2013-03-04 23:12:17 +01:00
|
|
|
}
|
|
|
|
|
2013-05-09 19:47:58 +02:00
|
|
|
// This is the index in the scan order beyond which all coefficients for
|
|
|
|
// 8x8 transform and above are in the top band.
|
2013-11-14 01:02:06 +01:00
|
|
|
// This macro is currently unused but may be used by certain implementations
|
2013-05-09 19:47:58 +02:00
|
|
|
#define MAXBAND_INDEX 21
|
|
|
|
|
2013-11-14 01:02:06 +01:00
|
|
|
extern const uint8_t vp9_coefband_trans_8x8plus[1024];
|
|
|
|
extern const uint8_t vp9_coefband_trans_4x4[16];
|
|
|
|
|
|
|
|
static const uint8_t *get_band_translate(TX_SIZE tx_size) {
|
|
|
|
return tx_size == TX_4X4 ? vp9_coefband_trans_4x4
|
|
|
|
: vp9_coefband_trans_8x8plus;
|
|
|
|
}
|
2013-05-23 16:44:45 +02:00
|
|
|
|
2013-05-22 16:28:29 +02:00
|
|
|
// 128 lists of probabilities are stored for the following ONE node probs:
|
|
|
|
// 1, 3, 5, 7, ..., 253, 255
|
Refinements on modelcoef expt to reduce storage
Uses more aggrerssive interpolation to reduce storage for the
model tables by almost more than half. Only 48 lists of probs are
stored (as opposed to 128 before), corresponding to ONE_NODE
probabilities of:
1,
3, 7, 11, ..., 115, 119,
127, 135, ..., 247, 255.
Besides, only 1 table is used as opposed to 2 before. So the overall
memory needed for the tables is just 48 * 8 = 384 bytes.
The table currently used is based on a new Pareto distribution with
heavier tail than a generalized Gaussian - which improves results on
derf by about 0.1% over a single table Generaized Gaussian.
Results overall on derfraw300 is -0.14%.
Change-Id: I19bd03559cbf5894a9f8594b8023dcc3e546f6bd
2013-05-20 22:54:39 +02:00
|
|
|
// In between probabilities are interpolated linearly
|
|
|
|
|
2013-12-04 03:49:19 +01:00
|
|
|
#define COEFF_PROB_MODELS 256
|
2013-03-13 19:03:17 +01:00
|
|
|
|
2013-05-17 15:40:25 +02:00
|
|
|
#define UNCONSTRAINED_NODES 3
|
2013-05-08 19:04:14 +02:00
|
|
|
|
2013-05-17 15:40:25 +02:00
|
|
|
#define PIVOT_NODE 2 // which node is pivot
|
2013-03-13 19:03:17 +01:00
|
|
|
|
2013-11-19 23:31:38 +01:00
|
|
|
#define MODEL_NODES (ENTROPY_NODES - UNCONSTRAINED_NODES)
|
2013-12-04 03:49:19 +01:00
|
|
|
extern const vp9_prob vp9_pareto8_full[COEFF_PROB_MODELS][MODEL_NODES];
|
2013-11-19 23:31:38 +01:00
|
|
|
|
2013-03-13 19:03:17 +01:00
|
|
|
typedef vp9_prob vp9_coeff_probs_model[REF_TYPES][COEF_BANDS]
|
2013-12-06 02:08:06 +01:00
|
|
|
[COEFF_CONTEXTS][UNCONSTRAINED_NODES];
|
2013-05-17 15:40:25 +02:00
|
|
|
|
|
|
|
typedef unsigned int vp9_coeff_count_model[REF_TYPES][COEF_BANDS]
|
2013-12-06 02:08:06 +01:00
|
|
|
[COEFF_CONTEXTS]
|
2013-05-17 15:40:25 +02:00
|
|
|
[UNCONSTRAINED_NODES + 1];
|
|
|
|
|
2013-05-22 16:28:29 +02:00
|
|
|
void vp9_model_to_full_probs(const vp9_prob *model, vp9_prob *full);
|
2013-05-17 15:40:25 +02:00
|
|
|
|
2013-10-31 22:34:21 +01:00
|
|
|
static int get_entropy_context(TX_SIZE tx_size, const ENTROPY_CONTEXT *a,
|
|
|
|
const ENTROPY_CONTEXT *l) {
|
2013-09-05 03:38:41 +02:00
|
|
|
ENTROPY_CONTEXT above_ec = 0, left_ec = 0;
|
2013-08-27 23:17:53 +02:00
|
|
|
|
2013-09-19 14:53:48 +02:00
|
|
|
switch (tx_size) {
|
|
|
|
case TX_4X4:
|
|
|
|
above_ec = a[0] != 0;
|
|
|
|
left_ec = l[0] != 0;
|
|
|
|
break;
|
|
|
|
case TX_8X8:
|
2013-10-31 22:34:21 +01:00
|
|
|
above_ec = !!*(const uint16_t *)a;
|
|
|
|
left_ec = !!*(const uint16_t *)l;
|
2013-09-19 14:53:48 +02:00
|
|
|
break;
|
|
|
|
case TX_16X16:
|
2013-10-31 22:34:21 +01:00
|
|
|
above_ec = !!*(const uint32_t *)a;
|
|
|
|
left_ec = !!*(const uint32_t *)l;
|
2013-09-19 14:53:48 +02:00
|
|
|
break;
|
|
|
|
case TX_32X32:
|
2013-10-31 22:34:21 +01:00
|
|
|
above_ec = !!*(const uint64_t *)a;
|
|
|
|
left_ec = !!*(const uint64_t *)l;
|
2013-09-19 14:53:48 +02:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
assert(!"Invalid transform size.");
|
|
|
|
}
|
|
|
|
|
|
|
|
return combine_entropy_contexts(above_ec, left_ec);
|
|
|
|
}
|
|
|
|
|
2013-11-23 01:20:45 +01:00
|
|
|
static const scan_order *get_scan(const MACROBLOCKD *xd, TX_SIZE tx_size,
|
|
|
|
PLANE_TYPE type, int block_idx) {
|
2013-11-20 00:31:43 +01:00
|
|
|
const MODE_INFO *const mi = xd->mi_8x8[0];
|
|
|
|
const MB_MODE_INFO *const mbmi = &mi->mbmi;
|
|
|
|
|
|
|
|
if (is_inter_block(mbmi) || type != PLANE_TYPE_Y_WITH_DC || xd->lossless) {
|
2013-11-23 01:20:45 +01:00
|
|
|
return &vp9_default_scan_orders[tx_size];
|
2013-11-20 00:31:43 +01:00
|
|
|
} else {
|
|
|
|
const MB_PREDICTION_MODE mode =
|
|
|
|
mbmi->sb_type < BLOCK_8X8 ? mi->bmi[block_idx].as_mode : mbmi->mode;
|
2013-11-23 01:20:45 +01:00
|
|
|
return &vp9_scan_orders[tx_size][mode2txfm_map[mode]];
|
2013-08-27 23:17:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-12-19 00:31:19 +01:00
|
|
|
#endif // VP9_COMMON_VP9_ENTROPY_H_
|