mirror of
https://github.com/tesseract-ocr/tesseract.git
synced 2024-11-24 19:19:05 +08:00
860 lines
28 KiB
C++
860 lines
28 KiB
C++
|
/**********************************************************************
|
||
|
* File: applybox.cpp (Formerly applybox.c)
|
||
|
* Description: Re segment rows according to box file data
|
||
|
* Author: Phil Cheatle
|
||
|
* Created: Wed Nov 24 09:11:23 GMT 1993
|
||
|
*
|
||
|
* (C) Copyright 1993, Hewlett-Packard Ltd.
|
||
|
** Licensed under the Apache License, Version 2.0 (the "License");
|
||
|
** you may not use this file except in compliance with the License.
|
||
|
** You may obtain a copy of the License at
|
||
|
** http://www.apache.org/licenses/LICENSE-2.0
|
||
|
** Unless required by applicable law or agreed to in writing, software
|
||
|
** distributed under the License is distributed on an "AS IS" BASIS,
|
||
|
** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
|
** See the License for the specific language governing permissions and
|
||
|
** limitations under the License.
|
||
|
*
|
||
|
**********************************************************************/
|
||
|
/*
|
||
|
define SECURE_NAMES for code versions which go to UNLV to stop tessedit
|
||
|
including all the newdiff stuff (which contains lots of text indicating
|
||
|
what measures we are interested in.
|
||
|
*/
|
||
|
/* #define SECURE_NAMES done in secnames.h when necessary*/
|
||
|
|
||
|
#include "mfcpch.h"
|
||
|
#include "applybox.h"
|
||
|
#include <ctype.h>
|
||
|
#include <string.h>
|
||
|
#ifdef __UNIX__
|
||
|
#include <assert.h>
|
||
|
#include <errno.h>
|
||
|
#endif
|
||
|
#include "mainblk.h"
|
||
|
#include "genblob.h"
|
||
|
#include "fixxht.h"
|
||
|
#include "control.h"
|
||
|
#include "tessbox.h"
|
||
|
#include "globals.h"
|
||
|
#include "secname.h"
|
||
|
|
||
|
#define SECURE_NAMES
|
||
|
#ifndef SECURE_NAMES
|
||
|
#include "wordstats.h"
|
||
|
#endif
|
||
|
|
||
|
#define EXTERN
|
||
|
EXTERN BOOL_VAR (applybox_rebalance, TRUE, "Drop dead");
|
||
|
EXTERN INT_VAR (applybox_debug, 0, "Debug level");
|
||
|
EXTERN STRING_VAR (applybox_test_exclusions, "|",
|
||
|
"Chars ignored for testing");
|
||
|
EXTERN double_VAR (applybox_error_band, 0.15, "Err band as fract of xht");
|
||
|
|
||
|
/*************************************************************************
|
||
|
* The code re-assigns outlines to form words each with ONE labelled blob.
|
||
|
* Noise is left in UNLABELLED words. The chars on the page are checked crudely
|
||
|
* for sensible position relative to baseline and xht. Failed boxes are
|
||
|
* compensated for by duplicating other believable instances of the character.
|
||
|
*
|
||
|
* The box file is assumed to contain box definitions, one per line, of the
|
||
|
* following format:
|
||
|
* <Char> <left> <bottom> <right> <top> ... arbitrary trailing fields unused
|
||
|
*
|
||
|
* The approach taken is to search the WHOLE page for stuff overlapping each box.
|
||
|
* - This is not too inefficient and is SAFE.
|
||
|
* - We can detect overlapping blobs as we will be attempting to put a blob
|
||
|
* from a LABELLED word into the current word.
|
||
|
* - When all the boxes have been processed we can detect any stuff which is
|
||
|
* being ignored - it is the unlabelled words left on the page.
|
||
|
*
|
||
|
* A box should only overlap one row.
|
||
|
*
|
||
|
* A warning is given if the box is on the same row as the previous box, but NOT
|
||
|
* on the same row as the previous blob.
|
||
|
*
|
||
|
* Any OUTLINE which overlaps the box is put into the new word.
|
||
|
*
|
||
|
* ascender chars must ascend above xht significantly
|
||
|
* xht chars must not rise above row xht significantly
|
||
|
* bl chars must not descend below baseline significantly
|
||
|
* descender chars must descend below baseline significantly
|
||
|
*
|
||
|
* ?? Certain chars are DROPPED - to limit the training data.
|
||
|
*
|
||
|
*************************************************************************/
|
||
|
|
||
|
void apply_boxes(BLOCK_LIST *block_list //real blocks
|
||
|
) {
|
||
|
INT16 boxfile_lineno = 0;
|
||
|
INT16 boxfile_charno = 0;
|
||
|
BOX box; //boxfile box
|
||
|
char ch[2]; //correct ch from boxfile
|
||
|
ROW *row;
|
||
|
ROW *prev_row = NULL;
|
||
|
INT16 prev_box_right = MAX_INT16;
|
||
|
INT16 block_id;
|
||
|
INT16 row_id;
|
||
|
INT16 box_count = 0;
|
||
|
INT16 box_failures = 0;
|
||
|
INT16 labels_ok;
|
||
|
INT16 rows_ok;
|
||
|
INT16 bad_blobs;
|
||
|
INT16 tgt_char_counts[128]; //No. of box samples
|
||
|
// INT16 labelled_char_counts[128]; //No. of unique labelled samples
|
||
|
INT16 i;
|
||
|
INT16 rebalance_count = 0;
|
||
|
char min_char;
|
||
|
INT16 min_samples;
|
||
|
INT16 final_labelled_blob_count;
|
||
|
|
||
|
for (i = 0; i < 128; i++)
|
||
|
tgt_char_counts[i] = 0;
|
||
|
|
||
|
FILE* box_file;
|
||
|
STRING filename = imagefile;
|
||
|
filename += ".box";
|
||
|
if (!(box_file = fopen (filename.string(), "r"))) {
|
||
|
CANTOPENFILE.error ("read_next_box", EXIT,
|
||
|
"Cant open box file %s %d",
|
||
|
filename.string(), errno);
|
||
|
}
|
||
|
|
||
|
ch[1] = '\0';
|
||
|
clear_any_old_text(block_list);
|
||
|
while (read_next_box (box_file, &box, &ch[0])) {
|
||
|
box_count++;
|
||
|
tgt_char_counts[ch[0]]++;
|
||
|
row = find_row_of_box (block_list, box, block_id, row_id);
|
||
|
if (box.left () < prev_box_right) {
|
||
|
boxfile_lineno++;
|
||
|
boxfile_charno = 1;
|
||
|
}
|
||
|
else
|
||
|
boxfile_charno++;
|
||
|
|
||
|
if (row == NULL) {
|
||
|
box_failures++;
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"FAILURE! box overlaps no blobs or blobs in multiple rows");
|
||
|
}
|
||
|
else {
|
||
|
if ((box.left () >= prev_box_right) && (row != prev_row))
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"WARNING! false row break");
|
||
|
box_failures += resegment_box (row, box, ch, block_id, row_id,
|
||
|
boxfile_lineno, boxfile_charno);
|
||
|
prev_row = row;
|
||
|
}
|
||
|
prev_box_right = box.right ();
|
||
|
}
|
||
|
tidy_up(block_list,
|
||
|
labels_ok,
|
||
|
rows_ok,
|
||
|
bad_blobs,
|
||
|
tgt_char_counts,
|
||
|
rebalance_count,
|
||
|
min_char,
|
||
|
min_samples,
|
||
|
final_labelled_blob_count);
|
||
|
tprintf ("APPLY_BOXES:\n");
|
||
|
tprintf (" Boxes read from boxfile: %6d\n", box_count);
|
||
|
tprintf (" Initially labelled blobs: %6d in %d rows\n",
|
||
|
labels_ok, rows_ok);
|
||
|
tprintf (" Box failures detected: %6d\n", box_failures);
|
||
|
tprintf (" Duped blobs for rebalance:%6d\n", rebalance_count);
|
||
|
tprintf (" \"%c\" has fewest samples:%6d\n", min_char, min_samples);
|
||
|
tprintf (" Total unlabelled words: %6d\n",
|
||
|
bad_blobs);
|
||
|
tprintf (" Final labelled words: %6d\n",
|
||
|
final_labelled_blob_count);
|
||
|
}
|
||
|
|
||
|
|
||
|
void clear_any_old_text( //remove correct text
|
||
|
BLOCK_LIST *block_list //real blocks
|
||
|
) {
|
||
|
BLOCK_IT block_it(block_list);
|
||
|
ROW_IT row_it;
|
||
|
WERD_IT word_it;
|
||
|
|
||
|
for (block_it.mark_cycle_pt ();
|
||
|
!block_it.cycled_list (); block_it.forward ()) {
|
||
|
row_it.set_to_list (block_it.data ()->row_list ());
|
||
|
for (row_it.mark_cycle_pt (); !row_it.cycled_list (); row_it.forward ()) {
|
||
|
word_it.set_to_list (row_it.data ()->word_list ());
|
||
|
for (word_it.mark_cycle_pt ();
|
||
|
!word_it.cycled_list (); word_it.forward ()) {
|
||
|
word_it.data ()->set_text ("");
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
|
||
|
BOOL8 read_next_box(FILE* box_file, //
|
||
|
BOX *box,
|
||
|
char *ch) {
|
||
|
char buff[256]; //boxfile read buffer
|
||
|
char *buffptr = buff;
|
||
|
STRING box_filename;
|
||
|
static INT16 line = 0;
|
||
|
INT32 x_min;
|
||
|
INT32 y_min;
|
||
|
INT32 x_max;
|
||
|
INT32 y_max;
|
||
|
INT32 count = 0;
|
||
|
|
||
|
while (!feof (box_file)) {
|
||
|
fgets (buff, sizeof (buff) - 1, box_file);
|
||
|
line++;
|
||
|
|
||
|
/* Check for blank lines in box file */
|
||
|
for (buffptr = buff; isspace (*buffptr); buffptr++)
|
||
|
;
|
||
|
if (*buffptr != '\0') {
|
||
|
count =
|
||
|
sscanf (buff,
|
||
|
"%c " INT32FORMAT " " INT32FORMAT " " INT32FORMAT " "
|
||
|
INT32FORMAT, ch, &x_min, &y_min, &x_max, &y_max);
|
||
|
if (count != 5) {
|
||
|
tprintf ("Box file format error on line %i ignored\n", line);
|
||
|
}
|
||
|
else {
|
||
|
*box = BOX (ICOORD (x_min, y_min), ICOORD (x_max, y_max));
|
||
|
return TRUE; //read a box ok
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
return FALSE; //EOF
|
||
|
}
|
||
|
|
||
|
|
||
|
ROW *find_row_of_box( //
|
||
|
BLOCK_LIST *block_list, //real blocks
|
||
|
BOX box, //from boxfile
|
||
|
INT16 &block_id,
|
||
|
INT16 &row_id_to_process) {
|
||
|
BLOCK_IT block_it(block_list);
|
||
|
BLOCK *block;
|
||
|
ROW_IT row_it;
|
||
|
ROW *row;
|
||
|
ROW *row_to_process = NULL;
|
||
|
INT16 row_id;
|
||
|
WERD_IT word_it;
|
||
|
WERD *word;
|
||
|
BOOL8 polyg;
|
||
|
PBLOB_IT blob_it;
|
||
|
PBLOB *blob;
|
||
|
OUTLINE_IT outline_it;
|
||
|
OUTLINE *outline;
|
||
|
|
||
|
/*
|
||
|
Find row to process - error if box REALLY overlaps more than one row. (I.e
|
||
|
it overlaps blobs in the row - not just overlaps the bounding box of the
|
||
|
whole row.)
|
||
|
*/
|
||
|
|
||
|
block_id = 0;
|
||
|
for (block_it.mark_cycle_pt ();
|
||
|
!block_it.cycled_list (); block_it.forward ()) {
|
||
|
block_id++;
|
||
|
row_id = 0;
|
||
|
block = block_it.data ();
|
||
|
if (block->bounding_box ().overlap (box)) {
|
||
|
row_it.set_to_list (block->row_list ());
|
||
|
for (row_it.mark_cycle_pt ();
|
||
|
!row_it.cycled_list (); row_it.forward ()) {
|
||
|
row_id++;
|
||
|
row = row_it.data ();
|
||
|
if (row->bounding_box ().overlap (box)) {
|
||
|
word_it.set_to_list (row->word_list ());
|
||
|
for (word_it.mark_cycle_pt ();
|
||
|
!word_it.cycled_list (); word_it.forward ()) {
|
||
|
word = word_it.data ();
|
||
|
polyg = word->flag (W_POLYGON);
|
||
|
if (word->bounding_box ().overlap (box)) {
|
||
|
blob_it.set_to_list (word->gblob_list ());
|
||
|
for (blob_it.mark_cycle_pt ();
|
||
|
!blob_it.cycled_list (); blob_it.forward ()) {
|
||
|
blob = blob_it.data ();
|
||
|
if (gblob_bounding_box (blob, polyg).
|
||
|
overlap (box)) {
|
||
|
outline_it.
|
||
|
set_to_list (gblob_out_list
|
||
|
(blob, polyg));
|
||
|
for (outline_it.mark_cycle_pt ();
|
||
|
!outline_it.cycled_list ();
|
||
|
outline_it.forward ()) {
|
||
|
outline = outline_it.data ();
|
||
|
if (goutline_bounding_box
|
||
|
(outline, polyg).major_overlap (box)) {
|
||
|
if ((row_to_process == NULL) ||
|
||
|
(row_to_process == row)) {
|
||
|
row_to_process = row;
|
||
|
row_id_to_process = row_id;
|
||
|
}
|
||
|
else
|
||
|
/* RETURN ERROR Box overlaps blobs in more than one row */
|
||
|
return NULL;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
return row_to_process;
|
||
|
}
|
||
|
|
||
|
|
||
|
INT16 resegment_box( //
|
||
|
ROW *row,
|
||
|
BOX box,
|
||
|
char *ch,
|
||
|
INT16 block_id,
|
||
|
INT16 row_id,
|
||
|
INT16 boxfile_lineno,
|
||
|
INT16 boxfile_charno) {
|
||
|
WERD_IT word_it;
|
||
|
WERD *word;
|
||
|
WERD *new_word = NULL;
|
||
|
BOOL8 polyg = false;
|
||
|
PBLOB_IT blob_it;
|
||
|
PBLOB_IT new_blob_it;
|
||
|
PBLOB *blob;
|
||
|
PBLOB *new_blob;
|
||
|
OUTLINE_IT outline_it;
|
||
|
OUTLINE_LIST dummy; // Just to initialize new_outline_it.
|
||
|
OUTLINE_IT new_outline_it = &dummy;
|
||
|
OUTLINE *outline;
|
||
|
BOX new_word_box;
|
||
|
float word_x_centre;
|
||
|
float baseline;
|
||
|
INT16 error_count = 0; //number of chars lost
|
||
|
|
||
|
word_it.set_to_list (row->word_list ());
|
||
|
for (word_it.mark_cycle_pt (); !word_it.cycled_list (); word_it.forward ()) {
|
||
|
word = word_it.data ();
|
||
|
polyg = word->flag (W_POLYGON);
|
||
|
if (word->bounding_box ().overlap (box)) {
|
||
|
blob_it.set_to_list (word->gblob_list ());
|
||
|
for (blob_it.mark_cycle_pt ();
|
||
|
!blob_it.cycled_list (); blob_it.forward ()) {
|
||
|
blob = blob_it.data ();
|
||
|
if (gblob_bounding_box (blob, polyg).overlap (box)) {
|
||
|
outline_it.set_to_list (gblob_out_list (blob, polyg));
|
||
|
for (outline_it.mark_cycle_pt ();
|
||
|
!outline_it.cycled_list (); outline_it.forward ()) {
|
||
|
outline = outline_it.data ();
|
||
|
if (goutline_bounding_box (outline, polyg).
|
||
|
major_overlap (box)) {
|
||
|
if (strlen (word->text ()) > 0) {
|
||
|
if (error_count == 0) {
|
||
|
error_count = 1;
|
||
|
if (applybox_debug > 4)
|
||
|
report_failed_box (boxfile_lineno,
|
||
|
boxfile_charno,
|
||
|
box, ch,
|
||
|
"FAILURE! box overlaps blob in labelled word");
|
||
|
}
|
||
|
if (applybox_debug > 4)
|
||
|
tprintf
|
||
|
("APPLY_BOXES: ALSO ignoring corrupted char blk:%d row:%d \"%s\"\n",
|
||
|
block_id, row_id,
|
||
|
word_it.data ()->text ());
|
||
|
word_it.data ()->set_text ("");
|
||
|
//UN label it
|
||
|
error_count++;
|
||
|
}
|
||
|
|
||
|
if (error_count == 0) {
|
||
|
if (new_word == NULL) {
|
||
|
/* Make a new word with a single blob */
|
||
|
new_word = word->shallow_copy ();
|
||
|
new_word->set_text (ch);
|
||
|
if (polyg)
|
||
|
new_blob = new PBLOB;
|
||
|
else
|
||
|
new_blob = (PBLOB *) new C_BLOB;
|
||
|
new_blob_it.set_to_list (new_word->
|
||
|
gblob_list ());
|
||
|
new_blob_it.add_to_end (new_blob);
|
||
|
new_outline_it.
|
||
|
set_to_list (gblob_out_list
|
||
|
(new_blob, polyg));
|
||
|
}
|
||
|
new_outline_it.add_to_end (outline_it.
|
||
|
extract ());
|
||
|
//move blob
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
//no outlines in blob
|
||
|
if (outline_it.empty ())
|
||
|
//so delete blob
|
||
|
delete blob_it.extract ();
|
||
|
}
|
||
|
}
|
||
|
if (blob_it.empty ()) //no blobs in word
|
||
|
//so delete word
|
||
|
delete word_it.extract ();
|
||
|
}
|
||
|
}
|
||
|
if (error_count > 0)
|
||
|
return error_count;
|
||
|
|
||
|
if (new_word != NULL) {
|
||
|
gblob_sort_list (new_word->gblob_list (), polyg);
|
||
|
word_it.add_to_end (new_word);
|
||
|
new_word_box = new_word->bounding_box ();
|
||
|
word_x_centre = (new_word_box.left () + new_word_box.right ()) / 2.0f;
|
||
|
baseline = row->base_line (word_x_centre);
|
||
|
|
||
|
if (STRING (chs_caps_ht).contains (ch[0]) &&
|
||
|
(new_word_box.top () <
|
||
|
baseline + (1 + applybox_error_band) * row->x_height ())) {
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"FAILURE! caps-ht char didn't ascend");
|
||
|
new_word->set_text ("");
|
||
|
return 1;
|
||
|
}
|
||
|
if (STRING (chs_odd_top).contains (ch[0]) &&
|
||
|
(new_word_box.top () <
|
||
|
baseline + (1 - applybox_error_band) * row->x_height ())) {
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"FAILURE! Odd top char below xht");
|
||
|
new_word->set_text ("");
|
||
|
return 1;
|
||
|
}
|
||
|
if (STRING (chs_x_ht).contains (ch[0]) &&
|
||
|
((new_word_box.top () >
|
||
|
baseline + (1 + applybox_error_band) * row->x_height ()) ||
|
||
|
(new_word_box.top () <
|
||
|
baseline + (1 - applybox_error_band) * row->x_height ()))) {
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"FAILURE! x-ht char didn't have top near xht");
|
||
|
new_word->set_text ("");
|
||
|
return 1;
|
||
|
}
|
||
|
if (STRING (chs_non_ambig_bl).contains (ch[0]) &&
|
||
|
((new_word_box.bottom () <
|
||
|
baseline - applybox_error_band * row->x_height ()) ||
|
||
|
(new_word_box.bottom () >
|
||
|
baseline + applybox_error_band * row->x_height ()))) {
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"FAILURE! non ambig BL char didnt have bottom near baseline");
|
||
|
new_word->set_text ("");
|
||
|
return 1;
|
||
|
}
|
||
|
if (STRING (chs_odd_bot).contains (ch[0]) &&
|
||
|
(new_word_box.bottom () >
|
||
|
baseline + applybox_error_band * row->x_height ())) {
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"FAILURE! Odd bottom char above baseline");
|
||
|
new_word->set_text ("");
|
||
|
return 1;
|
||
|
}
|
||
|
if (STRING (chs_desc).contains (ch[0]) &&
|
||
|
(new_word_box.bottom () >
|
||
|
baseline - applybox_error_band * row->x_height ())) {
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"FAILURE! Descender doesn't descend");
|
||
|
new_word->set_text ("");
|
||
|
return 1;
|
||
|
}
|
||
|
return 0;
|
||
|
}
|
||
|
else {
|
||
|
report_failed_box (boxfile_lineno, boxfile_charno, box, ch,
|
||
|
"FAILURE! Couldn't find any blobs");
|
||
|
return 1;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
|
||
|
/*************************************************************************
|
||
|
* tidy_up()
|
||
|
* - report >1 block
|
||
|
* - sort the words in each row.
|
||
|
* - report any rows with no labelled words.
|
||
|
* - report any remaining unlabelled words
|
||
|
* - report total labelled words
|
||
|
*
|
||
|
*************************************************************************/
|
||
|
void tidy_up( //
|
||
|
BLOCK_LIST *block_list, //real blocks
|
||
|
INT16 &ok_char_count,
|
||
|
INT16 &ok_row_count,
|
||
|
INT16 &unlabelled_words,
|
||
|
INT16 *tgt_char_counts,
|
||
|
INT16 &rebalance_count,
|
||
|
char &min_char,
|
||
|
INT16 &min_samples,
|
||
|
INT16 &final_labelled_blob_count) {
|
||
|
BLOCK_IT block_it(block_list);
|
||
|
ROW_IT row_it;
|
||
|
ROW *row;
|
||
|
WERD_IT word_it;
|
||
|
WERD *word;
|
||
|
WERD *duplicate_word;
|
||
|
INT16 block_idx = 0;
|
||
|
INT16 row_idx;
|
||
|
INT16 all_row_idx = 0;
|
||
|
BOOL8 row_ok;
|
||
|
BOOL8 rebalance_needed = FALSE;
|
||
|
//No. of unique labelled samples
|
||
|
INT16 labelled_char_counts[128];
|
||
|
INT16 i;
|
||
|
char ch;
|
||
|
char prev_ch = '\0';
|
||
|
BOOL8 at_dupe_of_prev_word;
|
||
|
ROW *prev_row = NULL;
|
||
|
INT16 left;
|
||
|
INT16 prev_left = -1;
|
||
|
|
||
|
for (i = 0; i < 128; i++)
|
||
|
labelled_char_counts[i] = 0;
|
||
|
|
||
|
ok_char_count = 0;
|
||
|
ok_row_count = 0;
|
||
|
unlabelled_words = 0;
|
||
|
if ((applybox_debug > 4) && (block_it.length () != 1))
|
||
|
|
||
|
tprintf ("APPLY_BOXES: More than one block??\n");
|
||
|
|
||
|
for (block_it.mark_cycle_pt ();
|
||
|
!block_it.cycled_list (); block_it.forward ()) {
|
||
|
block_idx++;
|
||
|
row_idx = 0;
|
||
|
row_ok = FALSE;
|
||
|
row_it.set_to_list (block_it.data ()->row_list ());
|
||
|
for (row_it.mark_cycle_pt (); !row_it.cycled_list (); row_it.forward ()) {
|
||
|
row_idx++;
|
||
|
all_row_idx++;
|
||
|
row = row_it.data ();
|
||
|
word_it.set_to_list (row->word_list ());
|
||
|
word_it.sort (word_comparator);
|
||
|
for (word_it.mark_cycle_pt ();
|
||
|
!word_it.cycled_list (); word_it.forward ()) {
|
||
|
word = word_it.data ();
|
||
|
if (strlen (word->text ()) == 0) {
|
||
|
unlabelled_words++;
|
||
|
if (applybox_debug > 4) {
|
||
|
tprintf
|
||
|
("APPLY_BOXES: Unlabelled word blk:%d row:%d allrows:%d\n",
|
||
|
block_idx, row_idx, all_row_idx);
|
||
|
}
|
||
|
}
|
||
|
else {
|
||
|
if (word->gblob_list ()->length () != 1)
|
||
|
tprintf
|
||
|
("APPLY_BOXES: FATALITY - MULTIBLOB Labelled word blk:%d row:%d allrows:%d\n",
|
||
|
block_idx, row_idx, all_row_idx);
|
||
|
|
||
|
ok_char_count++;
|
||
|
labelled_char_counts[*word->text ()]++;
|
||
|
row_ok = TRUE;
|
||
|
}
|
||
|
}
|
||
|
if ((applybox_debug > 4) && (!row_ok)) {
|
||
|
tprintf
|
||
|
("APPLY_BOXES: Row with no labelled words blk:%d row:%d allrows:%d\n",
|
||
|
block_idx, row_idx, all_row_idx);
|
||
|
}
|
||
|
else
|
||
|
ok_row_count++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
min_samples = 9999;
|
||
|
for (i = 0; i < 128; i++) {
|
||
|
if (tgt_char_counts[i] > labelled_char_counts[i]) {
|
||
|
if (labelled_char_counts[i] <= 1) {
|
||
|
tprintf
|
||
|
("APPLY_BOXES: FATALITY - %d labelled samples of \"%c\" - target is %d\n",
|
||
|
labelled_char_counts[i], (char) i, tgt_char_counts[i]);
|
||
|
}
|
||
|
else {
|
||
|
rebalance_needed = TRUE;
|
||
|
if (applybox_debug > 0)
|
||
|
tprintf
|
||
|
("APPLY_BOXES: REBALANCE REQD \"%c\" - target of %d from %d labelled samples\n",
|
||
|
(char) i, tgt_char_counts[i], labelled_char_counts[i]);
|
||
|
}
|
||
|
}
|
||
|
if ((min_samples > labelled_char_counts[i]) && (tgt_char_counts[i] > 0)) {
|
||
|
min_samples = labelled_char_counts[i];
|
||
|
min_char = (char) i;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
while (applybox_rebalance && rebalance_needed) {
|
||
|
block_it.set_to_list (block_list);
|
||
|
for (block_it.mark_cycle_pt ();
|
||
|
!block_it.cycled_list (); block_it.forward ()) {
|
||
|
row_it.set_to_list (block_it.data ()->row_list ());
|
||
|
for (row_it.mark_cycle_pt ();
|
||
|
!row_it.cycled_list (); row_it.forward ()) {
|
||
|
row = row_it.data ();
|
||
|
word_it.set_to_list (row->word_list ());
|
||
|
for (word_it.mark_cycle_pt ();
|
||
|
!word_it.cycled_list (); word_it.forward ()) {
|
||
|
word = word_it.data ();
|
||
|
left = word->bounding_box ().left ();
|
||
|
ch = *word->text ();
|
||
|
at_dupe_of_prev_word = ((row == prev_row) &&
|
||
|
(left = prev_left) &&
|
||
|
(ch == prev_ch));
|
||
|
if ((ch != '\0') &&
|
||
|
(labelled_char_counts[ch] > 1) &&
|
||
|
(tgt_char_counts[ch] > labelled_char_counts[ch]) &&
|
||
|
(!at_dupe_of_prev_word)) {
|
||
|
/* Duplicate the word to rebalance the labelled samples */
|
||
|
if (applybox_debug > 9) {
|
||
|
tprintf ("Duping \"%c\" from ", ch);
|
||
|
word->bounding_box ().print ();
|
||
|
}
|
||
|
duplicate_word = new WERD;
|
||
|
*duplicate_word = *word;
|
||
|
word_it.add_after_then_move (duplicate_word);
|
||
|
rebalance_count++;
|
||
|
labelled_char_counts[ch]++;
|
||
|
}
|
||
|
prev_row = row;
|
||
|
prev_left = left;
|
||
|
prev_ch = ch;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
rebalance_needed = FALSE;
|
||
|
for (i = 0; i < 128; i++) {
|
||
|
if ((tgt_char_counts[i] > labelled_char_counts[i]) &&
|
||
|
(labelled_char_counts[i] > 1)) {
|
||
|
rebalance_needed = TRUE;
|
||
|
break;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
/* Now final check - count labelled blobs */
|
||
|
final_labelled_blob_count = 0;
|
||
|
block_it.set_to_list (block_list);
|
||
|
for (block_it.mark_cycle_pt ();
|
||
|
!block_it.cycled_list (); block_it.forward ()) {
|
||
|
row_it.set_to_list (block_it.data ()->row_list ());
|
||
|
for (row_it.mark_cycle_pt (); !row_it.cycled_list (); row_it.forward ()) {
|
||
|
row = row_it.data ();
|
||
|
word_it.set_to_list (row->word_list ());
|
||
|
word_it.sort (word_comparator);
|
||
|
for (word_it.mark_cycle_pt ();
|
||
|
!word_it.cycled_list (); word_it.forward ()) {
|
||
|
word = word_it.data ();
|
||
|
if ((strlen (word->text ()) == 1) &&
|
||
|
(word->gblob_list ()->length () == 1))
|
||
|
final_labelled_blob_count++;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
|
||
|
void report_failed_box(INT16 boxfile_lineno,
|
||
|
INT16 boxfile_charno,
|
||
|
BOX box,
|
||
|
char *box_ch,
|
||
|
const char *err_msg) {
|
||
|
if (applybox_debug > 4)
|
||
|
tprintf ("APPLY_BOXES: boxfile %1d/%1d/%s ((%1d,%1d),(%1d,%1d)): %s\n",
|
||
|
boxfile_lineno,
|
||
|
boxfile_charno,
|
||
|
box_ch,
|
||
|
box.left (), box.bottom (), box.right (), box.top (), err_msg);
|
||
|
}
|
||
|
|
||
|
|
||
|
void apply_box_training(BLOCK_LIST *block_list) {
|
||
|
BLOCK_IT block_it(block_list);
|
||
|
ROW_IT row_it;
|
||
|
ROW *row;
|
||
|
WERD_IT word_it;
|
||
|
WERD *word;
|
||
|
WERD *bln_word;
|
||
|
WERD copy_outword; // copy to denorm
|
||
|
PBLOB_IT blob_it;
|
||
|
DENORM denorm;
|
||
|
INT16 count = 0;
|
||
|
char ch[2];
|
||
|
|
||
|
ch[1] = '\0';
|
||
|
|
||
|
tprintf ("Generating training data\n");
|
||
|
for (block_it.mark_cycle_pt ();
|
||
|
!block_it.cycled_list (); block_it.forward ()) {
|
||
|
row_it.set_to_list (block_it.data ()->row_list ());
|
||
|
for (row_it.mark_cycle_pt (); !row_it.cycled_list (); row_it.forward ()) {
|
||
|
row = row_it.data ();
|
||
|
word_it.set_to_list (row->word_list ());
|
||
|
for (word_it.mark_cycle_pt ();
|
||
|
!word_it.cycled_list (); word_it.forward ()) {
|
||
|
word = word_it.data ();
|
||
|
if ((strlen (word->text ()) == 1) &&
|
||
|
(word->gblob_list ()->length () == 1)) {
|
||
|
/* Here is a word with a single char label and a single blob so train on it */
|
||
|
bln_word =
|
||
|
make_bln_copy (word, row, row->x_height (), &denorm);
|
||
|
blob_it.set_to_list (bln_word->blob_list ());
|
||
|
ch[0] = *word->text ();
|
||
|
tess_training_tester (blob_it.data (),
|
||
|
//single blob
|
||
|
&denorm, TRUE, //correct
|
||
|
ch, //correct ASCII char
|
||
|
1, //ASCII length
|
||
|
NULL);
|
||
|
copy_outword = *(bln_word);
|
||
|
copy_outword.baseline_denormalise (&denorm);
|
||
|
blob_it.set_to_list (copy_outword.blob_list ());
|
||
|
ch[0] = *word->text ();
|
||
|
delete bln_word;
|
||
|
count++;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
tprintf ("Generated training data for %d blobs\n", count);
|
||
|
}
|
||
|
|
||
|
|
||
|
void apply_box_testing(BLOCK_LIST *block_list) {
|
||
|
BLOCK_IT block_it(block_list);
|
||
|
ROW_IT row_it;
|
||
|
ROW *row;
|
||
|
INT16 row_count = 0;
|
||
|
WERD_IT word_it;
|
||
|
WERD *word;
|
||
|
WERD *bln_word;
|
||
|
INT16 word_count = 0;
|
||
|
PBLOB_IT blob_it;
|
||
|
DENORM denorm;
|
||
|
INT16 count = 0;
|
||
|
char ch[2];
|
||
|
WERD *outword; //bln best choice
|
||
|
//segmentation
|
||
|
WERD_CHOICE *best_choice; //tess output
|
||
|
WERD_CHOICE *raw_choice; //top choice permuter
|
||
|
//detailed results
|
||
|
BLOB_CHOICE_LIST_CLIST blob_choices;
|
||
|
INT16 char_count = 0;
|
||
|
INT16 correct_count = 0;
|
||
|
INT16 err_count = 0;
|
||
|
INT16 rej_count = 0;
|
||
|
#ifndef SECURE_NAMES
|
||
|
WERDSTATS wordstats; //As from newdiff
|
||
|
#endif
|
||
|
char tess_rej_str[3];
|
||
|
char tess_long_str[3];
|
||
|
|
||
|
ch[1] = '\0';
|
||
|
strcpy (tess_rej_str, "|A");
|
||
|
strcpy (tess_long_str, "|B");
|
||
|
|
||
|
for (block_it.mark_cycle_pt ();
|
||
|
!block_it.cycled_list (); block_it.forward ()) {
|
||
|
row_it.set_to_list (block_it.data ()->row_list ());
|
||
|
for (row_it.mark_cycle_pt (); !row_it.cycled_list (); row_it.forward ()) {
|
||
|
row = row_it.data ();
|
||
|
row_count++;
|
||
|
word_count = 0;
|
||
|
word_it.set_to_list (row->word_list ());
|
||
|
for (word_it.mark_cycle_pt ();
|
||
|
!word_it.cycled_list (); word_it.forward ()) {
|
||
|
word = word_it.data ();
|
||
|
word_count++;
|
||
|
if ((strlen (word->text ()) == 1) &&
|
||
|
!STRING (applybox_test_exclusions).contains (*word->text ())
|
||
|
&& (word->gblob_list ()->length () == 1)) {
|
||
|
/* Here is a word with a single char label and a single blob so test it */
|
||
|
bln_word =
|
||
|
make_bln_copy (word, row, row->x_height (), &denorm);
|
||
|
blob_it.set_to_list (bln_word->blob_list ());
|
||
|
ch[0] = *word->text ();
|
||
|
char_count++;
|
||
|
best_choice = tess_segment_pass1 (bln_word,
|
||
|
&denorm,
|
||
|
tess_default_matcher,
|
||
|
raw_choice,
|
||
|
&blob_choices, outword);
|
||
|
|
||
|
/*
|
||
|
Test for TESS screw up on word. Recog_word has already ensured that the
|
||
|
choice list, outword blob lists and best_choice string are the same
|
||
|
length. A TESS screw up is indicated by a blank filled or 0 length string.
|
||
|
*/
|
||
|
if ((best_choice->string ().length () == 0) ||
|
||
|
(strspn (best_choice->string ().string (), " ") ==
|
||
|
best_choice->string ().length ())) {
|
||
|
rej_count++;
|
||
|
tprintf ("%d:%d: \"%s\" -> TESS FAILED\n",
|
||
|
row_count, word_count, ch);
|
||
|
#ifndef SECURE_NAMES
|
||
|
wordstats.word (tess_rej_str, 2, ch, 1);
|
||
|
#endif
|
||
|
}
|
||
|
else {
|
||
|
if ((best_choice->string ().length () !=
|
||
|
outword->blob_list ()->length ()) ||
|
||
|
(best_choice->string ().length () !=
|
||
|
blob_choices.length ())) {
|
||
|
tprintf
|
||
|
("ASSERT FAIL String:\"%s\"; Strlen=%d; #Blobs=%d; #Choices=%d\n",
|
||
|
best_choice->string ().string (),
|
||
|
best_choice->string ().length (),
|
||
|
outword->blob_list ()->length (),
|
||
|
blob_choices.length ());
|
||
|
}
|
||
|
ASSERT_HOST (best_choice->string ().length () ==
|
||
|
outword->blob_list ()->length ());
|
||
|
ASSERT_HOST (best_choice->string ().length () ==
|
||
|
blob_choices.length ());
|
||
|
fix_quotes ((char *) best_choice->string ().string (),
|
||
|
//turn to double
|
||
|
outword, &blob_choices);
|
||
|
if (strcmp (best_choice->string ().string (), ch) != 0) {
|
||
|
err_count++;
|
||
|
tprintf ("%d:%d: \"%s\" -> \"%s\"\n",
|
||
|
row_count, word_count, ch,
|
||
|
best_choice->string ().string ());
|
||
|
}
|
||
|
else
|
||
|
correct_count++;
|
||
|
#ifndef SECURE_NAMES
|
||
|
if (best_choice->string ().length () > 2)
|
||
|
wordstats.word (tess_long_str, 2, ch, 1);
|
||
|
else
|
||
|
wordstats.word ((char *) best_choice->string ().
|
||
|
string (),
|
||
|
best_choice->string ().length (), ch,
|
||
|
1);
|
||
|
#endif
|
||
|
}
|
||
|
delete bln_word;
|
||
|
delete outword;
|
||
|
delete best_choice;
|
||
|
delete raw_choice;
|
||
|
blob_choices.deep_clear ();
|
||
|
count++;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
#ifndef SECURE_NAMES
|
||
|
wordstats.print (1, 100.0);
|
||
|
wordstats.conf_matrix ();
|
||
|
tprintf ("Tested %d chars: %d correct; %d rejected by tess; %d errs\n",
|
||
|
char_count, correct_count, rej_count, err_count);
|
||
|
#endif
|
||
|
}
|