Defining a layout of text lines of CJK and non-CJK characters

A device for detecting the boundaries of characters in an electronic image, the electronic image including representations of glyphic characters, the device comprising:

• a processor;
• and
• a memory configured with processor-executable instructions which, when executed by the processor, implement a method, the method comprising:
• identifying a line of characters in the electronic image;
• detecting character gaps in the line of characters;
• creating a histogram of distances for the detected character gaps;
• and
• constructing a linear division graph (LDG) according to the detected character gaps by performing steps including:
• isolating values substantially near maxima values in the histogram of distances, wherein the isolated values are associated with respective detected character gaps;
• creating arcs for each detected character gap;
• assigning a penalty to the arcs;
• creating paths associated with the LDG;
• calculating aggregate penalties for each path associated with the LDG based on the penalties assigned to the arcs;
• and
• selecting a desired path from among the paths associated with the LDG based on the aggregate penalties associated with the paths.

One or more physical non-transitory computer accessible media encoded with instructions for performing a method, the method comprising:

• identifying a line of characters in the electronic image;
• detecting character gaps in the line of characters;
• creating a histogram of distances for the detected character gaps;
• and
• constructing a linear division graph (LDG) according to the detected character gaps by performing steps including:
• isolating values substantially near maxima values in the histogram of distances, wherein the isolated values are associated with respective detected character gaps;
• creating arcs for each detected character gap;
• assigning a penalty to the arcs;
• creating paths associated with the LDG;
• calculating aggregate penalties for each path associated with the LDG based on the penalties assigned to the arcs;
• and
• selecting a desired path from among the paths associated with the LDG based on the aggregate penalties associated with the paths.