You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

80 lines
2.8KB

  1. /*
  2. * This file is part of Libav.
  3. *
  4. * Libav is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU Lesser General Public
  6. * License as published by the Free Software Foundation; either
  7. * version 2.1 of the License, or (at your option) any later version.
  8. *
  9. * Libav is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * Lesser General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU Lesser General Public
  15. * License along with Libav; if not, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #include <stdio.h>
  19. #include "libavutil/common.h"
  20. #include "libavutil/lfg.h"
  21. #include "libavdevice/timefilter.h"
  22. #define LFG_MAX ((1LL << 32) - 1)
  23. int main(void)
  24. {
  25. AVLFG prng;
  26. double n0, n1;
  27. #define SAMPLES 1000
  28. double ideal[SAMPLES];
  29. double samples[SAMPLES];
  30. for (n0 = 0; n0 < 40; n0 = 2 * n0 + 1) {
  31. for (n1 = 0; n1 < 10; n1 = 2 * n1 + 1) {
  32. double best_error = 1000000000;
  33. double bestpar0 = 1;
  34. double bestpar1 = 0.001;
  35. int better, i;
  36. av_lfg_init(&prng, 123);
  37. for (i = 0; i < SAMPLES; i++) {
  38. ideal[i] = 10 + i + n1 * i / (1000);
  39. samples[i] = ideal[i] + n0 * (av_lfg_get(&prng) - LFG_MAX / 2) / (LFG_MAX * 10LL);
  40. }
  41. do {
  42. double par0, par1;
  43. better = 0;
  44. for (par0 = bestpar0 * 0.8; par0 <= bestpar0 * 1.21; par0 += bestpar0 * 0.05) {
  45. for (par1 = bestpar1 * 0.8; par1 <= bestpar1 * 1.21; par1 += bestpar1 * 0.05) {
  46. double error = 0;
  47. TimeFilter *tf = ff_timefilter_new(1, par0, par1);
  48. if (!tf) {
  49. printf("Could not allocate memory for timefilter.\n");
  50. exit(1);
  51. }
  52. for (i = 0; i < SAMPLES; i++) {
  53. double filtered;
  54. filtered = ff_timefilter_update(tf, samples[i], 1);
  55. error += (filtered - ideal[i]) * (filtered - ideal[i]);
  56. }
  57. ff_timefilter_destroy(tf);
  58. if (error < best_error) {
  59. best_error = error;
  60. bestpar0 = par0;
  61. bestpar1 = par1;
  62. better = 1;
  63. }
  64. }
  65. }
  66. } while (better);
  67. printf(" [%f %f %9f]", bestpar0, bestpar1, best_error);
  68. }
  69. printf("\n");
  70. }
  71. return 0;
  72. }