Elsevier

Pattern Recognition Letters

Volume 32, Issue 9, 1 July 2011, Pages 1267-1273
Pattern Recognition Letters

Hybrid line simplification for cartographic generalization

https://doi.org/10.1016/j.patrec.2011.03.013Get rights and content

Abstract

The performance of a line simplification algorithm can be different depending on the shape characteristics of the line data. Methodologies for segmenting a line feature into homogeneous sections and simplifying the segments with a proper algorithm are of great importance in linear generalization. This study proposes a methodology for segmenting and simplifying linear features based on the quantitative characteristics of a line. We analyzed the performance of existing simplification algorithms based on the geometrical attributes of line shapes. The analyzed data was used as a criterion for segmenting line data and selecting simplification algorithms appropriate for each segment. Then, we implemented segmentation and hybrid line simplification on topographic map data with a 1:1000 scale. To evaluate the performance of this methodology, visual and statistical assessments were implemented. As a result, this hybrid approach preserves more of the shape characteristics and produces less positional errors than the individual application of existing algorithms.

Highlights

► Three line simplification algorithms are combined by the hybrid methodology. ► Line features are segmented and classified to the most suitable algorithm. ► Each segment is simplified by the suitable algorithm and merged again. ► Results of hybrid simplification are better than those of the individual application.

Introduction

Recently, the location-based service industry has grown quickly and the utilization of digital maps on the Internet and in mobile environments has become ubiquitous. Cartographic generalization is an indispensable technique for transferring or changing scale of digital maps in these environments (Jones and Ware, 2005). Line simplification is one of the most important operators in cartographic generalization (Li and Openshaw, 1993). Since the 1960s, innumerable simplification algorithms have been developed in the cartographic generalization and pattern recognition area: the Douglas–Peucker algorithm (Douglas and Peucker, 1973), the sleeve-fitting algorithm (Zhao and Saalfeld, 1997), the Lang algorithm (Lang, 1969), the Reumann–Witkam algorithm (Reumann and Witkam, 1974), the Visvalingam–Whyatt algorithm, (Visvalingam and Whyatt, 1993) simplification based on turning angle functions (Rangayyan et al., 2008) and many other algorithms. It is well known that the performance of a line simplification algorithm depends on the shape characteristics of the line feature (Balboa and Lopez, 2009). Thus, segmenting the line feature into homogeneous sections and applying appropriate algorithms and parameters depending on the shape characteristics of a section are important for improving the performance of the simplification National Geographic Information Institute (NGI), 1995, Visvalingam and Williamson, 1995, Richardson and Mackaness, 1999, Richardson and Mackaness, 1999, Dutton, 1999, Lopez and Balboa, 2008.

Although countless segmentation and simplification methodologies for linear features have been developed, little research has been done to investigate simplification options by using a quantitative analysis of the effects of various algorithms based on the shape of line features. It is also a shortcoming of these studies that they mainly depend on the subjective knowledge of experts to determine the subsections in a line feature and to identify the appropriate algorithms or parameters. Moreover, the generalization quality is evaluated merely by a visual or qualitative assessment in many cases (Skopeliti and Tsoulos, 1999, Chen and Chen, 2005, Mustiere, 2005, Balboa and Lopez, 2008, Balboa and Lopez, 2009, Lopez and Balboa, 2008).

In this paper, we propose a new methodology for segmenting and simplifying linear features based on the quantitative characteristics of a line. Three key points emerge as potential contributions of this study. First, we present a segmentation method based on a quantitative analysis of the performances of the simplification algorithms according to the shape characteristics of the linear features. Second, we propose a hybrid simplification method that applies different simplification algorithms for these segments in order to produce the least positional error. Third, we analyze the visual aspects and displacements between the original line data and the simplified line for a qualitative and quantitative evaluation of the proposed methodology.

This paper consists of five sections. In Section 2, the processes of segmentation and simplification proposed in this study are described in detail. Section 3 shows the results of tests applying these processes to a cartographic line data set. In Section 4, visual and statistical assessments of the results are presented. Finally, the conclusions of this study and possible future work are presented in Section 5.

Section snippets

Methodological framework

The methodological framework of the hybrid line simplification method consists of two parts. One is quantitative characterization, and the other is segmentation and simplification. In the former part, after applying the existing algorithms to the line data for analysis, the sections with exclusively high performance (SEHP) for a specific algorithm are detected. Such sections make it possible to produce training data for segmentation, which is generated from the analysis of the shape

Tests and results

The line data considered in this study are the outlines of buildings, roads and rivers extracted from digital topographic maps with a 1:1000 scale in the region of Daejeon in Korea. Fig. 3-1 shows the topographic map of the region used for the test. We used 25 building outlines, 10 road outlines and 10 river outlines as the line data for analysis. ArcGIS 9.0 and Matlab 7.0 were used for the implementation and evaluation of the proposed methodologies.

For the quantitative characterization, three

Evaluation

Visual and statistical assessments were implemented to evaluate the simplified results from the hybrid method and the individual applications of simplification algorithms.

The aspects of shape change after simplification can be verified in the resulting line features in Table 3-1. To do the visual assessment, three shape characteristics were compared for each simplified line feature: a rectangular shape, a curved shape with a large radius and a curved shape with a small radius. As a result of

Conclusions and future work

In the automatic generalization of cartographic maps, line simplification methods using segmentation of line features have been spotlighted as an important issue. In this study, we conducted segmentation and simplification of linear features based on a quantitative analysis of the shape characteristics of a given line section. Our methodology consists of two major parts: (1) an analysis of the parametric descriptions of the sections that show exclusively high performance (SEHP) for each

Acknowledgements

This research is supported by a Grant (07KLSGC04) from Cutting-edge Urban Development—Korean Land Spatialization Research Project, funded by the Ministry of Land, Transport and Maritime Affairs.

In addition, the authors appreciate the support of the Integrated Research Institute of Construction and Environmental Engineering at Seoul National University, Korea.

References (25)

  • J.L.G. Balboa et al.

    Generalization-oriented road line classification by means of an artificial neural network

    Geoinformatica

    (2008)
  • J.L.G. Balboa et al.

    Sinuosity pattern recognition of road features for segmentation purposes in cartographic generalization

    Pattern Recognition

    (2009)
  • Chen, C.F., Chen, M.H., 2005. Generalization of GIS polygon data using curvature-based approach. In: Proc. IGARSS‘05,...
  • D. Douglas et al.

    Algorithms for the reduction of the number of points required to represent a digitized line or its caricature

    Can. Cartographer

    (1973)
  • G. Dutton

    Scale, sinuosity, and point selection in digital line generalization

    Cartogr. Geogr. Inform. Sci.

    (1999)
  • Gribov, A., Bodansky, E., 2004. A new method of polyline approximation. In: Proc. SSPR & SPR 2004, LNCS, vol. 3138, pp....
  • Gribov, A., Bodansky, E., 2006. Reconstruction of orthogonal polygonal lines. In: Proc. DAS 2006, LNCS, vol. 3872, pp....
  • Haunert, J.H., Wolff, A., 2008. Optimal simplification of building ground plans. In: Proc. ISPRS Congress, Beijing,...
  • C.B. Jones et al.

    Map generalization in the Web age

    Int. J. Geogr. Inform. Sci.

    (2005)
  • T. Lang

    Rules for robot draughtsmen

    Geogr. Mag.

    (1969)
  • Z.L. Li et al.

    A natural principle for the objective generalization of digital maps

    Cartogr. Geogr. Inform. Systems

    (1993)
  • F.J.A. Lopez et al.

    Generalization-oriented road line segmentation by means of an artificial neural network applied over a moving window

    Pattern Recognition

    (2008)
  • Cited by (0)

    View full text