tesseract 4.1.1
Loading...
Searching...
No Matches
MATRIX Class Reference

#include <matrix.h>

Inheritance diagram for MATRIX:
BandTriMatrix< BLOB_CHOICE_LIST * > GENERIC_2D_ARRAY< T >

Public Member Functions

 MATRIX (int dimension, int bandwidth)
 
 ~MATRIX () override
 
bool Classified (int col, int row, int wildcard_id) const
 
void IncreaseBandSize (int bandwidth)
 
MATRIXConsumeAndMakeBigger (int ind)
 
MATRIXDeepCopy () const
 
void print (const UNICHARSET &unicharset) const
 
- Public Member Functions inherited from BandTriMatrix< BLOB_CHOICE_LIST * >
 BandTriMatrix (int dim1, int dim2, const BLOB_CHOICE_LIST * &empty)
 
int dimension () const
 
int bandwidth () const
 
int index (int column, int row) const override
 
void AttachOnCorner (BandTriMatrix< BLOB_CHOICE_LIST * > *array2)
 
- Public Member Functions inherited from GENERIC_2D_ARRAY< T >
 GENERIC_2D_ARRAY (int dim1, int dim2, const T &empty, T *array)
 
 GENERIC_2D_ARRAY (int dim1, int dim2, const T &empty)
 
 GENERIC_2D_ARRAY ()
 
 GENERIC_2D_ARRAY (const GENERIC_2D_ARRAY< T > &src)
 
virtual ~GENERIC_2D_ARRAY ()
 
void operator= (const GENERIC_2D_ARRAY< T > &src)
 
void ResizeNoInit (int size1, int size2, int pad=0)
 
void Resize (int size1, int size2, const T &empty)
 
void ResizeWithCopy (int size1, int size2)
 
void Clear ()
 
bool Serialize (FILE *fp) const
 
bool Serialize (tesseract::TFile *fp) const
 
bool DeSerialize (bool swap, FILE *fp)
 
bool DeSerialize (tesseract::TFile *fp)
 
bool SerializeClasses (FILE *fp) const
 
bool DeSerializeClasses (bool swap, FILE *fp)
 
int dim1 () const
 
int dim2 () const
 
virtual int num_elements () const
 
virtual int index (int column, int row) const
 
void put (ICOORD pos, const T &thing)
 
void put (int column, int row, const T &thing)
 
get (ICOORD pos) const
 
get (int column, int row) const
 
const T & operator() (int column, int row) const
 
T & operator() (int column, int row)
 
T * operator[] (int column)
 
const T * operator[] (int column) const
 
void operator+= (const GENERIC_2D_ARRAY< T > &addend)
 
void operator-= (const GENERIC_2D_ARRAY< T > &minuend)
 
void operator+= (const T &addend)
 
void operator*= (const T &factor)
 
void Clip (const T &rangemin, const T &rangemax)
 
bool WithinBounds (const T &rangemin, const T &rangemax) const
 
double Normalize ()
 
Max () const
 
MaxAbs () const
 
void SumSquares (const GENERIC_2D_ARRAY< T > &src, const T &decay_factor)
 
void AdamUpdate (const GENERIC_2D_ARRAY< T > &sum, const GENERIC_2D_ARRAY< T > &sqsum, const T &epsilon)
 
void AssertFinite () const
 
void RotatingTranspose (const int *dims, int num_dims, int src_dim, int dest_dim, GENERIC_2D_ARRAY< T > *result) const
 
void delete_matrix_pointers ()
 

Additional Inherited Members

- Protected Member Functions inherited from GENERIC_2D_ARRAY< T >
bool SerializeSize (FILE *fp) const
 
bool SerializeSize (tesseract::TFile *fp) const
 
bool DeSerializeSize (bool swap, FILE *fp)
 
bool DeSerializeSize (tesseract::TFile *fp)
 
- Protected Attributes inherited from GENERIC_2D_ARRAY< T >
T * array_
 
empty_
 
int dim1_
 
int dim2_
 
int size_allocated_
 

Detailed Description

Definition at line 578 of file matrix.h.

Constructor & Destructor Documentation

◆ MATRIX()

MATRIX::MATRIX ( int  dimension,
int  bandwidth 
)
inline

Definition at line 580 of file matrix.h.

◆ ~MATRIX()

MATRIX::~MATRIX ( )
overridedefault

Member Function Documentation

◆ Classified()

bool MATRIX::Classified ( int  col,
int  row,
int  wildcard_id 
) const

Definition at line 36 of file matrix.cpp.

36 {
37 if (get(col, row) == NOT_CLASSIFIED) return false;
38 BLOB_CHOICE_IT b_it(get(col, row));
39 for (b_it.mark_cycle_pt(); !b_it.cycled_list(); b_it.forward()) {
40 BLOB_CHOICE* choice = b_it.data();
41 if (choice->IsClassified())
42 return true;
43 }
44 return false;
45}
T get(ICOORD pos) const
Definition: matrix.h:231
bool IsClassified() const
Definition: ratngs.h:135

◆ ConsumeAndMakeBigger()

MATRIX * MATRIX::ConsumeAndMakeBigger ( int  ind)

Definition at line 58 of file matrix.cpp.

58 {
59 int dim = dimension();
60 int band_width = bandwidth();
61 // Check to see if bandwidth needs expanding.
62 for (int col = ind; col >= 0 && col > ind - band_width; --col) {
63 if (array_[col * band_width + band_width - 1] != empty_) {
64 ++band_width;
65 break;
66 }
67 }
68 auto* result = new MATRIX(dim + 1, band_width);
69
70 for (int col = 0; col < dim; ++col) {
71 for (int row = col; row < dim && row < col + bandwidth(); ++row) {
72 MATRIX_COORD coord(col, row);
73 coord.MapForSplit(ind);
74 BLOB_CHOICE_LIST* choices = get(col, row);
75 if (choices != nullptr) {
76 // Correct matrix location on each choice.
77 BLOB_CHOICE_IT bc_it(choices);
78 for (bc_it.mark_cycle_pt(); !bc_it.cycled_list(); bc_it.forward()) {
79 BLOB_CHOICE* choice = bc_it.data();
80 choice->set_matrix_cell(coord.col, coord.row);
81 }
82 ASSERT_HOST(coord.Valid(*result));
83 result->put(coord.col, coord.row, choices);
84 }
85 }
86 }
87 delete this;
88 return result;
89}
#define ASSERT_HOST(x)
Definition: errcode.h:88
Definition: matrix.h:578
void set_matrix_cell(int col, int row)
Definition: ratngs.h:153

◆ DeepCopy()

MATRIX * MATRIX::DeepCopy ( ) const

Definition at line 94 of file matrix.cpp.

94 {
95 int dim = dimension();
96 int band_width = bandwidth();
97 auto* result = new MATRIX(dim, band_width);
98 for (int col = 0; col < dim; ++col) {
99 for (int row = col; row < dim && row < col + band_width; ++row) {
100 BLOB_CHOICE_LIST* choices = get(col, row);
101 if (choices != nullptr) {
102 auto* copy_choices = new BLOB_CHOICE_LIST;
103 copy_choices->deep_copy(choices, &BLOB_CHOICE::deep_copy);
104 result->put(col, row, copy_choices);
105 }
106 }
107 }
108 return result;
109}
static BLOB_CHOICE * deep_copy(const BLOB_CHOICE *src)
Definition: ratngs.h:160

◆ IncreaseBandSize()

void MATRIX::IncreaseBandSize ( int  bandwidth)

Definition at line 49 of file matrix.cpp.

49 {
51}
void ResizeWithCopy(int size1, int size2)
Definition: matrix.h:115

◆ print()

void MATRIX::print ( const UNICHARSET unicharset) const

Definition at line 112 of file matrix.cpp.

112 {
113 tprintf("Ratings Matrix (top 3 choices)\n");
114 int dim = dimension();
115 int band_width = bandwidth();
116 int row, col;
117 for (col = 0; col < dim; ++col) {
118 for (row = col; row < dim && row < col + band_width; ++row) {
119 BLOB_CHOICE_LIST *rating = this->get(col, row);
120 if (rating == NOT_CLASSIFIED) continue;
121 BLOB_CHOICE_IT b_it(rating);
122 tprintf("col=%d row=%d ", col, row);
123 for (b_it.mark_cycle_pt(); !b_it.cycled_list(); b_it.forward()) {
124 tprintf("%s rat=%g cert=%g " ,
125 unicharset.id_to_unichar(b_it.data()->unichar_id()),
126 b_it.data()->rating(), b_it.data()->certainty());
127 }
128 tprintf("\n");
129 }
130 tprintf("\n");
131 }
132 tprintf("\n");
133 for (col = 0; col < dim; ++col) tprintf("\t%d", col);
134 tprintf("\n");
135 for (row = 0; row < dim; ++row) {
136 for (col = 0; col <= row; ++col) {
137 if (col == 0) tprintf("%d\t", row);
138 if (row >= col + band_width) {
139 tprintf(" \t");
140 continue;
141 }
142 BLOB_CHOICE_LIST *rating = this->get(col, row);
143 if (rating != NOT_CLASSIFIED) {
144 BLOB_CHOICE_IT b_it(rating);
145 int counter = 0;
146 for (b_it.mark_cycle_pt(); !b_it.cycled_list(); b_it.forward()) {
147 tprintf("%s ",
148 unicharset.id_to_unichar(b_it.data()->unichar_id()));
149 ++counter;
150 if (counter == 3) break;
151 }
152 tprintf("\t");
153 } else {
154 tprintf(" \t");
155 }
156 }
157 tprintf("\n");
158 }
159}
DLLSYM void tprintf(const char *format,...)
Definition: tprintf.cpp:35
const char * id_to_unichar(UNICHAR_ID id) const
Definition: unicharset.cpp:291

The documentation for this class was generated from the following files: