| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * linear least squares model | ||
| 3 | * | ||
| 4 | * Copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at> | ||
| 5 | * | ||
| 6 | * This file is part of FFmpeg. | ||
| 7 | * | ||
| 8 | * FFmpeg is free software; you can redistribute it and/or | ||
| 9 | * modify it under the terms of the GNU Lesser General Public | ||
| 10 | * License as published by the Free Software Foundation; either | ||
| 11 | * version 2.1 of the License, or (at your option) any later version. | ||
| 12 | * | ||
| 13 | * FFmpeg is distributed in the hope that it will be useful, | ||
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
| 16 | * Lesser General Public License for more details. | ||
| 17 | * | ||
| 18 | * You should have received a copy of the GNU Lesser General Public | ||
| 19 | * License along with FFmpeg; if not, write to the Free Software | ||
| 20 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
| 21 | */ | ||
| 22 | |||
| 23 | /** | ||
| 24 | * @file | ||
| 25 | * linear least squares model | ||
| 26 | */ | ||
| 27 | |||
| 28 | #include <math.h> | ||
| 29 | #include <string.h> | ||
| 30 | |||
| 31 | #include "config.h" | ||
| 32 | #include "attributes.h" | ||
| 33 | #include "lls.h" | ||
| 34 | |||
| 35 | 836444 | static void update_lls(LLSModel *m, const double *var) | |
| 36 | { | ||
| 37 | int i, j; | ||
| 38 | |||
| 39 |
2/2✓ Branch 0 taken 7527996 times.
✓ Branch 1 taken 836444 times.
|
8364440 | for (i = 0; i <= m->indep_count; i++) { |
| 40 |
2/2✓ Branch 0 taken 37639980 times.
✓ Branch 1 taken 7527996 times.
|
45167976 | for (j = i; j <= m->indep_count; j++) { |
| 41 | 37639980 | m->covariance[i][j] += var[i] * var[j]; | |
| 42 | } | ||
| 43 | } | ||
| 44 | 836444 | } | |
| 45 | |||
| 46 | 182 | void avpriv_solve_lls(LLSModel *m, double threshold, unsigned short min_order) | |
| 47 | { | ||
| 48 | int i, j, k; | ||
| 49 | 182 | double (*factor)[MAX_VARS_ALIGN] = (void *) &m->covariance[1][0]; | |
| 50 | 182 | double (*covar) [MAX_VARS_ALIGN] = (void *) &m->covariance[1][1]; | |
| 51 | 182 | double *covar_y = m->covariance[0]; | |
| 52 | 182 | int count = m->indep_count; | |
| 53 | |||
| 54 |
2/2✓ Branch 0 taken 1456 times.
✓ Branch 1 taken 182 times.
|
1638 | for (i = 0; i < count; i++) { |
| 55 |
2/2✓ Branch 0 taken 6552 times.
✓ Branch 1 taken 1456 times.
|
8008 | for (j = i; j < count; j++) { |
| 56 | 6552 | double sum = covar[i][j]; | |
| 57 | |||
| 58 |
2/2✓ Branch 0 taken 15288 times.
✓ Branch 1 taken 6552 times.
|
21840 | for (k = 0; k <= i-1; k++) |
| 59 | 15288 | sum -= factor[i][k] * factor[j][k]; | |
| 60 | |||
| 61 |
2/2✓ Branch 0 taken 1456 times.
✓ Branch 1 taken 5096 times.
|
6552 | if (i == j) { |
| 62 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 1456 times.
|
1456 | if (sum < threshold) |
| 63 | ✗ | sum = 1.0; | |
| 64 | 1456 | factor[i][i] = sqrt(sum); | |
| 65 | } else { | ||
| 66 | 5096 | factor[j][i] = sum / factor[i][i]; | |
| 67 | } | ||
| 68 | } | ||
| 69 | } | ||
| 70 | |||
| 71 |
2/2✓ Branch 0 taken 1456 times.
✓ Branch 1 taken 182 times.
|
1638 | for (i = 0; i < count; i++) { |
| 72 | 1456 | double sum = covar_y[i + 1]; | |
| 73 | |||
| 74 |
2/2✓ Branch 0 taken 5096 times.
✓ Branch 1 taken 1456 times.
|
6552 | for (k = 0; k <= i-1; k++) |
| 75 | 5096 | sum -= factor[i][k] * m->coeff[0][k]; | |
| 76 | |||
| 77 | 1456 | m->coeff[0][i] = sum / factor[i][i]; | |
| 78 | } | ||
| 79 | |||
| 80 |
2/2✓ Branch 0 taken 1456 times.
✓ Branch 1 taken 182 times.
|
1638 | for (j = count - 1; j >= min_order; j--) { |
| 81 |
2/2✓ Branch 0 taken 6552 times.
✓ Branch 1 taken 1456 times.
|
8008 | for (i = j; i >= 0; i--) { |
| 82 | 6552 | double sum = m->coeff[0][i]; | |
| 83 | |||
| 84 |
2/2✓ Branch 0 taken 15288 times.
✓ Branch 1 taken 6552 times.
|
21840 | for (k = i + 1; k <= j; k++) |
| 85 | 15288 | sum -= factor[k][i] * m->coeff[j][k]; | |
| 86 | |||
| 87 | 6552 | m->coeff[j][i] = sum / factor[i][i]; | |
| 88 | } | ||
| 89 | |||
| 90 | 1456 | m->variance[j] = covar_y[0]; | |
| 91 | |||
| 92 |
2/2✓ Branch 0 taken 6552 times.
✓ Branch 1 taken 1456 times.
|
8008 | for (i = 0; i <= j; i++) { |
| 93 | 6552 | double sum = m->coeff[j][i] * covar[i][i] - 2 * covar_y[i + 1]; | |
| 94 | |||
| 95 |
2/2✓ Branch 0 taken 15288 times.
✓ Branch 1 taken 6552 times.
|
21840 | for (k = 0; k < i; k++) |
| 96 | 15288 | sum += 2 * m->coeff[j][k] * covar[k][i]; | |
| 97 | |||
| 98 | 6552 | m->variance[j] += m->coeff[j][i] * sum; | |
| 99 | } | ||
| 100 | } | ||
| 101 | 182 | } | |
| 102 | |||
| 103 | 836444 | static double evaluate_lls(LLSModel *m, const double *param, int order) | |
| 104 | { | ||
| 105 | int i; | ||
| 106 | 836444 | double out = 0; | |
| 107 | |||
| 108 |
2/2✓ Branch 0 taken 6691552 times.
✓ Branch 1 taken 836444 times.
|
7527996 | for (i = 0; i <= order; i++) |
| 109 | 6691552 | out += param[i] * m->coeff[order][i]; | |
| 110 | |||
| 111 | 836444 | return out; | |
| 112 | } | ||
| 113 | |||
| 114 | 182 | av_cold void avpriv_init_lls(LLSModel *m, int indep_count) | |
| 115 | { | ||
| 116 | 182 | memset(m, 0, sizeof(LLSModel)); | |
| 117 | 182 | m->indep_count = indep_count; | |
| 118 | 182 | m->update_lls = update_lls; | |
| 119 | 182 | m->evaluate_lls = evaluate_lls; | |
| 120 | #if ARCH_X86 | ||
| 121 | 182 | ff_init_lls_x86(m); | |
| 122 | #endif | ||
| 123 | 182 | } | |
| 124 |