2 * linear least squares model
4 * Copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at>
6 * This file is part of FFmpeg.
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.
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.
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
25 * linear least squares model
31 #include "attributes.h"
35 av_cold void avpriv_init_lls(LLSModel *m, int indep_count)
37 memset(m, 0, sizeof(LLSModel));
38 m->indep_count = indep_count;
41 void avpriv_update_lls(LLSModel *m, double *var, double decay)
45 for (i = 0; i <= m->indep_count; i++) {
46 for (j = i; j <= m->indep_count; j++) {
47 m->covariance[i][j] *= decay;
48 m->covariance[i][j] += var[i] * var[j];
53 void avpriv_solve_lls(LLSModel *m, double threshold, unsigned short min_order)
56 double (*factor)[MAX_VARS + 1] = (void *) &m->covariance[1][0];
57 double (*covar) [MAX_VARS + 1] = (void *) &m->covariance[1][1];
58 double *covar_y = m->covariance[0];
59 int count = m->indep_count;
61 for (i = 0; i < count; i++) {
62 for (j = i; j < count; j++) {
63 double sum = covar[i][j];
65 for (k = i - 1; k >= 0; k--)
66 sum -= factor[i][k] * factor[j][k];
71 factor[i][i] = sqrt(sum);
73 factor[j][i] = sum / factor[i][i];
78 for (i = 0; i < count; i++) {
79 double sum = covar_y[i + 1];
81 for (k = i - 1; k >= 0; k--)
82 sum -= factor[i][k] * m->coeff[0][k];
84 m->coeff[0][i] = sum / factor[i][i];
87 for (j = count - 1; j >= min_order; j--) {
88 for (i = j; i >= 0; i--) {
89 double sum = m->coeff[0][i];
91 for (k = i + 1; k <= j; k++)
92 sum -= factor[k][i] * m->coeff[j][k];
94 m->coeff[j][i] = sum / factor[i][i];
97 m->variance[j] = covar_y[0];
99 for (i = 0; i <= j; i++) {
100 double sum = m->coeff[j][i] * covar[i][i] - 2 * covar_y[i + 1];
102 for (k = 0; k < i; k++)
103 sum += 2 * m->coeff[j][k] * covar[k][i];
105 m->variance[j] += m->coeff[j][i] * sum;
110 double avpriv_evaluate_lls(LLSModel *m, double *param, int order)
115 for (i = 0; i <= order; i++)
116 out += param[i] * m->coeff[order][i];
121 #if FF_API_LLS_PRIVATE
122 av_cold void av_init_lls(LLSModel *m, int indep_count)
124 avpriv_init_lls(m, indep_count);
126 void av_update_lls(LLSModel *m, double *param, double decay)
128 avpriv_update_lls(m, param, decay);
130 void av_solve_lls(LLSModel *m, double threshold, int min_order)
132 avpriv_solve_lls(m, threshold, min_order);
134 double av_evaluate_lls(LLSModel *m, double *param, int order)
136 return avpriv_evaluate_lls(m, param, order);
138 #endif /* FF_API_LLS_PRIVATE */
152 av_lfg_init(&lfg, 1);
153 avpriv_init_lls(&m, 3);
155 for (i = 0; i < 100; i++) {
159 var[0] = (av_lfg_get(&lfg) / (double) UINT_MAX - 0.5) * 2;
160 var[1] = var[0] + av_lfg_get(&lfg) / (double) UINT_MAX - 0.5;
161 var[2] = var[1] + av_lfg_get(&lfg) / (double) UINT_MAX - 0.5;
162 var[3] = var[2] + av_lfg_get(&lfg) / (double) UINT_MAX - 0.5;
163 avpriv_update_lls(&m, var, 0.99);
164 avpriv_solve_lls(&m, 0.001, 0);
165 for (order = 0; order < 3; order++) {
166 eval = avpriv_evaluate_lls(&m, var + 1, order);
167 printf("real:%9f order:%d pred:%9f var:%f coeffs:%f %9f %9f\n",
168 var[0], order, eval, sqrt(m.variance[order] / (i + 1)),
169 m.coeff[order][0], m.coeff[order][1],