2013-01-25 18:47:09 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2013 The WebM project authors. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* 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-02-12 00:34:08 +01:00
|
|
|
#include "vp9/common/vp9_convolve.h"
|
|
|
|
|
2013-01-25 18:47:09 +01:00
|
|
|
#include <assert.h>
|
|
|
|
|
|
|
|
#include "./vpx_config.h"
|
|
|
|
#include "./vp9_rtcd.h"
|
|
|
|
#include "vp9/common/vp9_common.h"
|
2013-08-23 01:02:18 +02:00
|
|
|
#include "vp9/common/vp9_filter.h"
|
2013-01-25 18:47:09 +01:00
|
|
|
#include "vpx/vpx_integer.h"
|
2013-02-12 00:34:08 +01:00
|
|
|
#include "vpx_ports/mem.h"
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
static void convolve_horiz_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x0, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h, int taps) {
|
2013-08-20 09:42:25 +02:00
|
|
|
int x, y, k;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* NOTE: This assumes that the filter table is 256-byte aligned. */
|
|
|
|
/* TODO(agrange) Modify to make independent of table alignment. */
|
|
|
|
const int16_t *const filter_x_base =
|
|
|
|
(const int16_t *)(((intptr_t)filter_x0) & ~(intptr_t)0xff);
|
2013-01-25 18:47:09 +01:00
|
|
|
|
|
|
|
/* Adjust base pointer address for this source line */
|
|
|
|
src -= taps / 2 - 1;
|
|
|
|
|
|
|
|
for (y = 0; y < h; ++y) {
|
|
|
|
/* Initial phase offset */
|
2013-08-23 01:02:18 +02:00
|
|
|
int x_q4 = (filter_x0 - filter_x_base) / taps;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
|
|
|
for (x = 0; x < w; ++x) {
|
|
|
|
/* Per-pixel src offset */
|
2013-08-23 01:02:18 +02:00
|
|
|
const int src_x = x_q4 >> SUBPEL_BITS;
|
2013-08-20 09:42:25 +02:00
|
|
|
int sum = 0;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* Pointer to filter to use */
|
|
|
|
const int16_t *const filter_x = filter_x_base +
|
|
|
|
(x_q4 & SUBPEL_MASK) * taps;
|
|
|
|
|
2013-08-20 09:42:25 +02:00
|
|
|
for (k = 0; k < taps; ++k)
|
2013-01-25 18:47:09 +01:00
|
|
|
sum += src[src_x + k] * filter_x[k];
|
2013-08-20 09:42:25 +02:00
|
|
|
|
2013-08-23 03:40:34 +02:00
|
|
|
dst[x] = clip_pixel(ROUND_POWER_OF_TWO(sum, FILTER_BITS));
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* Move to the next source pixel */
|
2013-01-25 18:47:09 +01:00
|
|
|
x_q4 += x_step_q4;
|
|
|
|
}
|
|
|
|
src += src_stride;
|
|
|
|
dst += dst_stride;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
static void convolve_avg_horiz_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x0, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h, int taps) {
|
2013-08-20 09:42:25 +02:00
|
|
|
int x, y, k;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* NOTE: This assumes that the filter table is 256-byte aligned. */
|
|
|
|
/* TODO(agrange) Modify to make independent of table alignment. */
|
|
|
|
const int16_t *const filter_x_base =
|
|
|
|
(const int16_t *)(((intptr_t)filter_x0) & ~(intptr_t)0xff);
|
2013-01-25 18:47:09 +01:00
|
|
|
|
|
|
|
/* Adjust base pointer address for this source line */
|
|
|
|
src -= taps / 2 - 1;
|
|
|
|
|
|
|
|
for (y = 0; y < h; ++y) {
|
|
|
|
/* Initial phase offset */
|
2013-08-23 01:02:18 +02:00
|
|
|
int x_q4 = (filter_x0 - filter_x_base) / taps;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
|
|
|
for (x = 0; x < w; ++x) {
|
|
|
|
/* Per-pixel src offset */
|
2013-08-23 01:02:18 +02:00
|
|
|
const int src_x = x_q4 >> SUBPEL_BITS;
|
2013-08-20 09:42:25 +02:00
|
|
|
int sum = 0;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* Pointer to filter to use */
|
|
|
|
const int16_t *const filter_x = filter_x_base +
|
|
|
|
(x_q4 & SUBPEL_MASK) * taps;
|
|
|
|
|
2013-08-20 09:42:25 +02:00
|
|
|
for (k = 0; k < taps; ++k)
|
2013-01-25 18:47:09 +01:00
|
|
|
sum += src[src_x + k] * filter_x[k];
|
2013-08-20 09:42:25 +02:00
|
|
|
|
|
|
|
dst[x] = ROUND_POWER_OF_TWO(dst[x] +
|
2013-08-23 03:40:34 +02:00
|
|
|
clip_pixel(ROUND_POWER_OF_TWO(sum, FILTER_BITS)), 1);
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* Move to the next source pixel */
|
2013-01-25 18:47:09 +01:00
|
|
|
x_q4 += x_step_q4;
|
|
|
|
}
|
|
|
|
src += src_stride;
|
|
|
|
dst += dst_stride;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
static void convolve_vert_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y0, int y_step_q4,
|
|
|
|
int w, int h, int taps) {
|
2013-08-20 09:42:25 +02:00
|
|
|
int x, y, k;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* NOTE: This assumes that the filter table is 256-byte aligned. */
|
|
|
|
/* TODO(agrange) Modify to make independent of table alignment. */
|
|
|
|
const int16_t *const filter_y_base =
|
|
|
|
(const int16_t *)(((intptr_t)filter_y0) & ~(intptr_t)0xff);
|
2013-01-25 18:47:09 +01:00
|
|
|
|
|
|
|
/* Adjust base pointer address for this source column */
|
|
|
|
src -= src_stride * (taps / 2 - 1);
|
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
for (x = 0; x < w; ++x) {
|
2013-01-25 18:47:09 +01:00
|
|
|
/* Initial phase offset */
|
2013-08-23 01:02:18 +02:00
|
|
|
int y_q4 = (filter_y0 - filter_y_base) / taps;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
|
|
|
for (y = 0; y < h; ++y) {
|
|
|
|
/* Per-pixel src offset */
|
2013-08-23 01:02:18 +02:00
|
|
|
const int src_y = y_q4 >> SUBPEL_BITS;
|
2013-08-20 09:42:25 +02:00
|
|
|
int sum = 0;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* Pointer to filter to use */
|
|
|
|
const int16_t *const filter_y = filter_y_base +
|
|
|
|
(y_q4 & SUBPEL_MASK) * taps;
|
|
|
|
|
2013-08-20 09:42:25 +02:00
|
|
|
for (k = 0; k < taps; ++k)
|
2013-01-25 18:47:09 +01:00
|
|
|
sum += src[(src_y + k) * src_stride] * filter_y[k];
|
2013-08-20 09:42:25 +02:00
|
|
|
|
|
|
|
dst[y * dst_stride] =
|
2013-08-23 03:40:34 +02:00
|
|
|
clip_pixel(ROUND_POWER_OF_TWO(sum, FILTER_BITS));
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* Move to the next source pixel */
|
2013-01-25 18:47:09 +01:00
|
|
|
y_q4 += y_step_q4;
|
|
|
|
}
|
|
|
|
++src;
|
|
|
|
++dst;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
static void convolve_avg_vert_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y0, int y_step_q4,
|
|
|
|
int w, int h, int taps) {
|
2013-08-20 09:42:25 +02:00
|
|
|
int x, y, k;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* NOTE: This assumes that the filter table is 256-byte aligned. */
|
|
|
|
/* TODO(agrange) Modify to make independent of table alignment. */
|
|
|
|
const int16_t *const filter_y_base =
|
|
|
|
(const int16_t *)(((intptr_t)filter_y0) & ~(intptr_t)0xff);
|
2013-01-25 18:47:09 +01:00
|
|
|
|
|
|
|
/* Adjust base pointer address for this source column */
|
|
|
|
src -= src_stride * (taps / 2 - 1);
|
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
for (x = 0; x < w; ++x) {
|
2013-01-25 18:47:09 +01:00
|
|
|
/* Initial phase offset */
|
2013-08-23 01:02:18 +02:00
|
|
|
int y_q4 = (filter_y0 - filter_y_base) / taps;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
|
|
|
for (y = 0; y < h; ++y) {
|
|
|
|
/* Per-pixel src offset */
|
2013-08-23 01:02:18 +02:00
|
|
|
const int src_y = y_q4 >> SUBPEL_BITS;
|
2013-08-20 09:42:25 +02:00
|
|
|
int sum = 0;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* Pointer to filter to use */
|
|
|
|
const int16_t *const filter_y = filter_y_base +
|
|
|
|
(y_q4 & SUBPEL_MASK) * taps;
|
|
|
|
|
2013-08-20 09:42:25 +02:00
|
|
|
for (k = 0; k < taps; ++k)
|
2013-01-25 18:47:09 +01:00
|
|
|
sum += src[(src_y + k) * src_stride] * filter_y[k];
|
2013-08-20 09:42:25 +02:00
|
|
|
|
|
|
|
dst[y * dst_stride] = ROUND_POWER_OF_TWO(dst[y * dst_stride] +
|
2013-08-23 03:40:34 +02:00
|
|
|
clip_pixel(ROUND_POWER_OF_TWO(sum, FILTER_BITS)), 1);
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
/* Move to the next source pixel */
|
2013-01-25 18:47:09 +01:00
|
|
|
y_q4 += y_step_q4;
|
|
|
|
}
|
|
|
|
++src;
|
|
|
|
++dst;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
static void convolve_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h, int taps) {
|
Spatial resamping of ZEROMV predictors
This patch allows coding frames using references of different
resolution, in ZEROMV mode. For compound prediction, either
reference may be scaled.
To test, I use the resize_test and enable WRITE_RECON_BUFFER
in vp9_onyxd_if.c. It's also useful to apply this patch to
test/i420_video_source.h:
--- a/test/i420_video_source.h
+++ b/test/i420_video_source.h
@@ -93,6 +93,7 @@ class I420VideoSource : public VideoSource {
virtual void FillFrame() {
// Read a frame from input_file.
+ if (frame_ != 3)
if (fread(img_->img_data, raw_sz_, 1, input_file_) == 0) {
limit_ = frame_;
}
This forces the frame that the resolution changes on to be coded
with no motion, only scaling, and improves the quality of the
result.
Change-Id: I1ee75d19a437ff801192f767fd02a36bcbd1d496
2013-02-25 05:55:14 +01:00
|
|
|
/* Fixed size intermediate buffer places limits on parameters.
|
2013-04-18 22:05:38 +02:00
|
|
|
* Maximum intermediate_height is 135, for y_step_q4 == 32,
|
|
|
|
* h == 64, taps == 8.
|
Spatial resamping of ZEROMV predictors
This patch allows coding frames using references of different
resolution, in ZEROMV mode. For compound prediction, either
reference may be scaled.
To test, I use the resize_test and enable WRITE_RECON_BUFFER
in vp9_onyxd_if.c. It's also useful to apply this patch to
test/i420_video_source.h:
--- a/test/i420_video_source.h
+++ b/test/i420_video_source.h
@@ -93,6 +93,7 @@ class I420VideoSource : public VideoSource {
virtual void FillFrame() {
// Read a frame from input_file.
+ if (frame_ != 3)
if (fread(img_->img_data, raw_sz_, 1, input_file_) == 0) {
limit_ = frame_;
}
This forces the frame that the resolution changes on to be coded
with no motion, only scaling, and improves the quality of the
result.
Change-Id: I1ee75d19a437ff801192f767fd02a36bcbd1d496
2013-02-25 05:55:14 +01:00
|
|
|
*/
|
2013-04-18 22:05:38 +02:00
|
|
|
uint8_t temp[64 * 135];
|
2013-07-05 12:53:36 +02:00
|
|
|
int intermediate_height = MAX(((h * y_step_q4) >> 4), 1) + taps - 1;
|
Spatial resamping of ZEROMV predictors
This patch allows coding frames using references of different
resolution, in ZEROMV mode. For compound prediction, either
reference may be scaled.
To test, I use the resize_test and enable WRITE_RECON_BUFFER
in vp9_onyxd_if.c. It's also useful to apply this patch to
test/i420_video_source.h:
--- a/test/i420_video_source.h
+++ b/test/i420_video_source.h
@@ -93,6 +93,7 @@ class I420VideoSource : public VideoSource {
virtual void FillFrame() {
// Read a frame from input_file.
+ if (frame_ != 3)
if (fread(img_->img_data, raw_sz_, 1, input_file_) == 0) {
limit_ = frame_;
}
This forces the frame that the resolution changes on to be coded
with no motion, only scaling, and improves the quality of the
result.
Change-Id: I1ee75d19a437ff801192f767fd02a36bcbd1d496
2013-02-25 05:55:14 +01:00
|
|
|
|
2013-04-18 22:05:38 +02:00
|
|
|
assert(w <= 64);
|
|
|
|
assert(h <= 64);
|
2013-01-25 18:47:09 +01:00
|
|
|
assert(taps <= 8);
|
Spatial resamping of ZEROMV predictors
This patch allows coding frames using references of different
resolution, in ZEROMV mode. For compound prediction, either
reference may be scaled.
To test, I use the resize_test and enable WRITE_RECON_BUFFER
in vp9_onyxd_if.c. It's also useful to apply this patch to
test/i420_video_source.h:
--- a/test/i420_video_source.h
+++ b/test/i420_video_source.h
@@ -93,6 +93,7 @@ class I420VideoSource : public VideoSource {
virtual void FillFrame() {
// Read a frame from input_file.
+ if (frame_ != 3)
if (fread(img_->img_data, raw_sz_, 1, input_file_) == 0) {
limit_ = frame_;
}
This forces the frame that the resolution changes on to be coded
with no motion, only scaling, and improves the quality of the
result.
Change-Id: I1ee75d19a437ff801192f767fd02a36bcbd1d496
2013-02-25 05:55:14 +01:00
|
|
|
assert(y_step_q4 <= 32);
|
2013-07-05 12:53:36 +02:00
|
|
|
assert(x_step_q4 <= 32);
|
Spatial resamping of ZEROMV predictors
This patch allows coding frames using references of different
resolution, in ZEROMV mode. For compound prediction, either
reference may be scaled.
To test, I use the resize_test and enable WRITE_RECON_BUFFER
in vp9_onyxd_if.c. It's also useful to apply this patch to
test/i420_video_source.h:
--- a/test/i420_video_source.h
+++ b/test/i420_video_source.h
@@ -93,6 +93,7 @@ class I420VideoSource : public VideoSource {
virtual void FillFrame() {
// Read a frame from input_file.
+ if (frame_ != 3)
if (fread(img_->img_data, raw_sz_, 1, input_file_) == 0) {
limit_ = frame_;
}
This forces the frame that the resolution changes on to be coded
with no motion, only scaling, and improves the quality of the
result.
Change-Id: I1ee75d19a437ff801192f767fd02a36bcbd1d496
2013-02-25 05:55:14 +01:00
|
|
|
|
|
|
|
if (intermediate_height < h)
|
|
|
|
intermediate_height = h;
|
2013-01-25 18:47:09 +01:00
|
|
|
|
2013-08-23 01:02:18 +02:00
|
|
|
convolve_horiz_c(src - src_stride * (taps / 2 - 1), src_stride, temp, 64,
|
|
|
|
filter_x, x_step_q4, filter_y, y_step_q4, w,
|
|
|
|
intermediate_height, taps);
|
|
|
|
convolve_vert_c(temp + 64 * (taps / 2 - 1), 64, dst, dst_stride, filter_x,
|
|
|
|
x_step_q4, filter_y, y_step_q4, w, h, taps);
|
2013-01-25 18:47:09 +01:00
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
void vp9_convolve8_horiz_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h) {
|
|
|
|
convolve_horiz_c(src, src_stride, dst, dst_stride,
|
2013-08-12 23:28:00 +02:00
|
|
|
filter_x, x_step_q4, filter_y, y_step_q4, w, h, 8);
|
2013-01-25 18:47:09 +01:00
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
void vp9_convolve8_avg_horiz_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h) {
|
|
|
|
convolve_avg_horiz_c(src, src_stride, dst, dst_stride,
|
2013-08-12 23:28:00 +02:00
|
|
|
filter_x, x_step_q4, filter_y, y_step_q4, w, h, 8);
|
2013-01-25 18:47:09 +01:00
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
void vp9_convolve8_vert_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h) {
|
|
|
|
convolve_vert_c(src, src_stride, dst, dst_stride,
|
2013-08-12 23:28:00 +02:00
|
|
|
filter_x, x_step_q4, filter_y, y_step_q4, w, h, 8);
|
2013-01-25 18:47:09 +01:00
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
void vp9_convolve8_avg_vert_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h) {
|
|
|
|
convolve_avg_vert_c(src, src_stride, dst, dst_stride,
|
2013-08-12 23:28:00 +02:00
|
|
|
filter_x, x_step_q4, filter_y, y_step_q4, w, h, 8);
|
2013-01-25 18:47:09 +01:00
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
void vp9_convolve8_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h) {
|
|
|
|
convolve_c(src, src_stride, dst, dst_stride,
|
2013-08-12 23:28:00 +02:00
|
|
|
filter_x, x_step_q4, filter_y, y_step_q4, w, h, 8);
|
2013-01-25 18:47:09 +01:00
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
void vp9_convolve8_avg_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
2013-01-25 18:47:09 +01:00
|
|
|
const int16_t *filter_x, int x_step_q4,
|
|
|
|
const int16_t *filter_y, int y_step_q4,
|
|
|
|
int w, int h) {
|
2013-02-12 00:34:08 +01:00
|
|
|
/* Fixed size intermediate buffer places limits on parameters. */
|
2013-04-18 22:05:38 +02:00
|
|
|
DECLARE_ALIGNED_ARRAY(16, uint8_t, temp, 64 * 64);
|
|
|
|
assert(w <= 64);
|
|
|
|
assert(h <= 64);
|
2013-02-12 00:34:08 +01:00
|
|
|
|
2013-08-12 23:28:00 +02:00
|
|
|
vp9_convolve8(src, src_stride, temp, 64,
|
|
|
|
filter_x, x_step_q4, filter_y, y_step_q4, w, h);
|
|
|
|
vp9_convolve_avg(temp, 64, dst, dst_stride, NULL, 0, NULL, 0, w, h);
|
2013-01-25 18:47:09 +01:00
|
|
|
}
|
Convert subpixel filters to use convolve framework
Update the code to call the new convolution functions to do subpixel
prediction rather than the existing functions. Remove the old C and
assembly code, since it is unused. This causes a 50% performance
reduction on the decoder, but that will be resolved when the asm for
the new functions is available.
There is no consensus for whether 6-tap or 2-tap predictors will be
supported in the final codec, so these filters are implemented in
terms of the 8-tap code, so that quality testing of these modes
can continue. Implementing the lower complexity algorithms is a
simple exercise, should it be necessary.
This code produces slightly better results in the EIGHTTAP_SMOOTH
case, since the filter is now applied in only one direction when
the subpel motion is only in one direction. Like the previous code,
the filtering is skipped entirely on full-pel MVs. This combination
seems to give the best quality gains, but this may be indicative of a
bug in the encoder's filter selection, since the encoder could
achieve the result of skipping the filtering on full-pel by selecting
one of the other filters. This should be revisited.
Quality gains on derf positive on almost all clips. The only clip
that seemed to be hurt at all datarates was football
(-0.115% PSNR average, -0.587% min). Overall averages 0.375% PSNR,
0.347% SSIM.
Change-Id: I7d469716091b1d89b4b08adde5863999319d69ff
2013-01-29 01:59:03 +01:00
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
void vp9_convolve_copy_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
|
|
|
const int16_t *filter_x, int filter_x_stride,
|
|
|
|
const int16_t *filter_y, int filter_y_stride,
|
|
|
|
int w, int h) {
|
|
|
|
int r;
|
|
|
|
|
|
|
|
for (r = h; r > 0; --r) {
|
|
|
|
memcpy(dst, src, w);
|
|
|
|
src += src_stride;
|
|
|
|
dst += dst_stride;
|
Convert subpixel filters to use convolve framework
Update the code to call the new convolution functions to do subpixel
prediction rather than the existing functions. Remove the old C and
assembly code, since it is unused. This causes a 50% performance
reduction on the decoder, but that will be resolved when the asm for
the new functions is available.
There is no consensus for whether 6-tap or 2-tap predictors will be
supported in the final codec, so these filters are implemented in
terms of the 8-tap code, so that quality testing of these modes
can continue. Implementing the lower complexity algorithms is a
simple exercise, should it be necessary.
This code produces slightly better results in the EIGHTTAP_SMOOTH
case, since the filter is now applied in only one direction when
the subpel motion is only in one direction. Like the previous code,
the filtering is skipped entirely on full-pel MVs. This combination
seems to give the best quality gains, but this may be indicative of a
bug in the encoder's filter selection, since the encoder could
achieve the result of skipping the filtering on full-pel by selecting
one of the other filters. This should be revisited.
Quality gains on derf positive on almost all clips. The only clip
that seemed to be hurt at all datarates was football
(-0.115% PSNR average, -0.587% min). Overall averages 0.375% PSNR,
0.347% SSIM.
Change-Id: I7d469716091b1d89b4b08adde5863999319d69ff
2013-01-29 01:59:03 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-10 20:17:19 +02:00
|
|
|
void vp9_convolve_avg_c(const uint8_t *src, ptrdiff_t src_stride,
|
|
|
|
uint8_t *dst, ptrdiff_t dst_stride,
|
|
|
|
const int16_t *filter_x, int filter_x_stride,
|
|
|
|
const int16_t *filter_y, int filter_y_stride,
|
|
|
|
int w, int h) {
|
Convert subpixel filters to use convolve framework
Update the code to call the new convolution functions to do subpixel
prediction rather than the existing functions. Remove the old C and
assembly code, since it is unused. This causes a 50% performance
reduction on the decoder, but that will be resolved when the asm for
the new functions is available.
There is no consensus for whether 6-tap or 2-tap predictors will be
supported in the final codec, so these filters are implemented in
terms of the 8-tap code, so that quality testing of these modes
can continue. Implementing the lower complexity algorithms is a
simple exercise, should it be necessary.
This code produces slightly better results in the EIGHTTAP_SMOOTH
case, since the filter is now applied in only one direction when
the subpel motion is only in one direction. Like the previous code,
the filtering is skipped entirely on full-pel MVs. This combination
seems to give the best quality gains, but this may be indicative of a
bug in the encoder's filter selection, since the encoder could
achieve the result of skipping the filtering on full-pel by selecting
one of the other filters. This should be revisited.
Quality gains on derf positive on almost all clips. The only clip
that seemed to be hurt at all datarates was football
(-0.115% PSNR average, -0.587% min). Overall averages 0.375% PSNR,
0.347% SSIM.
Change-Id: I7d469716091b1d89b4b08adde5863999319d69ff
2013-01-29 01:59:03 +01:00
|
|
|
int x, y;
|
|
|
|
|
|
|
|
for (y = 0; y < h; ++y) {
|
2013-08-12 23:28:00 +02:00
|
|
|
for (x = 0; x < w; ++x)
|
|
|
|
dst[x] = ROUND_POWER_OF_TWO(dst[x] + src[x], 1);
|
|
|
|
|
Convert subpixel filters to use convolve framework
Update the code to call the new convolution functions to do subpixel
prediction rather than the existing functions. Remove the old C and
assembly code, since it is unused. This causes a 50% performance
reduction on the decoder, but that will be resolved when the asm for
the new functions is available.
There is no consensus for whether 6-tap or 2-tap predictors will be
supported in the final codec, so these filters are implemented in
terms of the 8-tap code, so that quality testing of these modes
can continue. Implementing the lower complexity algorithms is a
simple exercise, should it be necessary.
This code produces slightly better results in the EIGHTTAP_SMOOTH
case, since the filter is now applied in only one direction when
the subpel motion is only in one direction. Like the previous code,
the filtering is skipped entirely on full-pel MVs. This combination
seems to give the best quality gains, but this may be indicative of a
bug in the encoder's filter selection, since the encoder could
achieve the result of skipping the filtering on full-pel by selecting
one of the other filters. This should be revisited.
Quality gains on derf positive on almost all clips. The only clip
that seemed to be hurt at all datarates was football
(-0.115% PSNR average, -0.587% min). Overall averages 0.375% PSNR,
0.347% SSIM.
Change-Id: I7d469716091b1d89b4b08adde5863999319d69ff
2013-01-29 01:59:03 +01:00
|
|
|
src += src_stride;
|
|
|
|
dst += dst_stride;
|
|
|
|
}
|
|
|
|
}
|