Go to the documentation of this file.
27 #ifndef TESSERACT_CCSTRUCT_MATRIX_H_
28 #define TESSERACT_CCSTRUCT_MATRIX_H_
41 class BLOB_CHOICE_LIST;
44 #define NOT_CLASSIFIED static_cast<BLOB_CHOICE_LIST*>(nullptr)
95 int new_size = size1 * size2 + pad;
104 for (
int i = size1 * size2; i < new_size; ++i)
array_[i] =
empty_;
108 void Resize(
int size1,
int size2,
const T& empty) {
117 int new_size = size1 * size2;
118 T* new_array =
new T[new_size];
119 for (
int col = 0; col < size1; ++col) {
120 for (
int row = 0; row < size2; ++row) {
121 int old_index = col *
dim2() + row;
122 int new_index = col * size2 + row;
124 new_array[new_index] =
array_[old_index];
126 new_array[new_index] =
empty_;
141 for (
int i = 0; i < total_size; ++i)
171 for (
int i = 0; i < size; ++i)
187 if (!
empty_.Serialize(fp))
return false;
189 for (
int i = 0; i < size; ++i) {
200 if (!
empty_.DeSerialize(swap, fp))
return false;
202 for (
int i = 0; i < size; ++i) {
218 virtual int index(
int column,
int row)
const {
219 return (column *
dim2_ + row);
226 void put(
int column,
int row,
const T& thing) {
234 T
get(
int column,
int row)
const {
258 for (
int i = 0; i < size; ++i) {
262 for (
int x = 0; x <
dim1_; x++) {
263 for (
int y = 0; y <
dim2_; y++) {
264 (*this)(x, y) += addend(x, y);
274 for (
int i = 0; i < size; ++i) {
278 for (
int x = 0; x <
dim1_; x++) {
279 for (
int y = 0; y <
dim2_; y++) {
280 (*this)(x, y) -= minuend(x, y);
288 for (
int i = 0; i < size; ++i) {
295 for (
int i = 0; i < size; ++i) {
300 void Clip(
const T& rangemin,
const T& rangemax) {
302 for (
int i = 0; i < size; ++i) {
310 for (
int i = 0; i < size; ++i) {
311 const T& value =
array_[i];
312 if (value < rangemin || rangemax < value)
320 if (size <= 0)
return 0.0;
323 for (
int i = 0; i < size; ++i) {
329 for (
int i = 0; i < size; ++i) {
330 double normed =
array_[i] - mean;
332 sd += normed * normed;
334 sd = sqrt(sd / size);
337 for (
int i = 0; i < size; ++i) {
347 if (size <= 0)
return empty_;
350 for (
int i = 1; i < size; ++i) {
351 const T& value =
array_[i];
352 if (value > max_value) max_value = value;
360 if (size <= 0)
return empty_;
362 T max_abs =
static_cast<T
>(0);
363 for (
int i = 0; i < size; ++i) {
364 T value =
static_cast<T
>(fabs(
array_[i]));
365 if (value > max_abs) max_abs = value;
372 T update_factor = 1.0 - decay_factor;
374 for (
int i = 0; i < size; ++i) {
385 for (
int i = 0; i < size; ++i) {
392 for (
int i = 0; i < size; ++i) {
423 int max_d = std::max(src_dim, dest_dim);
424 int min_d = std::min(src_dim, dest_dim);
433 int num_replicas = 1, move_size = 1, src_step = 1;
434 for (
int d = 0; d < min_d; ++d) num_replicas *= dims[d];
435 for (
int d = max_d + 1; d < num_dims; ++d) move_size *= dims[d];
436 for (
int d = src_dim + 1; d < num_dims; ++d) src_step *= dims[d];
437 if (src_dim > dest_dim) src_step *= dims[src_dim];
440 int wrap_size = move_size;
441 for (
int d = min_d; d <= max_d; ++d) wrap_size *= dims[d];
446 for (
int replica = 0; replica < num_replicas; ++replica) {
447 for (
int start = 0; start < src_step; start += move_size) {
448 for (
int pos = start; pos < wrap_size; pos += src_step) {
449 memcpy(
dest, src + pos,
sizeof(*
dest) * move_size);
460 for (
int i = 0; i < size; ++i) {
461 T matrix_cell =
array_[i];
462 if (matrix_cell !=
empty_)
470 uint32_t size =
dim1_;
476 uint32_t size =
dim1_;
484 uint32_t size1, size2;
492 if (size1 > UINT16_MAX)
return false;
493 if (size2 > UINT16_MAX)
return false;
498 int32_t size1, size2;
502 if (size1 > UINT16_MAX)
return false;
503 if (size2 > UINT16_MAX)
return false;
543 int index(
int column,
int row)
const override {
546 return column * this->dim2_ + row - column;
555 int new_dim2 = std::max(this->
dim2_, array2->
dim2_);
556 T* new_array =
new T[new_dim1 * new_dim2];
557 for (
int col = 0; col < new_dim1; ++col) {
558 for (
int j = 0; j < new_dim2; ++j) {
559 int new_index = col * new_dim2 + j;
561 new_array[new_index] = this->
get(col, col + j);
562 }
else if (col >= this->
dim1_ && j < array2->
dim2_) {
563 new_array[new_index] = array2->
get(col - this->
dim1_,
564 col - this->
dim1_ + j);
565 array2->
put(col - this->
dim1_, col - this->
dim1_ + j,
nullptr);
567 new_array[new_index] = this->
empty_;
573 this->
dim1_ = new_dim1;
574 this->
dim2_ = new_dim2;
586 bool Classified(
int col,
int row,
int wildcard_id)
const;
643 #endif // TESSERACT_CCSTRUCT_MATRIX_H_
const T * operator[](int column) const
bool DeSerializeSize(bool swap, FILE *fp)
virtual int num_elements() const
bool SerializeSize(FILE *fp) const
BandTriMatrix(int dim1, int dim2, const T &empty)
MATRIX(int dimension, int bandwidth)
void operator*=(const T &factor)
void MapForSplit(int ind)
void print(const UNICHARSET &unicharset) const
bool Valid(const MATRIX &m) const
void delete_matrix_pointers()
bool DeSerialize(char *data, size_t count=1)
MATRIX * DeepCopy() const
void AttachOnCorner(BandTriMatrix< T > *array2)
int16_t y() const
access_function
T & operator()(int column, int row)
T ClipToRange(const T &x, const T &lower_bound, const T &upper_bound)
void ResizeWithCopy(int size1, int size2)
void IncreaseBandSize(int bandwidth)
bool Serialize(FILE *fp) const
bool SerializeClasses(FILE *fp) const
static void Delete(void *arg)
bool Classified(int col, int row, int wildcard_id) const
void SumSquares(const GENERIC_2D_ARRAY< T > &src, const T &decay_factor)
virtual ~GENERIC_2D_ARRAY()
bool Serialize(FILE *fp, const char *data, size_t n)
bool WithinBounds(const T &rangemin, const T &rangemax) const
MATRIX_COORD(int c, int r)
bool DeSerializeClasses(bool swap, FILE *fp)
void operator=(const GENERIC_2D_ARRAY< T > &src)
void Resize(int size1, int size2, const T &empty)
void put(ICOORD pos, const T &thing)
virtual int index(int column, int row) const
void operator+=(const T &addend)
bool SerializeSize(tesseract::TFile *fp) const
bool DeSerialize(bool swap, FILE *fp)
int index(int column, int row) const override
MATRIX * ConsumeAndMakeBigger(int ind)
void operator-=(const GENERIC_2D_ARRAY< T > &minuend)
const T & operator()(int column, int row) const
bool Serialize(const char *data, size_t count=1)
T get(int column, int row) const
void ResizeNoInit(int size1, int size2, int pad=0)
bool DeSerialize(FILE *fp, char *data, size_t n)
void Clip(const T &rangemin, const T &rangemax)
bool DeSerialize(tesseract::TFile *fp)
GENERIC_2D_ARRAY(const GENERIC_2D_ARRAY< T > &src)
GENERIC_2D_ARRAY(int dim1, int dim2, const T &empty, T *array)
void ReverseN(void *ptr, int num_bytes)
T * operator[](int column)
bool DeSerializeSize(tesseract::TFile *fp)
void AssertFinite() const
void put(int column, int row, const T &thing)
bool Serialize(tesseract::TFile *fp) const
void operator+=(const GENERIC_2D_ARRAY< T > &addend)
int16_t x() const
access function
void AdamUpdate(const GENERIC_2D_ARRAY< T > &sum, const GENERIC_2D_ARRAY< T > &sqsum, const T &epsilon)
GENERIC_2D_ARRAY(int dim1, int dim2, const T &empty)
void RotatingTranspose(const int *dims, int num_dims, int src_dim, int dest_dim, GENERIC_2D_ARRAY< T > *result) const