Study on automatic vectorization of thematic map based on Neighborhood Filling

It is difficult to distill vector data from thematic map automatically and accurately because of disturb information. Therefore, an algorithm named Neighborhood Filling is discussed here to separate disturb information from thematic map. On the basis of distinction between disturb information and the interference background information. Set some background information on the priority. Use principle of space nearest neighbor information and priority to fill interference neighborhood on disturb information. Experiment shows that the algorithm can effectively remove the interference information and to restore the image. So that making the thematic map automatic vectorization is possible.