blob: 923aaaccfe2a523ac687d91f4ba825a57af887d6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
// Copyright (c) the JPEG XL Project Authors. All rights reserved.
//
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Functions for clustering similar histograms together.
#ifndef LIB_JXL_ENC_CLUSTER_H_
#define LIB_JXL_ENC_CLUSTER_H_
#include <stddef.h>
#include <stdint.h>
#include <string.h>
#include <vector>
#include "lib/jxl/ans_params.h"
#include "lib/jxl/enc_ans_params.h"
namespace jxl {
struct Histogram {
Histogram() {
total_count_ = 0;
entropy_ = 0.0;
}
void Clear() {
data_.clear();
total_count_ = 0;
}
void Add(size_t symbol) {
if (data_.size() <= symbol) {
data_.resize(DivCeil(symbol + 1, kRounding) * kRounding);
}
++data_[symbol];
++total_count_;
}
void AddHistogram(const Histogram& other) {
if (other.data_.size() > data_.size()) {
data_.resize(other.data_.size());
}
for (size_t i = 0; i < other.data_.size(); ++i) {
data_[i] += other.data_[i];
}
total_count_ += other.total_count_;
}
size_t alphabet_size() const {
for (int i = data_.size() - 1; i >= 0; --i) {
if (data_[i] > 0) {
return i + 1;
}
}
return 1;
}
float PopulationCost() const;
float ShannonEntropy() const;
std::vector<ANSHistBin> data_;
size_t total_count_;
mutable float entropy_; // WARNING: not kept up-to-date.
static constexpr size_t kRounding = 8;
};
void ClusterHistograms(HistogramParams params, const std::vector<Histogram>& in,
size_t max_histograms, std::vector<Histogram>* out,
std::vector<uint32_t>* histogram_symbols);
} // namespace jxl
#endif // LIB_JXL_ENC_CLUSTER_H_
|