Automatic Assembling of Cadastral Maps Based on Generalized Hough Transformation
There are numerous cadastral maps generated by past land surveying. The raster digitization of these paper maps is in progress. For effective and efficient use of these maps, we have to assemble the set of maps to make them superimposable on other geographic information in a Geographic Information System. The problem can be seen as a complex jigsaw puzzle where the pieces are the cadastre sections extracted from the map. We present an automatic solution to this geographic jigsaw puzzle, based on the generalized Hough transformation that detects the longest common boundary between every piece and its neighbors. The experiments have been conducted using the map of Mie Prefecture, Japan and the French cadastral map. The results of the experiment with the French cadastral maps show that the proposed method, which consists of extracting an external area and extracting and regularizing the north arrow, is suitable for assembling the cadastral map. The final goal of the process is to integrate every piece of the puzzle into a national geographic reference frame and database.
KeywordsCommon Boundary Hough Transformation Jigsaw Puzzle Internal Area Automatic Assemble
- 1.Viglino, J.-M., Guigues, L.: Cadastre Map Assembling: a Puzzle Game Resolution. In: Sixth International Conference on Document Analysis and Recognition, pp. 1235–1239 (2001)Google Scholar
- 3.Scarlatos, L.L.: Puzzle Piece Topology: Detecting Arrangements in Smart Object Interfaces. In: Proceedings of the 7th International Conference in Central Europe on Computer Graphics, Visualization and Interactive Digital Media, pp. 456–462 (1999)Google Scholar
- 4.Drogoul, A., Dubreuil, C.: A distributed approach to n-puzzle solving. In: Proceeding of the Distributed Artificial Intelligence Workshop (1993)Google Scholar