By Topic

Character grouping technique using 3D neighborhood graphs in raster map

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yong-Bin Kang ; Poydong, Seoul, South Korea ; Se-Young Ok ; Hwan-Gue Cho

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 many different types of character and each word has its own slanting line. For this, we propose the 3D neighborhood graph G from a given set of characters. In this graph, each vertex of G represents the separated characters and it is placed in 3D space according to the size of the character. This makes the bigger characters being located in the upper position, the smaller characters being placed in the bottom. We give an edge if two vertices are nearly placed in that 3D space. By this edge connection strategy we can easily find the words of various different size in a map

Published in:

Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on  (Volume:2 )

Date of Conference:

16-20 Aug 1998