normalizer.h 1.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354
  1. /*
  2. Copyright (C) 2015 Marien Raat
  3. This program is free software: you can redistribute it and/or modify
  4. it under the terms of the GNU General Public License as published by
  5. the Free Software Foundation, either version 3 of the License, or
  6. (at your option) any later version.
  7. This program is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. GNU General Public License for more details.
  11. You should have received a copy of the GNU General Public License
  12. along with this program. If not, see <http://www.gnu.org/licenses/>.
  13. */
  14. #pragma once
  15. #include <iostream>
  16. template <typename T>
  17. class Normalizer {
  18. public:
  19. // Normalizes a array of data between the given upper and lower.
  20. // The array needs to contain at least one element.
  21. static void normalize(
  22. // The data array that needs to be normalized
  23. T *data,
  24. // The target to put the normalized array in.
  25. // Can be the same as the data
  26. T *target,
  27. // The size of the data array
  28. unsigned size,
  29. // The lower and upper value, between which the data needs to
  30. // be normalized
  31. T lower,
  32. T upper) {
  33. // Implementation
  34. T max = data[0], min = data[0];
  35. for (int i = 0; i < size; i++) {
  36. min = std::min(min, data[i]);;
  37. max = max > data[i] ? max : data[i];
  38. }
  39. for (int i = 0; i < size; i++) {
  40. target[i] = data[i] - min;
  41. target[i] /= max - min;
  42. target[i] *= (upper - lower);
  43. target[i] += lower;
  44. }
  45. }
  46. };