2012-08-20 23:43:34 +02:00
|
|
|
|
2012-01-28 11:07:08 +01:00
|
|
|
/*
|
2012-01-31 13:45:30 +01:00
|
|
|
* Copyright (c) 2012 The WebM project authors. All Rights Reserved.
|
2012-01-28 11:07:08 +01:00
|
|
|
*
|
|
|
|
* Use of this source code is governed by a BSD-style license
|
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
|
|
|
* in the file PATENTS. All contributing project authors may
|
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
|
|
*/
|
|
|
|
|
2013-01-06 03:20:25 +01:00
|
|
|
#include "vp9/common/vp9_common.h"
|
2012-11-27 22:59:17 +01:00
|
|
|
#include "vp9/common/vp9_pred_common.h"
|
|
|
|
#include "vp9/common/vp9_seg_common.h"
|
Consistently use get_prob(), clip_prob() and newly added clip_pixel().
Add a function clip_pixel() to clip a pixel value to the [0,255] range
of allowed values, and use this where-ever appropriate (e.g. prediction,
reconstruction). Likewise, consistently use the recently added function
clip_prob(), which calculates a binary probability in the [1,255] range.
If possible, try to use get_prob() or its sister get_binary_prob() to
calculate binary probabilities, for consistency.
Since in some places, this means that binary probability calculations
are changed (we use {255,256}*count0/(total) in a range of places,
and all of these are now changed to use 256*count0+(total>>1)/total),
this changes the encoding result, so this patch warrants some extensive
testing.
Change-Id: Ibeeff8d886496839b8e0c0ace9ccc552351f7628
2012-12-10 21:09:07 +01:00
|
|
|
#include "vp9/common/vp9_treecoder.h"
|
2012-01-28 11:07:08 +01:00
|
|
|
|
|
|
|
// TBD prediction functions for various bitstream signals
|
|
|
|
|
|
|
|
// Returns a context number for the given MB prediction signal
|
2012-10-31 01:53:32 +01:00
|
|
|
unsigned char vp9_get_pred_context(const VP9_COMMON *const cm,
|
2012-10-29 14:44:18 +01:00
|
|
|
const MACROBLOCKD *const xd,
|
|
|
|
PRED_ID pred_id) {
|
2012-07-14 00:21:29 +02:00
|
|
|
int pred_context;
|
|
|
|
MODE_INFO *m = xd->mode_info_context;
|
|
|
|
|
|
|
|
// Note:
|
|
|
|
// The mode info data structure has a one element border above and to the
|
|
|
|
// left of the entries correpsonding to real macroblocks.
|
|
|
|
// The prediction flags in these dummy entries are initialised to 0.
|
|
|
|
switch (pred_id) {
|
2012-01-28 11:07:08 +01:00
|
|
|
case PRED_SEG_ID:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_context = (m - 1)->mbmi.seg_id_predicted +
|
|
|
|
(m - cm->mode_info_stride)->mbmi.seg_id_predicted;
|
|
|
|
break;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
|
|
|
|
|
|
|
case PRED_REF:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_context = (m - 1)->mbmi.ref_predicted +
|
|
|
|
(m - cm->mode_info_stride)->mbmi.ref_predicted;
|
|
|
|
break;
|
2012-02-02 18:30:27 +01:00
|
|
|
|
2012-02-29 02:25:45 +01:00
|
|
|
case PRED_COMP:
|
2012-07-14 00:21:29 +02:00
|
|
|
// Context based on use of comp pred flag by neighbours
|
|
|
|
// pred_context =
|
2012-11-07 15:50:25 +01:00
|
|
|
// ((m - 1)->mbmi.second_ref_frame > INTRA_FRAME) +
|
|
|
|
// ((m - cm->mode_info_stride)->mbmi.second_ref_frame > INTRA_FRAME);
|
2012-07-14 00:21:29 +02:00
|
|
|
|
|
|
|
// Context based on mode and reference frame
|
|
|
|
// if ( m->mbmi.ref_frame == LAST_FRAME )
|
|
|
|
// pred_context = 0 + (m->mbmi.mode != ZEROMV);
|
|
|
|
// else if ( m->mbmi.ref_frame == GOLDEN_FRAME )
|
|
|
|
// pred_context = 2 + (m->mbmi.mode != ZEROMV);
|
|
|
|
// else
|
|
|
|
// pred_context = 4 + (m->mbmi.mode != ZEROMV);
|
|
|
|
|
|
|
|
if (m->mbmi.ref_frame == LAST_FRAME)
|
|
|
|
pred_context = 0;
|
|
|
|
else
|
|
|
|
pred_context = 1;
|
|
|
|
|
|
|
|
break;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-03-19 19:02:04 +01:00
|
|
|
case PRED_MBSKIP:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_context = (m - 1)->mbmi.mb_skip_coeff +
|
|
|
|
(m - cm->mode_info_stride)->mbmi.mb_skip_coeff;
|
|
|
|
break;
|
2012-03-19 19:02:04 +01:00
|
|
|
|
2012-07-18 22:43:01 +02:00
|
|
|
case PRED_SWITCHABLE_INTERP:
|
|
|
|
{
|
|
|
|
int left_in_image = (m - 1)->mbmi.mb_in_image;
|
|
|
|
int above_in_image = (m - cm->mode_info_stride)->mbmi.mb_in_image;
|
|
|
|
int left_mode = (m - 1)->mbmi.mode;
|
|
|
|
int above_mode = (m - cm->mode_info_stride)->mbmi.mode;
|
|
|
|
int left_interp, above_interp;
|
|
|
|
if (left_in_image && left_mode >= NEARESTMV && left_mode <= SPLITMV)
|
2012-10-31 01:12:12 +01:00
|
|
|
left_interp = vp9_switchable_interp_map[(m - 1)->mbmi.interp_filter];
|
2012-07-18 22:43:01 +02:00
|
|
|
else
|
2012-10-31 22:40:53 +01:00
|
|
|
left_interp = VP9_SWITCHABLE_FILTERS;
|
2012-11-30 01:39:15 +01:00
|
|
|
assert(left_interp != -1);
|
2012-07-18 22:43:01 +02:00
|
|
|
if (above_in_image && above_mode >= NEARESTMV && above_mode <= SPLITMV)
|
2012-10-31 01:12:12 +01:00
|
|
|
above_interp = vp9_switchable_interp_map[
|
2012-07-18 22:43:01 +02:00
|
|
|
(m - cm->mode_info_stride)->mbmi.interp_filter];
|
|
|
|
else
|
2012-10-31 22:40:53 +01:00
|
|
|
above_interp = VP9_SWITCHABLE_FILTERS;
|
2012-11-30 01:39:15 +01:00
|
|
|
assert(above_interp != -1);
|
2012-07-18 22:43:01 +02:00
|
|
|
|
|
|
|
if (left_interp == above_interp)
|
|
|
|
pred_context = left_interp;
|
2012-10-31 22:40:53 +01:00
|
|
|
else if (left_interp == VP9_SWITCHABLE_FILTERS &&
|
|
|
|
above_interp != VP9_SWITCHABLE_FILTERS)
|
2012-07-18 22:43:01 +02:00
|
|
|
pred_context = above_interp;
|
2012-10-31 22:40:53 +01:00
|
|
|
else if (left_interp != VP9_SWITCHABLE_FILTERS &&
|
|
|
|
above_interp == VP9_SWITCHABLE_FILTERS)
|
2012-07-18 22:43:01 +02:00
|
|
|
pred_context = left_interp;
|
|
|
|
else
|
2012-10-31 22:40:53 +01:00
|
|
|
pred_context = VP9_SWITCHABLE_FILTERS;
|
2012-07-18 22:43:01 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2012-01-28 11:07:08 +01:00
|
|
|
default:
|
2012-07-14 00:21:29 +02:00
|
|
|
// TODO *** add error trap code.
|
|
|
|
pred_context = 0;
|
|
|
|
break;
|
|
|
|
}
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
return pred_context;
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// This function returns a context probability for coding a given
|
|
|
|
// prediction signal
|
2012-10-31 22:40:53 +01:00
|
|
|
vp9_prob vp9_get_pred_prob(const VP9_COMMON *const cm,
|
2012-10-29 14:44:18 +01:00
|
|
|
const MACROBLOCKD *const xd,
|
|
|
|
PRED_ID pred_id) {
|
2012-10-31 22:40:53 +01:00
|
|
|
vp9_prob pred_probability;
|
2012-07-14 00:21:29 +02:00
|
|
|
int pred_context;
|
|
|
|
|
|
|
|
// Get the appropriate prediction context
|
2012-10-29 14:44:18 +01:00
|
|
|
pred_context = vp9_get_pred_context(cm, xd, pred_id);
|
2012-07-14 00:21:29 +02:00
|
|
|
|
|
|
|
switch (pred_id) {
|
2012-01-28 11:07:08 +01:00
|
|
|
case PRED_SEG_ID:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_probability = cm->segment_pred_probs[pred_context];
|
|
|
|
break;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
|
|
|
case PRED_REF:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_probability = cm->ref_pred_probs[pred_context];
|
|
|
|
break;
|
2012-02-02 18:30:27 +01:00
|
|
|
|
2012-02-29 02:25:45 +01:00
|
|
|
case PRED_COMP:
|
2012-07-14 00:21:29 +02:00
|
|
|
// In keeping with convention elsewhre the probability returned is
|
|
|
|
// the probability of a "0" outcome which in this case means the
|
|
|
|
// probability of comp pred off.
|
|
|
|
pred_probability = cm->prob_comppred[pred_context];
|
|
|
|
break;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-03-19 19:02:04 +01:00
|
|
|
case PRED_MBSKIP:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_probability = cm->mbskip_pred_probs[pred_context];
|
|
|
|
break;
|
2012-03-19 19:02:04 +01:00
|
|
|
|
2012-01-28 11:07:08 +01:00
|
|
|
default:
|
2012-07-14 00:21:29 +02:00
|
|
|
// TODO *** add error trap code.
|
|
|
|
pred_probability = 128;
|
|
|
|
break;
|
|
|
|
}
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
return pred_probability;
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|
|
|
|
|
2012-07-18 22:43:01 +02:00
|
|
|
// This function returns a context probability ptr for coding a given
|
|
|
|
// prediction signal
|
2012-10-31 22:40:53 +01:00
|
|
|
const vp9_prob *vp9_get_pred_probs(const VP9_COMMON *const cm,
|
2012-10-29 14:44:18 +01:00
|
|
|
const MACROBLOCKD *const xd,
|
|
|
|
PRED_ID pred_id) {
|
2012-10-31 22:40:53 +01:00
|
|
|
const vp9_prob *pred_probability;
|
2012-07-18 22:43:01 +02:00
|
|
|
int pred_context;
|
|
|
|
|
|
|
|
// Get the appropriate prediction context
|
2012-10-29 14:44:18 +01:00
|
|
|
pred_context = vp9_get_pred_context(cm, xd, pred_id);
|
2012-07-18 22:43:01 +02:00
|
|
|
|
|
|
|
switch (pred_id) {
|
|
|
|
case PRED_SEG_ID:
|
|
|
|
pred_probability = &cm->segment_pred_probs[pred_context];
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRED_REF:
|
|
|
|
pred_probability = &cm->ref_pred_probs[pred_context];
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRED_COMP:
|
|
|
|
// In keeping with convention elsewhre the probability returned is
|
|
|
|
// the probability of a "0" outcome which in this case means the
|
|
|
|
// probability of comp pred off.
|
|
|
|
pred_probability = &cm->prob_comppred[pred_context];
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRED_MBSKIP:
|
|
|
|
pred_probability = &cm->mbskip_pred_probs[pred_context];
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRED_SWITCHABLE_INTERP:
|
|
|
|
pred_probability = &cm->fc.switchable_interp_prob[pred_context][0];
|
|
|
|
break;
|
2012-10-22 23:43:01 +02:00
|
|
|
|
2012-07-18 22:43:01 +02:00
|
|
|
default:
|
|
|
|
// TODO *** add error trap code.
|
|
|
|
pred_probability = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return pred_probability;
|
|
|
|
}
|
|
|
|
|
2012-01-28 11:07:08 +01:00
|
|
|
// This function returns the status of the given prediction signal.
|
|
|
|
// I.e. is the predicted value for the given signal correct.
|
2012-10-29 14:44:18 +01:00
|
|
|
unsigned char vp9_get_pred_flag(const MACROBLOCKD *const xd,
|
|
|
|
PRED_ID pred_id) {
|
2012-07-14 00:21:29 +02:00
|
|
|
unsigned char pred_flag = 0;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
switch (pred_id) {
|
2012-01-28 11:07:08 +01:00
|
|
|
case PRED_SEG_ID:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_flag = xd->mode_info_context->mbmi.seg_id_predicted;
|
|
|
|
break;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
|
|
|
case PRED_REF:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_flag = xd->mode_info_context->mbmi.ref_predicted;
|
|
|
|
break;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-03-19 19:02:04 +01:00
|
|
|
case PRED_MBSKIP:
|
2012-07-14 00:21:29 +02:00
|
|
|
pred_flag = xd->mode_info_context->mbmi.mb_skip_coeff;
|
|
|
|
break;
|
2012-03-19 19:02:04 +01:00
|
|
|
|
2012-01-28 11:07:08 +01:00
|
|
|
default:
|
2012-07-14 00:21:29 +02:00
|
|
|
// TODO *** add error trap code.
|
|
|
|
pred_flag = 0;
|
|
|
|
break;
|
|
|
|
}
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
return pred_flag;
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// This function sets the status of the given prediction signal.
|
|
|
|
// I.e. is the predicted value for the given signal correct.
|
2012-10-29 14:44:18 +01:00
|
|
|
void vp9_set_pred_flag(MACROBLOCKD *const xd,
|
|
|
|
PRED_ID pred_id,
|
|
|
|
unsigned char pred_flag) {
|
2012-10-30 01:58:18 +01:00
|
|
|
const int mis = xd->mode_info_stride;
|
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
switch (pred_id) {
|
2012-01-28 11:07:08 +01:00
|
|
|
case PRED_SEG_ID:
|
2012-07-14 00:21:29 +02:00
|
|
|
xd->mode_info_context->mbmi.seg_id_predicted = pred_flag;
|
2013-01-06 03:20:25 +01:00
|
|
|
if (xd->mode_info_context->mbmi.sb_type) {
|
|
|
|
#define sub(a, b) (b) < 0 ? (a) + (b) : (a)
|
|
|
|
const int n_mbs = 1 << xd->mode_info_context->mbmi.sb_type;
|
|
|
|
const int x_mbs = sub(n_mbs, xd->mb_to_right_edge >> 7);
|
|
|
|
const int y_mbs = sub(n_mbs, xd->mb_to_bottom_edge >> 7);
|
|
|
|
int x, y;
|
|
|
|
|
|
|
|
for (y = 0; y < y_mbs; y++) {
|
|
|
|
for (x = !y; x < x_mbs; x++) {
|
|
|
|
xd->mode_info_context[y * mis + x].mbmi.seg_id_predicted =
|
|
|
|
pred_flag;
|
|
|
|
}
|
2012-10-30 01:58:18 +01:00
|
|
|
}
|
2012-08-20 23:43:34 +02:00
|
|
|
}
|
2012-07-14 00:21:29 +02:00
|
|
|
break;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
|
|
|
case PRED_REF:
|
2012-07-14 00:21:29 +02:00
|
|
|
xd->mode_info_context->mbmi.ref_predicted = pred_flag;
|
2013-01-06 03:20:25 +01:00
|
|
|
if (xd->mode_info_context->mbmi.sb_type) {
|
|
|
|
const int n_mbs = 1 << xd->mode_info_context->mbmi.sb_type;
|
|
|
|
const int x_mbs = sub(n_mbs, xd->mb_to_right_edge >> 7);
|
|
|
|
const int y_mbs = sub(n_mbs, xd->mb_to_bottom_edge >> 7);
|
|
|
|
int x, y;
|
|
|
|
|
|
|
|
for (y = 0; y < y_mbs; y++) {
|
|
|
|
for (x = !y; x < x_mbs; x++) {
|
|
|
|
xd->mode_info_context[y * mis + x].mbmi.ref_predicted = pred_flag;
|
|
|
|
}
|
2012-10-30 01:58:18 +01:00
|
|
|
}
|
2012-08-20 23:43:34 +02:00
|
|
|
}
|
2012-07-14 00:21:29 +02:00
|
|
|
break;
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-03-19 19:02:04 +01:00
|
|
|
case PRED_MBSKIP:
|
2012-07-14 00:21:29 +02:00
|
|
|
xd->mode_info_context->mbmi.mb_skip_coeff = pred_flag;
|
2013-01-06 03:20:25 +01:00
|
|
|
if (xd->mode_info_context->mbmi.sb_type) {
|
|
|
|
const int n_mbs = 1 << xd->mode_info_context->mbmi.sb_type;
|
|
|
|
const int x_mbs = sub(n_mbs, xd->mb_to_right_edge >> 7);
|
|
|
|
const int y_mbs = sub(n_mbs, xd->mb_to_bottom_edge >> 7);
|
|
|
|
int x, y;
|
|
|
|
|
|
|
|
for (y = 0; y < y_mbs; y++) {
|
|
|
|
for (x = !y; x < x_mbs; x++) {
|
|
|
|
xd->mode_info_context[y * mis + x].mbmi.mb_skip_coeff = pred_flag;
|
|
|
|
}
|
2012-10-30 01:58:18 +01:00
|
|
|
}
|
|
|
|
}
|
2012-07-14 00:21:29 +02:00
|
|
|
break;
|
2012-03-19 19:02:04 +01:00
|
|
|
|
2012-01-28 11:07:08 +01:00
|
|
|
default:
|
2012-07-14 00:21:29 +02:00
|
|
|
// TODO *** add error trap code.
|
|
|
|
break;
|
|
|
|
}
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// The following contain the guts of the prediction code used to
|
|
|
|
// peredict various bitstream signals.
|
|
|
|
|
|
|
|
// Macroblock segment id prediction function
|
2012-10-31 01:53:32 +01:00
|
|
|
unsigned char vp9_get_pred_mb_segid(const VP9_COMMON *const cm,
|
2012-10-30 01:58:18 +01:00
|
|
|
const MACROBLOCKD *const xd, int MbIndex) {
|
2012-07-14 00:21:29 +02:00
|
|
|
// Currently the prediction for the macroblock segment ID is
|
|
|
|
// the value stored for this macroblock in the previous frame.
|
2013-01-06 03:20:25 +01:00
|
|
|
if (!xd->mode_info_context->mbmi.sb_type) {
|
2012-10-30 01:58:18 +01:00
|
|
|
return cm->last_frame_seg_map[MbIndex];
|
|
|
|
} else {
|
2013-01-06 03:20:25 +01:00
|
|
|
const int n_mbs = 1 << xd->mode_info_context->mbmi.sb_type;
|
|
|
|
const int mb_col = MbIndex % cm->mb_cols;
|
|
|
|
const int mb_row = MbIndex / cm->mb_cols;
|
|
|
|
const int x_mbs = MIN(n_mbs, cm->mb_cols - mb_col);
|
|
|
|
const int y_mbs = MIN(n_mbs, cm->mb_rows - mb_row);
|
|
|
|
int x, y;
|
|
|
|
unsigned seg_id = -1;
|
|
|
|
|
|
|
|
for (y = mb_row; y < mb_row + y_mbs; y++) {
|
|
|
|
for (x = mb_col; x < mb_col + x_mbs; x++) {
|
|
|
|
seg_id = MIN(seg_id, cm->last_frame_seg_map[cm->mb_cols * y + x]);
|
|
|
|
}
|
2012-10-30 01:58:18 +01:00
|
|
|
}
|
2013-01-06 03:20:25 +01:00
|
|
|
|
2012-10-30 01:58:18 +01:00
|
|
|
return seg_id;
|
|
|
|
}
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|
|
|
|
|
2012-10-31 01:53:32 +01:00
|
|
|
MV_REFERENCE_FRAME vp9_get_pred_ref(const VP9_COMMON *const cm,
|
2012-10-29 14:44:18 +01:00
|
|
|
const MACROBLOCKD *const xd) {
|
2012-07-14 00:21:29 +02:00
|
|
|
MODE_INFO *m = xd->mode_info_context;
|
|
|
|
|
|
|
|
MV_REFERENCE_FRAME left;
|
|
|
|
MV_REFERENCE_FRAME above;
|
|
|
|
MV_REFERENCE_FRAME above_left;
|
|
|
|
MV_REFERENCE_FRAME pred_ref = LAST_FRAME;
|
|
|
|
|
|
|
|
int segment_id = xd->mode_info_context->mbmi.segment_id;
|
|
|
|
int seg_ref_active;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
unsigned char frame_allowed[MAX_REF_FRAMES] = {1, 1, 1, 1};
|
|
|
|
unsigned char ref_score[MAX_REF_FRAMES];
|
|
|
|
unsigned char best_score = 0;
|
|
|
|
unsigned char left_in_image;
|
|
|
|
unsigned char above_in_image;
|
|
|
|
unsigned char above_left_in_image;
|
|
|
|
|
|
|
|
// Is segment coding ennabled
|
2012-10-30 06:15:27 +01:00
|
|
|
seg_ref_active = vp9_segfeature_active(xd, segment_id, SEG_LVL_REF_FRAME);
|
2012-07-14 00:21:29 +02:00
|
|
|
|
|
|
|
// Special case treatment if segment coding is enabled.
|
|
|
|
// Dont allow prediction of a reference frame that the segment
|
|
|
|
// does not allow
|
|
|
|
if (seg_ref_active) {
|
|
|
|
for (i = 0; i < MAX_REF_FRAMES; i++) {
|
|
|
|
frame_allowed[i] =
|
2012-10-30 06:15:27 +01:00
|
|
|
vp9_check_segref(xd, segment_id, i);
|
2012-07-14 00:21:29 +02:00
|
|
|
|
|
|
|
// Score set to 0 if ref frame not allowed
|
|
|
|
ref_score[i] = cm->ref_scores[i] * frame_allowed[i];
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|
2012-07-14 00:21:29 +02:00
|
|
|
} else
|
|
|
|
vpx_memcpy(ref_score, cm->ref_scores, sizeof(ref_score));
|
|
|
|
|
|
|
|
// Reference frames used by neighbours
|
|
|
|
left = (m - 1)->mbmi.ref_frame;
|
|
|
|
above = (m - cm->mode_info_stride)->mbmi.ref_frame;
|
|
|
|
above_left = (m - 1 - cm->mode_info_stride)->mbmi.ref_frame;
|
|
|
|
|
|
|
|
// Are neighbours in image
|
|
|
|
left_in_image = (m - 1)->mbmi.mb_in_image;
|
|
|
|
above_in_image = (m - cm->mode_info_stride)->mbmi.mb_in_image;
|
|
|
|
above_left_in_image = (m - 1 - cm->mode_info_stride)->mbmi.mb_in_image;
|
|
|
|
|
|
|
|
// Adjust scores for candidate reference frames based on neigbours
|
|
|
|
if (frame_allowed[left] && left_in_image) {
|
|
|
|
ref_score[left] += 16;
|
|
|
|
if (above_left_in_image && (left == above_left))
|
|
|
|
ref_score[left] += 4;
|
|
|
|
}
|
|
|
|
if (frame_allowed[above] && above_in_image) {
|
|
|
|
ref_score[above] += 16;
|
|
|
|
if (above_left_in_image && (above == above_left))
|
|
|
|
ref_score[above] += 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now choose the candidate with the highest score
|
|
|
|
for (i = 0; i < MAX_REF_FRAMES; i++) {
|
|
|
|
if (ref_score[i] > best_score) {
|
|
|
|
pred_ref = i;
|
|
|
|
best_score = ref_score[i];
|
2012-01-31 13:45:30 +01:00
|
|
|
}
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
2012-01-28 11:07:08 +01:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
return pred_ref;
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Functions to computes a set of modified reference frame probabilities
|
|
|
|
// to use when the prediction of the reference frame value fails
|
2012-10-31 22:40:53 +01:00
|
|
|
void vp9_calc_ref_probs(int *count, vp9_prob *probs) {
|
2012-07-14 00:21:29 +02:00
|
|
|
int tot_count;
|
|
|
|
|
|
|
|
tot_count = count[0] + count[1] + count[2] + count[3];
|
Consistently use get_prob(), clip_prob() and newly added clip_pixel().
Add a function clip_pixel() to clip a pixel value to the [0,255] range
of allowed values, and use this where-ever appropriate (e.g. prediction,
reconstruction). Likewise, consistently use the recently added function
clip_prob(), which calculates a binary probability in the [1,255] range.
If possible, try to use get_prob() or its sister get_binary_prob() to
calculate binary probabilities, for consistency.
Since in some places, this means that binary probability calculations
are changed (we use {255,256}*count0/(total) in a range of places,
and all of these are now changed to use 256*count0+(total>>1)/total),
this changes the encoding result, so this patch warrants some extensive
testing.
Change-Id: Ibeeff8d886496839b8e0c0ace9ccc552351f7628
2012-12-10 21:09:07 +01:00
|
|
|
probs[0] = get_prob(count[0], tot_count);
|
2012-07-14 00:21:29 +02:00
|
|
|
|
|
|
|
tot_count -= count[0];
|
Consistently use get_prob(), clip_prob() and newly added clip_pixel().
Add a function clip_pixel() to clip a pixel value to the [0,255] range
of allowed values, and use this where-ever appropriate (e.g. prediction,
reconstruction). Likewise, consistently use the recently added function
clip_prob(), which calculates a binary probability in the [1,255] range.
If possible, try to use get_prob() or its sister get_binary_prob() to
calculate binary probabilities, for consistency.
Since in some places, this means that binary probability calculations
are changed (we use {255,256}*count0/(total) in a range of places,
and all of these are now changed to use 256*count0+(total>>1)/total),
this changes the encoding result, so this patch warrants some extensive
testing.
Change-Id: Ibeeff8d886496839b8e0c0ace9ccc552351f7628
2012-12-10 21:09:07 +01:00
|
|
|
probs[1] = get_prob(count[1], tot_count);
|
2012-07-14 00:21:29 +02:00
|
|
|
|
|
|
|
tot_count -= count[1];
|
Consistently use get_prob(), clip_prob() and newly added clip_pixel().
Add a function clip_pixel() to clip a pixel value to the [0,255] range
of allowed values, and use this where-ever appropriate (e.g. prediction,
reconstruction). Likewise, consistently use the recently added function
clip_prob(), which calculates a binary probability in the [1,255] range.
If possible, try to use get_prob() or its sister get_binary_prob() to
calculate binary probabilities, for consistency.
Since in some places, this means that binary probability calculations
are changed (we use {255,256}*count0/(total) in a range of places,
and all of these are now changed to use 256*count0+(total>>1)/total),
this changes the encoding result, so this patch warrants some extensive
testing.
Change-Id: Ibeeff8d886496839b8e0c0ace9ccc552351f7628
2012-12-10 21:09:07 +01:00
|
|
|
probs[2] = get_prob(count[2], tot_count);
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|
|
|
|
|
2012-01-31 13:45:30 +01:00
|
|
|
// Computes a set of modified conditional probabilities for the reference frame
|
|
|
|
// Values willbe set to 0 for reference frame options that are not possible
|
|
|
|
// because wither they were predicted and prediction has failed or because
|
|
|
|
// they are not allowed for a given segment.
|
2012-10-31 01:53:32 +01:00
|
|
|
void vp9_compute_mod_refprobs(VP9_COMMON *const cm) {
|
2012-07-14 00:21:29 +02:00
|
|
|
int norm_cnt[MAX_REF_FRAMES];
|
|
|
|
int intra_count;
|
|
|
|
int inter_count;
|
|
|
|
int last_count;
|
|
|
|
int gfarf_count;
|
|
|
|
int gf_count;
|
|
|
|
int arf_count;
|
|
|
|
|
|
|
|
intra_count = cm->prob_intra_coded;
|
|
|
|
inter_count = (255 - intra_count);
|
|
|
|
last_count = (inter_count * cm->prob_last_coded) / 255;
|
|
|
|
gfarf_count = inter_count - last_count;
|
|
|
|
gf_count = (gfarf_count * cm->prob_gf_coded) / 255;
|
|
|
|
arf_count = gfarf_count - gf_count;
|
|
|
|
|
|
|
|
// Work out modified reference frame probabilities to use where prediction
|
|
|
|
// of the reference frame fails
|
|
|
|
norm_cnt[0] = 0;
|
|
|
|
norm_cnt[1] = last_count;
|
|
|
|
norm_cnt[2] = gf_count;
|
|
|
|
norm_cnt[3] = arf_count;
|
2012-10-29 14:44:18 +01:00
|
|
|
vp9_calc_ref_probs(norm_cnt, cm->mod_refprobs[INTRA_FRAME]);
|
2012-07-14 00:21:29 +02:00
|
|
|
cm->mod_refprobs[INTRA_FRAME][0] = 0; // This branch implicit
|
|
|
|
|
|
|
|
norm_cnt[0] = intra_count;
|
|
|
|
norm_cnt[1] = 0;
|
|
|
|
norm_cnt[2] = gf_count;
|
|
|
|
norm_cnt[3] = arf_count;
|
2012-10-29 14:44:18 +01:00
|
|
|
vp9_calc_ref_probs(norm_cnt, cm->mod_refprobs[LAST_FRAME]);
|
2012-07-14 00:21:29 +02:00
|
|
|
cm->mod_refprobs[LAST_FRAME][1] = 0; // This branch implicit
|
|
|
|
|
|
|
|
norm_cnt[0] = intra_count;
|
|
|
|
norm_cnt[1] = last_count;
|
|
|
|
norm_cnt[2] = 0;
|
|
|
|
norm_cnt[3] = arf_count;
|
2012-10-29 14:44:18 +01:00
|
|
|
vp9_calc_ref_probs(norm_cnt, cm->mod_refprobs[GOLDEN_FRAME]);
|
2012-07-14 00:21:29 +02:00
|
|
|
cm->mod_refprobs[GOLDEN_FRAME][2] = 0; // This branch implicit
|
|
|
|
|
|
|
|
norm_cnt[0] = intra_count;
|
|
|
|
norm_cnt[1] = last_count;
|
|
|
|
norm_cnt[2] = gf_count;
|
|
|
|
norm_cnt[3] = 0;
|
2012-10-29 14:44:18 +01:00
|
|
|
vp9_calc_ref_probs(norm_cnt, cm->mod_refprobs[ALTREF_FRAME]);
|
2012-07-14 00:21:29 +02:00
|
|
|
cm->mod_refprobs[ALTREF_FRAME][2] = 0; // This branch implicit
|
|
|
|
|
|
|
|
// Score the reference frames based on overal frequency.
|
|
|
|
// These scores contribute to the prediction choices.
|
|
|
|
// Max score 17 min 1
|
|
|
|
cm->ref_scores[INTRA_FRAME] = 1 + (intra_count * 16 / 255);
|
|
|
|
cm->ref_scores[LAST_FRAME] = 1 + (last_count * 16 / 255);
|
|
|
|
cm->ref_scores[GOLDEN_FRAME] = 1 + (gf_count * 16 / 255);
|
|
|
|
cm->ref_scores[ALTREF_FRAME] = 1 + (arf_count * 16 / 255);
|
2012-01-28 11:07:08 +01:00
|
|
|
}
|