A Robust Algorithm for Text String Separation from Mixed Text/Graphics Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Recognizing Characters in Scene Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Tools for interactive map conversion and vectorization
ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2
| Hi-index | 0.00 |
The main problem in this paper is how to find the character which is placed on a line or curves of raster map. We give one novel algorithm to group each separated characters in a map. This word grouping is difficult especially in a map. since a map has lots of different types of character and each word has its own slanting line. For this. we propose the 3-D neighborhood graph G from a give set of characters. In this graph, each vertex of G represents the separated characters and it is placed in 3-D space according to the size of character. This makes the bigger characters will be located in the upper position, the smaller characters will be placed in the bottom. And we give an edge if two vertices are nearly placed in that 3-D space. By this edge connection strategy we can easily find the words of various different size in a map.