vp9_blockiness.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135
  1. /*
  2. * Copyright (c) 2014 The WebM project authors. All Rights Reserved.
  3. *
  4. * Use of this source code is governed by a BSD-style license
  5. * that can be found in the LICENSE file in the root of the source
  6. * tree. An additional intellectual property rights grant can be found
  7. * in the file PATENTS. All contributing project authors may
  8. * be found in the AUTHORS file in the root of the source tree.
  9. */
  10. #include <stdlib.h>
  11. #include "vpx/vpx_integer.h"
  12. #include "vpx_ports/system_state.h"
  13. #include "vp9/encoder/vp9_blockiness.h"
  14. static int horizontal_filter(const uint8_t *s) {
  15. return (s[1] - s[-2]) * 2 + (s[-1] - s[0]) * 6;
  16. }
  17. static int vertical_filter(const uint8_t *s, int p) {
  18. return (s[p] - s[-2 * p]) * 2 + (s[-p] - s[0]) * 6;
  19. }
  20. static int variance(int sum, int sum_squared, int size) {
  21. return sum_squared / size - (sum / size) * (sum / size);
  22. }
  23. // Calculate a blockiness level for a vertical block edge.
  24. // This function returns a new blockiness metric that's defined as
  25. // p0 p1 p2 p3
  26. // q0 q1 q2 q3
  27. // block edge ->
  28. // r0 r1 r2 r3
  29. // s0 s1 s2 s3
  30. // blockiness = p0*-2+q0*6+r0*-6+s0*2 +
  31. // p1*-2+q1*6+r1*-6+s1*2 +
  32. // p2*-2+q2*6+r2*-6+s2*2 +
  33. // p3*-2+q3*6+r3*-6+s3*2 ;
  34. // reconstructed_blockiness = abs(blockiness from reconstructed buffer -
  35. // blockiness from source buffer,0)
  36. //
  37. // I make the assumption that flat blocks are much more visible than high
  38. // contrast blocks. As such, I scale the result of the blockiness calc
  39. // by dividing the blockiness by the variance of the pixels on either side
  40. // of the edge as follows:
  41. // var_0 = (q0^2+q1^2+q2^2+q3^2) - ((q0 + q1 + q2 + q3) / 4 )^2
  42. // var_1 = (r0^2+r1^2+r2^2+r3^2) - ((r0 + r1 + r2 + r3) / 4 )^2
  43. // The returned blockiness is the scaled value
  44. // Reconstructed blockiness / ( 1 + var_0 + var_1 ) ;
  45. static int blockiness_vertical(const uint8_t *s, int sp, const uint8_t *r,
  46. int rp, int size) {
  47. int s_blockiness = 0;
  48. int r_blockiness = 0;
  49. int sum_0 = 0;
  50. int sum_sq_0 = 0;
  51. int sum_1 = 0;
  52. int sum_sq_1 = 0;
  53. int i;
  54. int var_0;
  55. int var_1;
  56. for (i = 0; i < size; ++i, s += sp, r += rp) {
  57. s_blockiness += horizontal_filter(s);
  58. r_blockiness += horizontal_filter(r);
  59. sum_0 += s[0];
  60. sum_sq_0 += s[0] * s[0];
  61. sum_1 += s[-1];
  62. sum_sq_1 += s[-1] * s[-1];
  63. }
  64. var_0 = variance(sum_0, sum_sq_0, size);
  65. var_1 = variance(sum_1, sum_sq_1, size);
  66. r_blockiness = abs(r_blockiness);
  67. s_blockiness = abs(s_blockiness);
  68. if (r_blockiness > s_blockiness)
  69. return (r_blockiness - s_blockiness) / (1 + var_0 + var_1);
  70. else
  71. return 0;
  72. }
  73. // Calculate a blockiness level for a horizontal block edge
  74. // same as above.
  75. static int blockiness_horizontal(const uint8_t *s, int sp, const uint8_t *r,
  76. int rp, int size) {
  77. int s_blockiness = 0;
  78. int r_blockiness = 0;
  79. int sum_0 = 0;
  80. int sum_sq_0 = 0;
  81. int sum_1 = 0;
  82. int sum_sq_1 = 0;
  83. int i;
  84. int var_0;
  85. int var_1;
  86. for (i = 0; i < size; ++i, ++s, ++r) {
  87. s_blockiness += vertical_filter(s, sp);
  88. r_blockiness += vertical_filter(r, rp);
  89. sum_0 += s[0];
  90. sum_sq_0 += s[0] * s[0];
  91. sum_1 += s[-sp];
  92. sum_sq_1 += s[-sp] * s[-sp];
  93. }
  94. var_0 = variance(sum_0, sum_sq_0, size);
  95. var_1 = variance(sum_1, sum_sq_1, size);
  96. r_blockiness = abs(r_blockiness);
  97. s_blockiness = abs(s_blockiness);
  98. if (r_blockiness > s_blockiness)
  99. return (r_blockiness - s_blockiness) / (1 + var_0 + var_1);
  100. else
  101. return 0;
  102. }
  103. // This function returns the blockiness for the entire frame currently by
  104. // looking at all borders in steps of 4.
  105. double vp9_get_blockiness(const uint8_t *img1, int img1_pitch,
  106. const uint8_t *img2, int img2_pitch, int width,
  107. int height) {
  108. double blockiness = 0;
  109. int i, j;
  110. vpx_clear_system_state();
  111. for (i = 0; i < height;
  112. i += 4, img1 += img1_pitch * 4, img2 += img2_pitch * 4) {
  113. for (j = 0; j < width; j += 4) {
  114. if (i > 0 && i < height && j > 0 && j < width) {
  115. blockiness +=
  116. blockiness_vertical(img1 + j, img1_pitch, img2 + j, img2_pitch, 4);
  117. blockiness += blockiness_horizontal(img1 + j, img1_pitch, img2 + j,
  118. img2_pitch, 4);
  119. }
  120. }
  121. }
  122. blockiness /= width * height / 16;
  123. return blockiness;
  124. }