1. A process of segmenting data bits derived in response to scanning characters, comprising the steps of: (a) isolating a descrete group of said data bits which may be associated with more than one character; (b) examining said discrete group of data bits according to predetermined criteria in search for a Possible joint between first and second groups of data bits within said group; (c) selecting a segmentation vector according to second predetermined criteria to separate said first and second groups of data bits; and (d) separating said first and second groups of data bits at said joint along a selected said segmentation vector; said data bits consisting of binary ones and zeros and said selecting step including the step of: (c-1) finding the length of the shortest segmentation vector consisting of binary ones which lies within a predetermined range and which also provides a path of binary zero from the outward end of said segmentation vector to a predetermined side of the associated object; said predetermined range being given by the equation: EQU MP-MP/2.ltoreq.R.ltoreq.(MP+MP/2); wherein MP is equal to the midpoint of said discrete group of data bits and R is equal to said predetermined range.