isbn 1.4.1

data/src/gocr-0.48/src/barcode.h

@@ -0,0 +1,11 @@
+#ifndef _BARCODE_H
+#define _BARCODE_H
+#include "pnm.h"
+
+/*
+     detect barcode and add a string to the box (obj-pointer)
+*/
+
+int detect_barcode(job_t *job);
+
+#endif

data/src/gocr-0.48/src/box.c

@@ -0,0 +1,372 @@
+/*
+This is a Optical-Character-Recognition program
+Copyright (C) 2000-2009  Joerg Schulenburg
+
+This program is free software; you can redistribute it and/or
+modify it under the terms of the GNU General Public License
+as published by the Free Software Foundation; either version 2
+of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
+
+ see README for EMAIL address
+ 
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <assert.h>
+#include <string.h>
+/* do we need #include <math.h>? conflicts with INFINITY in unicode.h */
+#include "gocr.h"
+#include "pgm2asc.h"
+
+/* for sorting letters by position on the image
+/ ToDo: - use function same line like this or include lines.m1 etc. */
+int box_gt(struct box *box1, struct box *box2) {
+ // box1 after box2 ?
+  if (box1->line > box2->line)
+    return 1;
+  if (box1->line < box2->line)
+    return 0;
+  if (box1->x0 > box2->x1)	// before
+    return 1;
+  if (box1->x1 < box2->x0)	// before
+    return 0;
+  if (box1->x0 > box2->x0)	// before,  overlapping!
+    return 1;
+
+  return 0;
+}
+
+/* --- copy part of pix p into new pix b	---- len=10000
+ * Returns: 0 on success, 1 on error.
+ * naming it as copybox isnt very clever, because it dont have to do with the
+ *   char boxes (struct box)
+ */
+int copybox (pix * p, int x0, int y0, int dx, int dy, pix * b, int len) {
+  int x, y;
+
+  /* test boundaries */
+  if (b->p == NULL || dx < 0 || dy < 0 || dx * dy > len) {
+    fprintf(stderr, " error-copybox x=%5d %5d  d=%5d %5d\n", x0, y0, dx, dy);
+    return 1;
+  }
+
+  b->x = dx;
+  b->y = dy;
+  b->bpp = 1;
+#ifdef FASTER_INCOMPLETE
+  for (y = 0; y < dy; y++)
+    memcpy(&pixel_atp(b, 0, y), &pixel_atp(p, x0, y + y0 ), dx);
+  // and unmark pixels
+#else
+  for (y = 0; y < dy; y++)
+    for (x = 0; x < dx; x++)
+      pixel_atp(b, x, y) = getpixel(p, x + x0, y + y0);
+#endif
+
+  return 0;
+}
+
+/* reset table of alternative chars (and free memory) */
+int reset_box_ac(struct box *box){
+  int i;
+  for (i=0; i<box->num_ac; i++)
+    if (box->tas[i]) {
+       /* fprintf(stderr,"DBG free_s[%d] %p %s\n",i,box->tas[i],box->tas[i]); */
+       free(box->tas[i]);
+       box->tas[i]=0;     /* prevent double freeing */
+     }
+  box->num_ac=0;  /* mark as freed */
+  return 0;
+}
+
+/* ini or copy a box: get memory for box and initialize the memory */
+struct box *malloc_box (struct box *inibox) {
+  struct box *buf;
+  int i;
+
+  buf = (struct box *) malloc(sizeof(struct box));
+  if (!buf)
+    return NULL;
+  if (inibox) {
+    memcpy(buf, inibox, sizeof(struct box));
+    /* only pointer are copied, we want to copy the contents too */ 
+    for (i=0;i<inibox->num_ac;i++) {
+      if (inibox->tas[i]) {
+        buf->tas[i]=(char *)malloc(strlen(inibox->tas[i])+1);
+        memcpy(buf->tas[i], inibox->tas[i], strlen(inibox->tas[i])+1);
+      }
+    }
+  }
+  else { /* ToDo: init it */
+    buf->num_ac=0;
+    buf->num_frames=0;
+  }
+  /* fprintf(stderr,"\nDBG ini_box %p",buf); */
+  return buf;
+}
+
+/* free memory of box */
+int free_box (struct box *box) {
+  if (!box) return 0;
+  /* fprintf(stderr,"DBG free_box %p\n",box); out_x(box); */
+  reset_box_ac(box); /* free alternative char table */
+  free(box);         /* free the box memory */
+  return 0;
+}
+
+/* simplify the vectorgraph, 
+ *  but what is the best way?
+ *   a) melting two neighbouring vectors with nearly same direction?
+ *      (nearest angle to pi)
+ *   b) melting three neigbours with smallest area?
+ * ToDo:
+ * mode = 0 - only lossless
+ * mode = 1 - reduce one vector, smallest possible loss
+ * mode = 2 - remove jitter (todo, or somewhere else)
+ * ToDo: include also loop around (last - first element)
+ * ToDo: reduce by 10..50%
+ */
+int reduce_vectors ( struct box *box1, int mode ) {
+  int i1, i2, nx, ny, mx, my, len,
+      minlen=1024, /* minlength of to neighbouring vectors */
+      besti1=0,  /* frame for best reduction */
+      besti2=2;  /* vector replacing its predecessor */
+  double  sprod, maxsprod=-1;
+  if (mode!=1) fprintf(stderr,"ERR not supported yet, ToDo\n");
+  for (i2=1,i1=0; i1<box1->num_frames; i1++) {    /* every frame */
+    for (;i2<box1->num_frame_vectors[i1]-1; i2++) { /* every vector */
+      /* predecessor n */
+      nx = box1->frame_vector[i2-0][0] - box1->frame_vector[i2-1][0];
+      ny = box1->frame_vector[i2-0][1] - box1->frame_vector[i2-1][1];
+      /* successor   m */
+      mx = box1->frame_vector[i2+1][0] - box1->frame_vector[i2-0][0];
+      my = box1->frame_vector[i2+1][1] - box1->frame_vector[i2-0][1];
+      /* angle is w = a*b/(|a|*|b|) = 1 means parallel   */
+      /* normalized: minimize w^2 = (a*b/(|a|*|b|)-1)^2  */
+      /*             -1=90grd, 0=0grd, -2=180grd         */
+      sprod = /* fabs */(abs(nx*mx+ny*my)*(nx*mx+ny*my)
+                       /(1.*(nx*nx+ny*ny)*(mx*mx+my*my))-1);
+      /* we dont include math.h because INFINITY conflicts to unicode,h */
+      if (sprod<0) sprod=-sprod;
+      len =           (mx*mx+my*my)*(nx*nx+ny*ny); /* sum lengths^2 */
+// ..c          ###c           ...          ..          ...
+// .b. len=2+2  #b.. len=2+5   #bc len=1+2  bc len=1+1  b#a len=4+5 
+// a.. spr=0    a... spr=1/10  a.. spr=1/4  a. spr=1    ##c spr=9/5
+//
+      if (   len*   sprod*   sprod*   sprod*   sprod
+         <minlen*maxsprod*maxsprod*maxsprod*maxsprod
+       || maxsprod<0) /* Bad! ToDo! */
+      { maxsprod=sprod; besti1=i1; besti2=i2; minlen=len; }
+    }
+  }
+  if (box1->num_frames>0)
+  for (i2=besti2; i2<box1->num_frame_vectors[ box1->num_frames-1 ]-1; i2++) {
+    box1->frame_vector[i2][0]=box1->frame_vector[i2+1][0];
+    box1->frame_vector[i2][1]=box1->frame_vector[i2+1][1];
+  }
+  for (i1=besti1; i1<box1->num_frames; i1++)
+    box1->num_frame_vectors[i1]--;
+//  fprintf(stderr,"\nDBG_reduce_vectors i= %d nv= %d sprod=%f len2=%d\n# ...",
+//     besti2,box1->num_frame_vectors[ box1->num_frames-1 ],maxsprod,minlen);
+//  out_x(box1);
+  return 0;
+}
+
+/* add the contents of box2 to box1
+ * especially add vectors of box2 to box1
+ */
+int merge_boxes( struct box *box1, struct box *box2 ) {
+  int i1, i2, i3, i4;
+  struct box tmpbox, *bsmaller, *bbigger; /* for mixing and sorting */
+  /* DEBUG, use valgrind to check uninitialized memory */
+#if 0
+  fprintf(stderr,"\nDBG merge_boxes_input:"); out_x(box1); out_x(box2);
+#endif
+  /* pair distance is to expendable, taking borders is easier */
+  if ((box2->x1 - box2->x0)*(box2->y1 - box2->y0)
+     >(box1->x1 - box1->x0)*(box1->y1 - box1->y0)) {
+      bbigger=box2; bsmaller=box1; }
+  else {
+      bbigger=box1; bsmaller=box2; }
+  /* ToDo: does not work if a third box is added */
+  if (box2->y0>box1->y1 || box2->y1<box1->y0
+   || box2->x0>box1->x1 || box2->x1<box1->x0) {
+    box1->num_boxes    += box2->num_boxes;    /* num seperate objects 2=ij */
+  } else {
+    if (box2->num_boxes>box1->num_boxes) box1->num_boxes=box2->num_boxes;
+    box1->num_subboxes += box2->num_subboxes+1; /* num holes 1=abdepq 2=B */
+  }
+  box1->dots         += box2->dots;         /* num i-dots */
+  if ( box2->x0 < box1->x0 ) box1->x0 = box2->x0; 
+  if ( box2->x1 > box1->x1 ) box1->x1 = box2->x1;
+  if ( box2->y0 < box1->y0 ) box1->y0 = box2->y0;
+  if ( box2->y1 > box1->y1 ) box1->y1 = box2->y1;
+  i1 = i2 = 0;
+  if (bbigger->num_frames) 
+    i1 =  bbigger->num_frame_vectors[  bbigger->num_frames - 1 ];
+  if (bsmaller->num_frames)
+    i2 = bsmaller->num_frame_vectors[ bsmaller->num_frames - 1 ];
+  while (i1+i2 > MaxFrameVectors) {
+    if (i1>i2) { reduce_vectors(  bbigger, 1 ); i1--; }
+    else       { reduce_vectors( bsmaller, 1 ); i2--; }
+  }
+  /* if i1+i2>MaxFrameVectors  simplify the vectorgraph */
+  /* if sum num_frames>MaxNumFrames  through shortest graph away and warn */
+  /* first copy the bigger box */
+  memcpy(&tmpbox, bbigger, sizeof(struct box));
+  /* attach the smaller box */
+  for (i4=i3=0; i3<bsmaller->num_frames; i3++) {
+    if (tmpbox.num_frames>=MaxNumFrames) break;
+    
+    for  (; i4<bsmaller->num_frame_vectors[i3]; i4++) {
+      memcpy(tmpbox.frame_vector[i1],
+          bsmaller->frame_vector[i4],2*sizeof(int));
+      i1++;
+    }
+    tmpbox.num_frame_vectors[ tmpbox.num_frames ] = i1;
+    tmpbox.frame_vol[ tmpbox.num_frames ] = bsmaller->frame_vol[ i3 ];
+    tmpbox.frame_per[ tmpbox.num_frames ] = bsmaller->frame_per[ i3 ];
+    tmpbox.num_frames++;
+    if (tmpbox.num_frames>=MaxNumFrames) {
+      if (JOB->cfg.verbose)
+        fprintf(stderr,"\nDBG merge_boxes MaxNumFrames reached");
+      break;
+    }
+  }
+  /* copy tmpbox to destination */
+  box1->num_frames = tmpbox.num_frames;
+  memcpy(box1->num_frame_vectors,
+         tmpbox.num_frame_vectors,sizeof(int)*MaxNumFrames);
+  memcpy(box1->frame_vol,
+         tmpbox.frame_vol,sizeof(int)*MaxNumFrames);
+  memcpy(box1->frame_per,
+         tmpbox.frame_per,sizeof(int)*MaxNumFrames);
+  memcpy(box1->frame_vector,
+         tmpbox.frame_vector,sizeof(int)*2*MaxFrameVectors);
+#if 0
+  if (JOB->cfg.verbose)
+    fprintf(stderr,"\nDBG merge_boxes_result:"); out_x(box1);
+#endif
+  return 0;
+}
+
+/* used for division of glued chars
+ * after a box is splitted into 2, where vectors are copied to both,
+ * vectors outside the new box are cutted and thrown away,
+ * later replaced by
+ *  - 1st remove outside vectors with outside neighbours (complete frames?)
+ *        add vector on outside vector with inside neighbours
+ *        care about connections through box between outside vectors 
+ *  - 2nd reduce outside crossings (inclusive splitting frames if necessary)
+ *        depending on direction (rotation) of outside connections
+ *  - 3th shift outside vectors to crossing points
+ *  - split add this points, connect only in-out...out-in,
+ *  - cutting can result in more objects
+ * ToDo:
+ *       dont connect  --1---2--------3----4--  new-y1 (inside above not drawn)
+ *                        \   \->>>>-/    /             outside
+ *                         \----<<<<-----/      old-y1
+ *                            |======| subtractable? 
+ *
+ *       only connect  --1---2--------3----4--  new-y1
+ *                        \>>/        \>>>/     old-y1  outside
+ *  ToDo: what about cutting 2 frames (example: 2fold melted MN)
+ *        better restart framing algo?
+ *
+ *  ToDo: new vol, per
+ */
+int cut_box( struct box *box1) {
+  int i1, i2, i3, i4, x, y, lx, ly, dbg=0;
+  if (JOB->cfg.verbose) dbg=1;  // debug level, enlarge to get more output
+  if (dbg) fprintf(stderr,"\n cut box x= %3d %3d", box1->x0, box1->y0);
+  /* check if complete frames are outside the box */
+  for (i1=0; i1<box1->num_frames; i1++){
+    if (dbg>2) fprintf(stderr,"\n checking frame %d outside", i1);
+    i2 = ((i1)?box1->num_frame_vectors[ i1-1 ]:0); // this frame
+    i3 =       box1->num_frame_vectors[ i1   ];    // next frame
+    for (i4=i2; i4 < i3; i4++) {
+      x = box1->frame_vector[i4][0];
+      y = box1->frame_vector[i4][1];
+      /* break, if one vector is lying inside */
+      if (x>=box1->x0 && x<=box1->x1 && y>=box1->y0 && y<=box1->y1) break;
+    }
+    if (i4==i3) { /* all vectors outside */
+      if (dbg>1) fprintf(stderr,"\n remove frame %d",i1);
+      /* replace all frames i1,i1+1,... by i1+1,i1+2,... */
+      /* replace (x,y) pairs first */
+      for (i4=i2; i4<box1->num_frame_vectors[ box1->num_frames-1 ]-(i3-i2);
+           i4++) {
+        box1->frame_vector[i4][0] = box1->frame_vector[i4+i3-i2][0];
+        box1->frame_vector[i4][1] = box1->frame_vector[i4+i3-i2][1];
+      }
+      /* replace the num_frame_vectors */
+      for (i4=i1; i4<box1->num_frames-1; i4++)
+        box1->num_frame_vectors[ i4 ] =
+          box1->num_frame_vectors[ i4+1 ]-(i3-i2);
+      box1->num_frames--; i1--;
+    }
+  }
+  /* remove vectors outside the box */
+  i3=0;
+  for (i1=0; i1<box1->num_frames; i1++){
+    if (dbg>2) fprintf(stderr,"\n check cutting vectors on frame %d", i1);
+    x = box1->frame_vector[0][0]; /* last x */
+    y = box1->frame_vector[0][1]; /* last y */
+    /* ToDo: start inside to get a closed object */
+    if (x<box1->x0 || x>box1->x1 || y<box1->y0 || y>box1->y1) i3=1;
+    for (i2=0; i2<box1->num_frame_vectors[ i1 ]; i2++) {
+      lx = x; /* last x */
+      ly = y; /* last y */
+      x = box1->frame_vector[i2][0];
+      y = box1->frame_vector[i2][1];
+      // fprintf(stderr,"DBG LEV3 i2= %3d  xy= %3d %3d",i2,x,y);
+      /* check if outside */
+      if (x<box1->x0 || x>box1->x1 || y<box1->y0 || y>box1->y1) {
+        /* replace by nearest point at border, ToDo: better crossingpoint */
+        if (i3==0) {  /* wrong if it starts outside */
+          if (x < box1->x0) x = box1->frame_vector[i2][0] = box1->x0;
+          if (x > box1->x1) x = box1->frame_vector[i2][0] = box1->x1;
+          if (y < box1->y0) y = box1->frame_vector[i2][1] = box1->y0;
+          if (y > box1->y1) y = box1->frame_vector[i2][1] = box1->y1;
+        } else {
+          /* remove vector */
+          if (dbg>1) fprintf(stderr,"\n remove vector[%d][%d] x= %2d %2d",i1,i2,x-box1->x0,y-box1->y0);
+          for (i4=i2;i4<box1->num_frame_vectors[ box1->num_frames-1 ]-1;i4++) {
+            box1->frame_vector[i4][0] = box1->frame_vector[i4+1][0];
+            box1->frame_vector[i4][1] = box1->frame_vector[i4+1][1];
+          }
+          for (i4=i1; i4<box1->num_frames; i4++)
+                         box1->num_frame_vectors[ i4 ]--;
+          i2--; /* next element is shiftet now, setting back the counter */
+        }
+        i3++;
+        // fprintf(stderr," outside i3= %d\n",i3);
+        continue;
+      }
+      // fprintf(stderr," inside  i3= %d",i3);
+      if (i3) { /* ToDo: better crossing point last vector and border */
+          if (lx < box1->x0) lx = box1->x0;
+          if (lx > box1->x1) lx = box1->x1;
+          if (ly < box1->y0) ly = box1->y0;
+          if (ly > box1->y1) ly = box1->y1;
+          x = box1->frame_vector[i2][0] = lx;
+          y = box1->frame_vector[i2][1] = ly;
+          i3 = 0;
+      }
+      // fprintf(stderr," xy= %3d %3d\n",x,y);
+    }
+  }
+  if (dbg>2) { fprintf(stderr,"\nDBG cut_box_result:"); out_x(box1); }
+  return 0;
+}
+

data/src/gocr-0.48/src/database.c

@@ -0,0 +1,462 @@
+/*
+This is a Optical-Character-Recognition program
+Copyright (C) 2000-2009 Joerg Schulenburg
+
+This program is free software; you can redistribute it and/or
+modify it under the terms of the GNU General Public License
+as published by the Free Software Foundation; either version 2
+of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
+
+ see README for EMAIL address
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "gocr.h"
+#include "pnm.h"
+#include "pgm2asc.h"
+#include <string.h>
+#include <time.h>
+
+#define Blen  256
+
+// load boxes from database into boxlist (for faster access)
+//   used as alternate engine, comparing chars with database
+int load_db(void) {
+  FILE *f1;
+  char s1[Blen+1],
+       s2[Blen+1] = "./db/", /* ToDo: replace by constant! by configure */
+       *s3;
+  int i, j, ii, i2, line;
+  struct box *box1;
+  pix *pp;
+
+  if( JOB->cfg.db_path ) strncpy(s2,JOB->cfg.db_path,Blen-1);
+  i2=strlen(s2);
+  if (JOB->cfg.verbose)
+    fprintf(stderr, "# load database %s %s ... ",s2,JOB->cfg.db_path);
+
+  strncpy(s2+i2,"db.lst",Blen-i2);s2[Blen]=0;
+  f1 = fopen(s2, "r");
+  if (!f1) {
+    fprintf(stderr, " DB %s not found\n",s2);
+    return 1;
+  }
+
+  line = 0; /* line counter for better error report */
+  for (ii = 0; !feof(f1); ii++) {
+/* bbg: should write a better input routine */
+    if (!fgets(s1, Blen, f1)) break; line++;
+    j = strlen(s1);
+    /* remove carriage return sequences from line */
+    while (j > 0 && (s1[j - 1] == '\r' || s1[j - 1] == '\n'))
+      s1[--j] = 0;
+    if (!j)         continue;   /* skip empty line */
+    if (s1[0]=='#') continue;   /* skip comments (v0.44) */
+    /* copy file name */
+    for (i = 0; i < j && i+i2 < Blen && strchr(" \t,;",s1[i]) == 0; i++)
+      s2[i2 + i] = s1[i];
+    s2[i2+i]=0;
+    /* skip spaces */
+    for (; i < j && strchr(" \t",s1[i]) != 0; i++);
+    /* by now: read pix, fill box, goto next ??? */
+    pp = (pix *)malloc(sizeof(pix));
+    if( !pp ) fprintf(stderr,"malloc error in load_db pix\n");
+
+    // if (JOB->cfg.verbose) fprintf(stderr,"\n# readpgm %s ",s2);
+    if (readpgm(s2, pp, 0 * JOB->cfg.verbose)!=0) {
+      fprintf(stderr,"\ndatabase error: readpgm %s\n", s2);
+      exit(-1);
+    }
+
+    box1 = (struct box *)malloc_box(NULL);
+    if(!box1) fprintf(stderr,"malloc error in load_db box1\n");
+    box1->x0 = 0;
+    box1->x1 = pp->x-1;       // white border 1 pixel width
+    box1->y0 = 0;
+    box1->y1 = pp->y-1;
+    box1->x = 1;
+    box1->y = 1;
+    box1->dots = 0;
+    box1->c = 0;
+    box1->modifier = 0; /* ToDo: obsolete */
+    box1->tas[0]=NULL;
+    box1->tac[0]=0;
+    box1->wac[0]=100; /* really 100% sure? */
+    box1->num_ac=1;
+    if (s1[i]=='"'){  /* parse a string */
+      j=strrchr(s1+i+1,'"')-(s1+i+1); /* we only look for first and last "" */
+      if (j>=1) {
+        s3=(char *)malloc(j+1);
+        if (!s3) fprintf (stderr, "malloc error in load_db s3\n");
+        if (s3) {
+          memcpy(s3,s1+i+1,j);
+          s3[j]=0;
+          box1->tas[0]=s3;
+          // fprintf(stderr,"\nstring=%s",s3);
+        }
+      } else { fprintf(stderr,"load_db: string parse error L%d\n",line); }
+    } else {
+      box1->tac[0] = box1->c = s1[i];      /* try to interpret as ASCII */
+      /* we can live without hexcode in future if we use UTF8-strings */
+      s3=s1+i;
+      j=strtol( s1+i, &s3, 16); /* try to read 4 to 8 digit hex unicode */
+      /* if its an hexcode, ASCII interpretation is overwritten */
+      if( j && i+3<=Blen && s3-s1-i>3 ) box1->tac[0] = box1->c = j;
+      // fprintf(stderr,"\nhexcode=%04x=%04x %d",(int)j,(int)box1->c,s3-s1-i);
+    }
+    box1->num = 0;
+    box1->line = -1;
+    box1->m1 = 0;  /* ToDo: should be given too in the database! */
+    box1->m2 = 0;
+    box1->m3 = 0;
+    box1->m4 = 0;
+    box1->p = pp;
+    list_app(&JOB->tmp.dblist, box1);	// append to list
+#if 0
+     out_x(box1);
+#endif
+  }
+  fclose(f1);
+  if (JOB->cfg.verbose)
+    fprintf(stderr, " %d chars loaded\n", ii);
+  return 0;
+}
+
+// expand database from box/boxlist name=db_$utime.pbm
+// this is added in version v0.3.3
+int store_db(struct box *box1) {
+  FILE *f1;
+  char s2[Blen+1] = "./db/", s3[Blen+1];
+  int i2, dx, dy;
+  unsigned c_out;
+  pix b;	/* temporary mini page */
+
+  if( JOB->cfg.db_path ) strncpy(s2,JOB->cfg.db_path,Blen-1);
+  i2=strlen(s2);
+  
+  /* add (first) char and time to the file name for better debugging */
+ 
+  /* decide between 7bit ASCII and UTF8-char or string */
+  c_out =  ((box1->num_ac && box1->tas[0]) ?
+         (unsigned char )box1->tas[0][0] /* char  */ :
+                         box1->c         /* wchar */);
+  /* (unsigned int)((         char)0x80) = 0xffffff80 */
+  /* (unsigned int)((unsigned char)0x80) = 0x00000080 */
+ 
+  /* name generation can cause problems, if called twice within a second */
+  sprintf(s3,"db_%04x_%08lx.pbm", c_out, (unsigned long)time(NULL));
+  /* ToDo: the file name may be not unique */
+  
+  strncpy(s2+i2,"db.lst",Blen-i2);s2[Blen]=0;
+  f1 = fopen(s2, "a");
+  if (!f1) {
+    fprintf(stderr, " could not access %s\n",s2);
+    return 1;
+  }
+  strncpy(s2+i2,s3,strlen(s3)); s2[i2+strlen(s3)]=0;
+  /* store image and infos about the char */
+  /* ToDo: store the vector list instead of the pixelarray */
+  
+  if (JOB->cfg.verbose)
+    fprintf(stderr, "store_db: add file %s to database (nac=%d c=%04x)"
+      "\n#",s3, box1->num_ac, c_out);
+
+  dx=box1->x1-box1->x0+1;
+  dy=box1->y1-box1->y0+1;
+  b.p = (unsigned char *) malloc( dx * dy );
+  if( !b.p ){
+    fprintf( stderr, "\nFATAL: malloc failed, skip store_db" );
+    return 2;
+  }
+  if (copybox(box1->p, box1->x0, box1->y0, dx, dy, &b, dx * dy))
+    return -1;
+                          
+  writepbm(s2,&b); /* What is to do on error? */
+  free(b.p);
+
+  /* store the database line */
+  /* some infos about box1->m1,..,m4 should added (base line, high etc.) */
+  if (box1->num_ac && box1->tas[0]) {
+    fprintf(f1, "%s \"%s\"\n",s3,box1->tas[0]);
+    /* ToDo: what if tas contains '"'? */
+  } else {
+    if( (box1->c >= '0' && box1->c <= '9')
+     || (box1->c >= 'A' && box1->c <= 'Z')
+     || (box1->c >= 'a' && box1->c <= 'z') )
+      fprintf(f1, "%s %c\n",s3,(char)box1->c);
+    else {
+      if (((box1->c)>>16)>>16)
+        fprintf(f1, "%s %08x\n",s3,(unsigned int)box1->c);
+      else
+        fprintf(f1, "%s %04x\n",s3,(unsigned int)box1->c);
+    }
+  }
+  fclose(f1);
+  return 0;
+}
+
+/* function is only for user prompt on console to identify chars
+   it prints out a part of pixmap b at point x0,y0 to stderr
+   using dots .,; if no pixel, and @xoO for pixels
+ */
+void out_env(struct box *px ){
+  int x0,y0,x1,y1,dx,dy,x,y,x2,y2,yy0,tx,ty,i,cs;
+  char c1, c2; pix *b;
+  cs=JOB->cfg.cs;
+  yy0=px->y0;
+  { /* overwrite rest of arguments */
+    b=px->p;
+    x0=px->x0; x1=px->x1; dx=x1-x0+1;
+    y0=px->y0; y1=px->y1; dy=y1-y0+1;
+    y0-=2; y1+=2; 
+    if (px->m4 && y0>px->m1) y0=px->m1;
+    if (px->m4 && y1<px->m4) y1=px->m4;
+    if (x1-x0+1<52) { x0-=10; x1+=10; } /* fragment? expand frame */
+    if (x1-x0+1<52) { x0-=10; x1+=10; } /* fragment? expand frame */
+    if (x1-x0+1<62) { x0-=5;  x1+=5; }
+    if (y1-y0+1<10) { y0-= 4; y1+= 4; } /* fragment? */
+    if (x0<0) x0=0;  if (x1>=b->x) x1=b->x-1; 
+    if (y0<0) y0=0;  if (y1>=b->y) y1=b->y-1; 
+    dx=x1-x0+1;
+    dy=y1-y0+1; yy0=y0;
+    fprintf(stderr,"\n# show box + environment");
+    fprintf(stderr,"\n# show box     x= %4d %4d d= %3d %3d r= %d %d",
+	  px->x0, px->y0, px->x1 - px->x0 + 1, px->y1 - px->y0 + 1,
+	  px->x - px->x0, px->y - px->y0);
+    if (px->num_ac){ /* output table of chars and its probabilities */
+      fprintf(stderr,"\n# list box char: ");
+      for(i=0;i<px->num_ac && i<NumAlt;i++)
+      /* output the (xml-)string (picture position, barcodes, glyphs, ...) */
+        if (px->tas[i])
+         fprintf(stderr," %s(%d)",       px->tas[i]       ,px->wac[i]);
+        else
+         fprintf(stderr," %s(%d)",decode(px->tac[i],ASCII),px->wac[i]);
+    }
+    fprintf(stderr,"\n");
+    if (px->dots && px->m2 && px->m1<y0) { yy0=px->m1; dy=px->y1-yy0+1; }
+  }
+  tx=dx/80+1;
+  ty=dy/40+1; // step, usually 1, but greater on large maps 
+  fprintf(stderr,"# show pattern x= %4d %4d d= %3d %3d t= %d %d\n",
+                 x0,y0,dx,dy,tx,ty);
+  if (dx>0)
+  for(y=yy0;y<yy0+dy;y+=ty) { /* reduce the output to max 78x40 */
+
+    /* image is the boxframe + environment in the original bitmap */
+    for(x=x0;x<x0+dx;x+=tx){  /* by merging sub-pixels */
+      c1='.';
+      for(y2=y;y2<y+ty && y2<y0+dy;y2++) /* sub-pixels */
+      for(x2=x;x2<x+tx && x2<x0+dx;x2++)
+        { if((getpixel(b,x2,y2)<cs)) c1='#'; }
+      // show pixels outside the box thinner/weaker
+      if (x+tx-1 < px->x0 || x > px->x1
+       || y+ty-1 < px->y0 || y > px->y1) c1=((c1=='#')?'O':',');
+      fprintf(stderr,"%c", c1 );
+    }
+
+    c1=c2=' ';
+    /* mark lines with < */
+    if (px) if (y==px->m1 || y==px->m2 || y==px->m3 || y==px->m4)  c1='<';
+    if (y==px->y0 || y==px->y1)  c2='-';  /* boxmarks */
+    fprintf(stderr,"%c%c\n",c1,c2);
+  }
+}
+
+
+/*
+// second variant, for database (with slightly other behaviour)
+// new variant
+//  look at the environment of the pixel too (contrast etc.)
+//   detailed analysis only of diff pixels!
+//
+// 100% * distance, 0 is best fit
+// = similarity of 2 chars for recognition of noisy chars
+//   weigth of pixels with only one same neighbour set to 0
+//   look at contours too!
+   ToDo: especially on small boxes distance should only be 0 if
+       characters are 100% identical! 
+*/
+// #define DEBUG 2
+int distance2( pix *p1, struct box *box1,
+               pix *p2, struct box *box2, int cs){
+   int rc=0,x,y,v1,v2,i1,i2,rgood=0,rbad=0,
+       x1,y1,x2,y2,dx,dy,dx1,dy1,dx2,dy2,tx,ty;
+#if DEBUG == 2
+  if(JOB->cfg.verbose)
+    fprintf(stderr," DEBUG: distance2\n");
+#endif
+   x1=box1->x0;y1=box1->y0;x2=box2->x0;y2=box2->y0;
+   dx1=box1->x1-box1->x0+1; dx2=box2->x1-box2->x0+1; dx=((dx1>dx2)?dx1:dx2);dx=dx1;
+   dy1=box1->y1-box1->y0+1; dy2=box2->y1-box2->y0+1; dy=((dy1>dy2)?dy1:dy2);dy=dy1;
+   if(abs(dx1-dx2)>1+dx/16 || abs(dy1-dy2)>1+dy/16) rbad++; // how to weight?
+   // compare relations to baseline and upper line
+   if(box1->m4>0 && box2->m4>0){  // used ???
+     if(2*box1->y1>box1->m3+box1->m4 && 2*box2->y1<box2->m3+box2->m4) rbad+=128;
+     if(2*box1->y0>box1->m1+box1->m2 && 2*box2->y0<box2->m1+box2->m2) rbad+=128;
+   }
+   tx=dx/16; if(dx<17)tx=1; // raster
+   ty=dy/32; if(dy<33)ty=1;
+   // compare pixels
+   for( y=0;y<dy;y+=ty )
+   for( x=0;x<dx;x+=tx ) {	// try global shift too ???
+     v1=((getpixel(p1,x1+x*dx1/dx,y1+y*dy1/dy)<cs)?1:0); i1=8;	// better gray?
+     v2=((getpixel(p2,x2+x*dx2/dx,y2+y*dy2/dy)<cs)?1:0); i2=8;	// better gray?
+     if(v1==v2) { rgood+=16; continue; } // all things are right!
+     // what about different pixel???
+     // test overlapp of surounding pixels ???
+     v1=1; rbad+=4;
+     v1=-1;
+     for(i1=-1;i1<2;i1++)
+     for(i2=-1;i2<2;i2++)if(i1!=0 || i2!=0){
+       if( ((getpixel(p1,x1+x*dx1/dx+i1*(1+dx1/32),y1+y*dy1/dy+i2*(1+dy1/32))<cs)?1:0)
+         !=((getpixel(p2,x2+x*dx2/dx+i1*(1+dx2/32),y2+y*dy2/dy+i2*(1+dy2/32))<cs)?1:0) ) v1++;
+     }
+     if(v1>0)
+     rbad+=16*v1;
+   }
+   if(rgood+rbad) rc= 100*rbad/(rgood+rbad); else rc=99;
+   /* if width/high is not correct add badness */
+   rc += ( abs(dx1*dy2-dx2*dy1) * 10 ) / (dy1*dy2);
+   if (rc>100) rc=100;
+   if(/* rc<10 && */ JOB->cfg.verbose /* &1024 */){
+#if DEBUG == 2
+     fprintf(stderr," distance2 rc=%d rgood=%d rbad=%d\n",rc,rgood,rbad);
+//     out_b(NULL,p1,box1->x0,box1->y0,box1->x1-box1->x0+1,
+//                                box1->y1-box1->y0+1,cs);
+//     out_b(NULL,p2,box2->x0,box2->y0,box2->x1-box2->x0+1,
+//                                box2->y1-box2->y0+1,cs);
+     out_x(box1);
+     out_x(box2);
+#endif
+   }
+   return rc;
+}
+
+wchar_t ocr_db(struct box *box1) {
+  int dd = 1000, dist = 1000;
+  wchar_t c = UNKNOWN;
+  unsigned char buf[200]; /* Oct08 JS: add unsigned to avoid UTF problems */
+  Box *box2, *box3;
+  
+  if (!list_empty(&JOB->tmp.dblist)){ 
+    box3 = (Box *)list_get_header(&JOB->tmp.dblist);
+    if(JOB->cfg.verbose)
+      fprintf(stderr,"\n#DEBUG: ocr_db (%d,%d) ",box1->x0, box1->y0);
+
+    for_each_data(&JOB->tmp.dblist) {
+      box2 = (Box *)list_get_current(&JOB->tmp.dblist);
+      /* do preselect!!! distance() slowly */
+      dd = distance2( box2->p, box2, box1->p, box1, JOB->cfg.cs);
+      if (dd <= dist) {  /* new best fit */ 
+        dist = dd;
+        box3 = box2; /* box3 is a pointer and not copied box2 */
+
+        if (dist<100 && 100-dist >= JOB->cfg.certainty) {
+          /* some deviation of the pattern is tolerated */
+          int i, wa;
+          for (i=0;i<box3->num_ac;i++) {
+           wa = (100-dist)*box3->wac[i]/100; /* weight *= (100-dist) */
+           if (box3->tas[i]) setas(box1,box3->tas[i],wa);
+           else              setac(box1,box3->tac[i],wa);
+          }
+          if (box3->num_ac) c=box3->tac[0]; /* 0 for strings (!UNKNOWN) */
+          if (JOB->cfg.verbose)
+            fprintf(stderr, " dist=%4d c= %c 0x%02x %s  wc= %3d", dist,
+               ((box3->c>32 && box3->c<127) ? (char) box3->c : '.'),
+               (int)box3->c, ((box3->tas[0])?box3->tas[0]:""), box3->wac[0]);
+        }
+        if (dd<=0 && ((box3->num_ac && box3->tas[0]) || box3->c >= 128
+                       || !strchr ("l1|I0O", box3->c)))
+          break; /* speedup if found */
+      }
+    } end_for_each(&JOB->tmp.dblist);
+    
+  }
+
+  if( (JOB->cfg.mode&128) != 0 && c == UNKNOWN ) { /* prompt the user */
+    /* should the output go to stderr or special pipe??? */
+    int utf8_ok=0;  /* trigger this flag if input is ok */
+    int i, endchar; /* index */
+    out_env(box1);  /* old: out_x(box1); */
+    fprintf(stderr,"The above pattern was not recognized.\n"
+      "Enter UTF8 char or string for above pattern. Leave empty if unsure.\n"
+      "Press RET at the end (ALT+RET to store into RAM only) : "
+    );  /* ToDo: empty + alt-return (0x1b 0x0a) for help? ^a for skip all */
+    /* UTF-8 (man 7 utf-8):
+     *   7bit = 0xxxxxxx                            (0000-007F)
+     *  11bit = 110xxxxx 10xxxxxx                   (0080-07FF)
+     *  16bit = 1110xxxx 10xxxxxx 10xxxxxx          (0800-FFFF)
+     *  21bit = 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
+     *  26bit = 111110xx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx
+     *  31bit = 1111110x 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx
+     */
+    buf[0]=0;
+    /* shift/ctrl/altgr-enter acts like enter or ^j or ^m,
+     * alt-enter returns 0x1b 0x0a and returns from fgets()
+     * ^d (EOF) returns (nil) from fgets()
+     * x+(2*)ctrl-d returns from fgets() without returning a 0x0a
+     * if not UTF-input-mode, we are in trouble?
+     * ^a=0x01, ^b=0x02, ^e=05, ..., ToDo: meaning of no-input or <=space
+     */
+    fgets((char *)buf,200,stdin); /* including \n=0x0a */
+    dd=strlen((char *)buf);
+    /* output hexcode if verbose set */
+    if (JOB->cfg.verbose) {
+      fprintf(stderr, "\n# fgets [%d]:", dd);
+      for(i=0; i<dd; i++)
+        fprintf(stderr, " %02x", (unsigned)((unsigned char)buf[i]));
+      fprintf(stderr, "\n#");
+    }
+    /* we dont accept chars which could destroy database file */
+    for (i=0; i<dd; i++) if (buf[i]<32) break; /* need unsigned char here */
+    endchar=buf[i]; /* last char is 0x0a (ret) 0x00 (EOF) or 0x1b (alt+ret) */
+    if (endchar==0x01) { i=0;JOB->cfg.mode&=~128; } /* skip all */
+    buf[dd=i]=0; /* replace final 0x0a or other special codes */
+    if (dd==1 && !(buf[0]&128)) { c=buf[0]; utf8_ok=1; } /* single char */
+    if (dd>1 && dd<7) {        /* try to decode single wide char (utf8) */ 
+      int u0, u1;  /* define UTF8-start sequences, u0=0bits u1=1bits */
+      u0=       1<<(7-dd);       /* compute start byte from UTF8-length */
+      u1=255&~((1<<(8-dd))-1);
+      /* count number of following 10xxxxxx bytes to i */
+      for (i=1;i<dd;i++) if ((buf[i]&0xc0)!=0x80) break; /* 10xxxxxx */
+      if (i==dd && (buf[0]&(u0|u1))==u1) { utf8_ok=1;
+        c=buf[0]&(u0-1);                                 /* 11..0x.. */
+        for (i=1;i<dd;i++) { c<<=6; c|=buf[i]&0x3F; }    /* 10xxxxxx */
+      }
+    }
+    if (dd>0){ /* ToDo: skip space and tab too? */
+      if (utf8_ok==1) { setac(box1, c, 100); } /* store single wchar */
+      if (utf8_ok==0) {     /* store a string of chars (UTF8-string) */
+        c='_'; /* what should we do with c? probably a bad idea? */
+        setas(box1, (char *)buf, 100);
+      }
+      /* decide between
+       *  0) just help gocr to find the results and (dont remember, 0x01)
+       *  1) help and remember in the same run (store to memory, 0x1b)
+       *  2) expand the database (dont store ugly chars to the database!)
+       */
+      if (endchar!=0x01){ /* ^a before hit return */
+      /* is there a reason to dont store to memory? */
+        list_app(&JOB->tmp.dblist, box1); /* append to list for 1+2 */
+      }
+      if (endchar!=0x01 && endchar!=0x1b){
+        store_db(box1);  /* store to disk for 2 */
+      }
+      if (JOB->cfg.verbose)
+        fprintf(stderr, " got  char= %c  16bit= 0x%04x  string= \"%s\"\n",
+           ((c>32 && c<127)?(char)c:'.'), (int)c, buf);
+    }
+  }
+  
+  return c;
+}