82ab5ad7 |
/*
* linear least squares model
*
* Copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at>
* |
b78e7197 |
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or |
82ab5ad7 |
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either |
b78e7197 |
* version 2.1 of the License, or (at your option) any later version. |
82ab5ad7 |
* |
b78e7197 |
* FFmpeg is distributed in the hope that it will be useful, |
82ab5ad7 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public |
b78e7197 |
* License along with FFmpeg; if not, write to the Free Software |
e5a389a1 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
82ab5ad7 |
*/
/** |
ba87f080 |
* @file |
82ab5ad7 |
* linear least squares model
*/
#include <math.h>
#include <string.h>
|
1fda184a |
#include "attributes.h" |
50078c1c |
#include "internal.h" |
4da950c0 |
#include "version.h" |
70b8668f |
#include "lls.h" |
82ab5ad7 |
|
579a0fdc |
static void update_lls(LLSModel *m, const double *var) |
fdaf1d06 |
{
int i, j; |
82ab5ad7 |
|
fdaf1d06 |
for (i = 0; i <= m->indep_count; i++) {
for (j = i; j <= m->indep_count; j++) {
m->covariance[i][j] += var[i] * var[j]; |
82ab5ad7 |
}
}
}
|
70b8668f |
void avpriv_solve_lls(LLSModel *m, double threshold, unsigned short min_order) |
fdaf1d06 |
{
int i, j, k; |
502ab21a |
double (*factor)[MAX_VARS_ALIGN] = (void *) &m->covariance[1][0];
double (*covar) [MAX_VARS_ALIGN] = (void *) &m->covariance[1][1]; |
fdaf1d06 |
double *covar_y = m->covariance[0];
int count = m->indep_count;
for (i = 0; i < count; i++) {
for (j = i; j < count; j++) {
double sum = covar[i][j];
|
68e79b27 |
for (k = 0; k <= i-1; k++) |
fdaf1d06 |
sum -= factor[i][k] * factor[j][k];
if (i == j) {
if (sum < threshold)
sum = 1.0;
factor[i][i] = sqrt(sum);
} else {
factor[j][i] = sum / factor[i][i];
} |
82ab5ad7 |
}
} |
fdaf1d06 |
for (i = 0; i < count; i++) {
double sum = covar_y[i + 1];
|
68e79b27 |
for (k = 0; k <= i-1; k++) |
fdaf1d06 |
sum -= factor[i][k] * m->coeff[0][k];
m->coeff[0][i] = sum / factor[i][i]; |
82ab5ad7 |
}
|
fdaf1d06 |
for (j = count - 1; j >= min_order; j--) {
for (i = j; i >= 0; i--) {
double sum = m->coeff[0][i];
for (k = i + 1; k <= j; k++)
sum -= factor[k][i] * m->coeff[j][k];
m->coeff[j][i] = sum / factor[i][i]; |
408ec4e2 |
} |
82ab5ad7 |
|
fdaf1d06 |
m->variance[j] = covar_y[0];
for (i = 0; i <= j; i++) {
double sum = m->coeff[j][i] * covar[i][i] - 2 * covar_y[i + 1];
for (k = 0; k < i; k++)
sum += 2 * m->coeff[j][k] * covar[k][i];
m->variance[j] += m->coeff[j][i] * sum; |
408ec4e2 |
} |
82ab5ad7 |
}
}
|
579a0fdc |
static double evaluate_lls(LLSModel *m, const double *param, int order) |
fdaf1d06 |
{ |
82ab5ad7 |
int i; |
fdaf1d06 |
double out = 0; |
82ab5ad7 |
|
fdaf1d06 |
for (i = 0; i <= order; i++)
out += param[i] * m->coeff[order][i]; |
82ab5ad7 |
return out;
}
|
70b8668f |
av_cold void avpriv_init_lls(LLSModel *m, int indep_count) |
41578f70 |
{ |
70b8668f |
memset(m, 0, sizeof(LLSModel)); |
41578f70 |
m->indep_count = indep_count;
m->update_lls = update_lls;
m->evaluate_lls = evaluate_lls; |
502ab21a |
if (ARCH_X86)
ff_init_lls_x86(m); |
41578f70 |
} |