public override void Charseg(ref Intarray outimage, Bytearray inarray)
{
Bytearray image = new Bytearray();
image.Copy(inarray);
OcrRoutine.binarize_simple(image);
OcrRoutine.Invert(image);
outimage.Copy(image);
Intarray labels = new Intarray();
labels.Copy(image);
ImgLabels.label_components(ref labels);
Narray <Rect> boxes = new Narray <Rect>();
ImgLabels.bounding_boxes(ref boxes, labels);
Intarray equiv = new Intarray(boxes.Length());
for (int i = 0; i < boxes.Length(); i++)
{
equiv[i] = i;
}
for (int i = 1; i < boxes.Length(); i++)
{
Rect p = boxes[i];
for (int j = 1; j < boxes.Length(); j++)
{
if (i == j)
{
continue;
}
Rect q = boxes[j];
int x0 = Math.Max(p.x0, q.x0);
int x1 = Math.Min(p.x1, q.x1);
int iw = x1 - x0;
if (iw <= 0)
{
continue; // no overlap
}
int ow = Math.Min(p.Width(), q.Width());
float frac = iw / (float)(ow);
if (frac < 0.5f)
{
continue; // insufficient overlap
}
// printf("%d %d : %d %d : %g\n",i,j,iw,ow,frac);
equiv.Put1d(Math.Max(i, j), Math.Min(i, j));
}
}
for (int i = 0; i < labels.Length(); i++)
{
labels.Put1d(i, equiv.At1d(labels.At1d(i)));
}
ImgLabels.renumber_labels(labels, 1);
outimage.Move(labels);
SegmRoutine.make_line_segmentation_white(outimage);
SegmRoutine.check_line_segmentation(outimage);
}
/// <summary>
/// The main loop iteration.
/// </summary>
public void Radiate()
{
Clear();
//logger("beam", beam);
//logger("beamcost", beamcost);
int control_beam_start = beam.Length();
for (int i = 0; i < control_beam_start; i++)
{
TryAccept(i);
}
// in this loop, traversal may add "control nodes" to the beam
for (int i = 0; i < beam.Length(); i++)
{
Traverse(stree.v1[beam[i]], stree.v2[beam[i]],
beamcost[i], i);
}
// try accepts from control beam nodes
// (they're not going to the next beam)
for (int i = control_beam_start; i < beam.Length(); i++)
{
TryAccept(i);
}
Intarray new_beam = new Intarray();
Floatarray new_beamcost = new Floatarray();
for (int i = 0; i < nbest.Length(); i++)
{
int k = nbest.Tag(i);
if (parent_trails[k] < 0) // skip the control beam nodes
{
continue;
}
new_beam.Push(stree.Add(beam[parent_trails[k]],
all_targets1[k], all_targets2[k],
all_inputs[k], all_outputs[k],
all_costs[k]));
new_beamcost.Push(beamcost[parent_trails[k]] + all_costs[k]);
//logger.format("to new beam: trail index %d, stree %d, target %d,%d",
//k, new_beam[new_beam.length() - 1], all_targets1[k], all_targets2[k]);
}
//move(beam, new_beam);
beam.Move(new_beam);
//move(beamcost, new_beamcost);
beamcost.Move(new_beamcost);
}
public override void Charseg(ref Intarray outimage, Bytearray inarray)
{
Bytearray image = new Bytearray();
image.Copy(inarray);
OcrRoutine.binarize_simple(image);
OcrRoutine.Invert(image);
outimage.Copy(image);
Intarray labels = new Intarray();
labels.Copy(image);
ImgLabels.label_components(ref labels);
Narray<Rect> boxes = new Narray<Rect>();
ImgLabels.bounding_boxes(ref boxes, labels);
Intarray equiv = new Intarray(boxes.Length());
for(int i=0; i<boxes.Length(); i++)
equiv[i] = i;
for(int i=1; i<boxes.Length(); i++) {
Rect p = boxes[i];
for(int j=1;j<boxes.Length();j++) {
if(i==j) continue;
Rect q = boxes[j];
int x0 = Math.Max(p.x0, q.x0);
int x1 = Math.Min(p.x1, q.x1);
int iw = x1-x0;
if(iw <= 0) continue; // no overlap
int ow = Math.Min(p.Width(), q.Width());
float frac = iw/(float)(ow);
if(frac < 0.5f) continue; // insufficient overlap
// printf("%d %d : %d %d : %g\n",i,j,iw,ow,frac);
equiv.Put1d(Math.Max(i, j), Math.Min(i, j));
}
}
for(int i=0; i<labels.Length(); i++)
labels.Put1d(i, equiv.At1d(labels.At1d(i)));
ImgLabels.renumber_labels(labels, 1);
outimage.Move(labels);
SegmRoutine.make_line_segmentation_white(outimage);
SegmRoutine.check_line_segmentation(outimage);
}