libvmaf-sys 0.4.4

Library bindings for Netflix's VMAF
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113

/**
 *
 *  Copyright 2016-2020 Netflix, Inc.
 *
 *     Licensed under the BSD+Patent License (the "License");
 *     you may not use this file except in compliance with the License.
 *     You may obtain a copy of the License at
 *
 *         https://opensource.org/licenses/BSDplusPatent
 *
 *     Unless required by applicable law or agreed to in writing, software
 *     distributed under the License is distributed on an "AS IS" BASIS,
 *     WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *     See the License for the specific language governing permissions and
 *     limitations under the License.
 *
 */

#pragma once

#ifndef CONVOLUTION_INTERNAL_H_
#define CONVOLUTION_INTERNAL_H_


#include "macros.h"
#include <stdbool.h>

FORCE_INLINE inline float convolution_edge_s(bool horizontal, const float *filter, int filter_width, const float *src, int width, int height, int stride, int i, int j)
{
	int radius = filter_width / 2;

	float accum = 0;
	for (int k = 0; k < filter_width; ++k) {
		int i_tap = horizontal ? i : i - radius + k;
		int j_tap = horizontal ? j - radius + k : j;

		// Handle edges by mirroring.
		if (horizontal) {
			if (j_tap < 0)
				j_tap = -j_tap;
			else if (j_tap >= width)
				j_tap = width - (j_tap - width + 1);
		} else {
			if (i_tap < 0)
				i_tap = -i_tap;
			else if (i_tap >= height)
				i_tap = height - (i_tap - height + 1);
		}

		accum += filter[k] * src[i_tap * stride + j_tap];
	}
	return accum;
}

FORCE_INLINE inline float convolution_edge_sq_s(bool horizontal, const float *filter, int filter_width, const float *src, int width, int height, int stride, int i, int j)
{
	int radius = filter_width / 2;

	float accum = 0;
	float src_val;
	for (int k = 0; k < filter_width; ++k) {
		int i_tap = horizontal ? i : i - radius + k;
		int j_tap = horizontal ? j - radius + k : j;

		// Handle edges by mirroring.
		if (horizontal) {
			if (j_tap < 0)
				j_tap = -j_tap;
			else if (j_tap >= width)
				j_tap = width - (j_tap - width + 1);
		}
		else {
			if (i_tap < 0)
				i_tap = -i_tap;
			else if (i_tap >= height)
				i_tap = height - (i_tap - height + 1);
		}
		src_val = src[i_tap * stride + j_tap];
		accum += filter[k] * (src_val * src_val);
	}
	return accum;
}

FORCE_INLINE inline float convolution_edge_xy_s(bool horizontal, const float *filter, int filter_width, const float *src1, const float *src2, int width, int height, int stride1, int stride2, int i, int j)
{
	int radius = filter_width / 2;

	float accum = 0;
	float src_val1, src_val2;
	for (int k = 0; k < filter_width; ++k) {
		int i_tap = horizontal ? i : i - radius + k;
		int j_tap = horizontal ? j - radius + k : j;

		// Handle edges by mirroring.
		if (horizontal) {
			if (j_tap < 0)
				j_tap = -j_tap;
			else if (j_tap >= width)
				j_tap = width - (j_tap - width + 1);
		}
		else {
			if (i_tap < 0)
				i_tap = -i_tap;
			else if (i_tap >= height)
				i_tap = height - (i_tap - height + 1);
		}
		src_val1 = src1[i_tap * stride1 + j_tap];
		src_val2 = src2[i_tap * stride2 + j_tap];
		accum += filter[k] * (src_val1 * src_val2);
	}
	return accum;
}

#endif // CONVOLUTION_INTERNAL_H_