lls.c 4.22 KB
Newer Older
1 2 3 4 5
/*
 * linear least squares model
 *
 * Copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at>
 *
6 7 8
 * This file is part of FFmpeg.
 *
 * FFmpeg is free software; you can redistribute it and/or
9 10
 * modify it under the terms of the GNU Lesser General Public
 * 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 15 16 17 18
 * 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
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 26 27 28 29 30
 * linear least squares model
 */

#include <math.h>
#include <string.h>

31
#include "attributes.h"
32
#include "version.h"
33
#include "lls.h"
34

35
static void update_lls(LLSModel *m, const double *var)
36 37
{
    int i, j;
38

39 40 41
    for (i = 0; i <= m->indep_count; i++) {
        for (j = i; j <= m->indep_count; j++) {
            m->covariance[i][j] += var[i] * var[j];
42 43 44 45
        }
    }
}

46
void avpriv_solve_lls(LLSModel *m, double threshold, unsigned short min_order)
47 48
{
    int i, j, k;
49 50
    double (*factor)[MAX_VARS_ALIGN] = (void *) &m->covariance[1][0];
    double (*covar) [MAX_VARS_ALIGN] = (void *) &m->covariance[1][1];
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
    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];

            for (k = i - 1; k >= 0; k--)
                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];
            }
68 69
        }
    }
70 71 72 73 74 75 76 77

    for (i = 0; i < count; i++) {
        double sum = covar_y[i + 1];

        for (k = i - 1; k >= 0; k--)
            sum -= factor[i][k] * m->coeff[0][k];

        m->coeff[0][i] = sum / factor[i][i];
78 79
    }

80 81 82 83 84 85 86 87
    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];
88
        }
89

90 91 92 93 94 95 96 97 98
        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;
99
        }
100 101 102
    }
}

103
static double evaluate_lls(LLSModel *m, const double *param, int order)
104
{
105
    int i;
106
    double out = 0;
107

108 109
    for (i = 0; i <= order; i++)
        out += param[i] * m->coeff[order][i];
110 111 112 113

    return out;
}

114
av_cold void avpriv_init_lls(LLSModel *m, int indep_count)
115
{
116
    memset(m, 0, sizeof(LLSModel));
117 118 119
    m->indep_count = indep_count;
    m->update_lls = update_lls;
    m->evaluate_lls = evaluate_lls;
120 121
    if (ARCH_X86)
        ff_init_lls_x86(m);
122 123
}

124 125 126
#ifdef TEST

#include <stdio.h>
127 128
#include <limits.h>
#include "lfg.h"
129

130 131
int main(void)
{
132
    LLSModel m;
133
    int i, order;
134
    AVLFG lfg;
135

136
    av_lfg_init(&lfg, 1);
137
    avpriv_init_lls(&m, 3);
138

139
    for (i = 0; i < 100; i++) {
140
        LOCAL_ALIGNED(32, double, var, [4]);
141
        double eval;
142

143 144 145 146
        var[0] = (av_lfg_get(&lfg) / (double) UINT_MAX - 0.5) * 2;
        var[1] = var[0] + av_lfg_get(&lfg) / (double) UINT_MAX - 0.5;
        var[2] = var[1] + av_lfg_get(&lfg) / (double) UINT_MAX - 0.5;
        var[3] = var[2] + av_lfg_get(&lfg) / (double) UINT_MAX - 0.5;
147
        m.update_lls(&m, var);
148
        avpriv_solve_lls(&m, 0.001, 0);
149
        for (order = 0; order < 3; order++) {
150
            eval = m.evaluate_lls(&m, var + 1, order);
151
            printf("real:%9f order:%d pred:%9f var:%f coeffs:%f %9f %9f\n",
152 153 154
                   var[0], order, eval, sqrt(m.variance[order] / (i + 1)),
                   m.coeff[order][0], m.coeff[order][1],
                   m.coeff[order][2]);
155
        }
156 157 158 159 160
    }
    return 0;
}

#endif