tesseract v5.3.3.20231005
edgblob.h
Go to the documentation of this file.
1/**********************************************************************
2 * File: edgblob.h (Formerly edgeloop.h)
3 * Description: Functions to clean up an outline before approximation.
4 * Author: Ray Smith
5 *
6 * (C) Copyright 1991, Hewlett-Packard Ltd.
7 ** Licensed under the Apache License, Version 2.0 (the "License");
8 ** you may not use this file except in compliance with the License.
9 ** You may obtain a copy of the License at
10 ** http://www.apache.org/licenses/LICENSE-2.0
11 ** Unless required by applicable law or agreed to in writing, software
12 ** distributed under the License is distributed on an "AS IS" BASIS,
13 ** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 ** See the License for the specific language governing permissions and
15 ** limitations under the License.
16 *
17 **********************************************************************/
18
19#ifndef EDGBLOB_H
20#define EDGBLOB_H
21
22#include "coutln.h" // for C_OUTLINE
23#include "ocrblock.h" // for BLOCK
24#include "points.h" // for ICOORD
25
26#include <vector>
27
28namespace tesseract {
29
31public:
32 OL_BUCKETS( // constructor
33 ICOORD bleft, // corners
34 ICOORD tright);
35
36 C_OUTLINE_LIST *operator()( // array access
37 TDimension x, // image coords
39 // first non-empty bucket
40 C_OUTLINE_LIST *start_scan();
41 // next non-empty bucket
42 C_OUTLINE_LIST *scan_next();
43 int32_t count_children( // recursive sum
44 C_OUTLINE *outline, // parent outline
45 int32_t max_count); // max output
46 int32_t outline_complexity( // new version of count_children
47 C_OUTLINE *outline, // parent outline
48 int32_t max_count, // max output
49 int16_t depth); // level of recursion
50 void extract_children( // single level get
51 C_OUTLINE *outline, // parent outline
52 C_OUTLINE_IT *it); // destination iterator
53
54private:
55 int16_t bxdim; // size of array
56 int16_t bydim;
57 std::vector<C_OUTLINE_LIST> buckets; // array of buckets
58 ICOORD bl; // corners
59 ICOORD tr;
60 decltype(buckets)::iterator it; // for extraction scan
61
62 C_OUTLINE_LIST *scan_next(decltype(buckets)::iterator it);
63};
64
65void extract_edges(Image pix, // thresholded image
66 BLOCK *block); // block to scan
67void outlines_to_blobs( // find blobs
68 BLOCK *block, // block to scan
69 ICOORD bleft, // block box //outlines in block
70 ICOORD tright, C_OUTLINE_LIST *outlines);
71
72} // namespace tesseract
73
74#endif
const double y
void outlines_to_blobs(BLOCK *block, ICOORD bleft, ICOORD tright, C_OUTLINE_LIST *outlines)
Definition: edgblob.cpp:460
int16_t TDimension
Definition: tesstypes.h:32
void extract_edges(Image pix, BLOCK *block)
Definition: edgblob.cpp:347
integer coordinate
Definition: points.h:36
void extract_children(C_OUTLINE *outline, C_OUTLINE_IT *it)
Definition: edgblob.cpp:318
OL_BUCKETS(ICOORD bleft, ICOORD tright)
Definition: edgblob.cpp:64
C_OUTLINE_LIST * start_scan()
Definition: edgblob.cpp:86
C_OUTLINE_LIST * scan_next()
Definition: edgblob.cpp:90
int32_t outline_complexity(C_OUTLINE *outline, int32_t max_count, int16_t depth)
Definition: edgblob.cpp:121
int32_t count_children(C_OUTLINE *outline, int32_t max_count)
Definition: edgblob.cpp:195
C_OUTLINE_LIST * operator()(TDimension x, TDimension y)
Definition: edgblob.cpp:79