1 // Copyright (C) 2018 Intel Corporation
3 // SPDX-License-Identifier: Apache-2.0
16 #include "data_stats.h"
19 TensorStatistic::TensorStatistic(float* data, size_t count, size_t nbuckets) {
20 _min = std::numeric_limits<float>::max();
21 _max = std::numeric_limits<float>::min();
22 for (size_t i = 0; i < count; i++) {
23 float val = static_cast<float>(data[i]);
38 float TensorStatistic::getMaxValue() const {
43 float TensorStatistic::getMinValue() const {
47 std::vector<std::string> AggregatedDataStats::registeredLayers() {
48 std::vector<std::string> layers;
49 for (auto l : _data) {
50 layers.push_back(l.first);
55 void AggregatedDataStats::registerLayer(std::string layer) {
59 void AggregatedDataStats::addTensorStatistics(const std::string& name, size_t channel, float* data, size_t count) {
60 auto&& byChannel = _data[name];
61 byChannel[channel].push_back(TensorStatistic(data, count));
64 void AggregatedDataStats::addTensorStatistics(const std::string &name, size_t channel, uint8_t *data, size_t count) {
65 std::vector<float> intermediate;
66 for (size_t i = 0; i < count; i++) {
67 intermediate.push_back(data[i]);
69 addTensorStatistics(name, channel, intermediate.data(), count);
72 size_t AggregatedDataStats::getNumberChannels(const std::string& name) const {
73 auto it = _data.find(name);
74 if (it != _data.end()) {
75 return it->second.size();
80 void AggregatedDataStats::getDataMinMax(const std::string& name, size_t channel, float& min, float& max, float threshold) {
82 auto it = _data.find(name);
83 if (it != _data.end()) {
84 auto stats = it->second[channel];
85 // having absolute min/max values, we can create new statistic
86 std::vector<float> maxValues;
87 std::vector<float> minValues;
88 for (size_t i = 0; i < stats.size(); i++) {
89 const TensorStatistic& tsS = stats[i];
90 maxValues.push_back(tsS.getMaxValue());
91 minValues.push_back(tsS.getMinValue());
93 // define number of elements to throw out
94 size_t elementToTake = maxValues.size() * threshold / 100;
95 int elementsToThrow = maxValues.size() - elementToTake;
96 std::sort(maxValues.begin(), maxValues.end());
97 std::sort(minValues.begin(), minValues.end());
99 min = minValues[elementsToThrow];
100 max = maxValues[elementToTake - 1];