MCR expression of document images based on maximum matching of bipartite graph

Proposes a new method for expressing binary images, named minimum covering run (MCR) expression. The proposed technique adapted from horizontal-vertical run expression, is derived by selecting suitable runs from horizontal and vertical run types which minimize the total number of runs that still represent the original images perfectly. It is shown that horizontal and vertical runs of binary image can be thought as partite sets of a bipartite graph. Consequently, the MCR expression that corresponds to maximum matching in the graph, can be found by using an algorithm solving this graph-theoretic problem. An efficient algorithm for the expression method is presented, and results show the validity of stroke extraction of information in document images