#18 Spatial Recogntion and Grouping of Text and Graphics

Summary:

This paper introduces a method to recognize and group text and graphics. It only uses spatial information to do this work.  Basically, it is a search method to find the best grouping. First of all, the authors construct a neighborhood graph that connects close vertex. They also restrict the size of each subset to be <= k.   Since the size of the searching space is combinatorial in the number of the vertex, A* is used to prune away less possible branches. A recognizer is then built using boosted decision trees.

Discussion:

The idea of using graph is similar with the graph-based recognizer.  Also, choosing heuristic function is important for A* searching method.