Elsevier

Computers & Geosciences

Volume 57, August 2013, Pages 124-132
Computers & Geosciences

Pareto-based evolutionary algorithms for the calculation of transformation parameters and accuracy assessment of historical maps

https://doi.org/10.1016/j.cageo.2013.04.010Get rights and content

Highlights

  • Historical map data involves transformation of the coordinates to the current system.

  • The main problem is that the quality of historical data is heterogeneous.

  • Sometimes it is necessary to discard some of the historical input data.

  • The proposed method is Pareto front based on evolutionary genetic algorithms.

  • This method reduces linear error by 40% by eliminating only 2% of the points used.

Abstract

When historical map data are compared with modern cartography, the old map coordinates must be transformed to the current system. However, historical data often exhibit heterogeneous quality. In calculating the transformation parameters between the historical and modern maps, it is often necessary to discard highly uncertain data. An optimal balance between the objectives of minimising the transformation error and eliminating as few points as possible can be achieved by generating a Pareto front of solutions using evolutionary genetic algorithms. The aim of this paper is to assess the performance of evolutionary algorithms in determining the accuracy of historical maps in regard to modern cartography. When applied to the 1787 Tomas Lopez map, the use of evolutionary algorithms reduces the linear error by 40% while eliminating only 2% of the data points. The main conclusion of this paper is that evolutionary algorithms provide a promising alternative for the transformation of historical map coordinates and determining the accuracy of historical maps in regard to modern cartography, particularly when the positional quality of the data points used cannot be assured.

Introduction

Historical maps are an important part of our cultural heritage (Jenny and Hurni, 2011). These maps not only represent valuable physical artefacts but also provide an important information source for historians and geographers, who frequently incorporate historical data into Geographical Information System (GIS) (Weir, 1997, Audisio et al., 2009). The scales, coordinate systems, projections, and surveying and mapping techniques used in historical maps vary widely (Podobnikar, 2009). The different reference systems employed in different historical maps often require coordinate transformations between them (Tierra et al., 2008). As historical maps typically exhibit higher degrees of inaccuracy and uncertainty compared to contemporary cartographic databases, it is not surprising that these two issues are of particular concern in historical cartography studies and historical GIS applications (Plewe, 2003). Accuracy analysis of early maps is therefore an important topic in historical cartography (Harley, 1968).

The positional accuracy of a point on a map is defined as the difference between its recorded location on the map and its actual location on the ground or location on a source of known higher accuracy (Tucci and Giordano, 2011).

The coordinate method calculates the correlation between two sets of map coordinates of points identified by modern latitudes and longitudes (Tobler, 1966). The deviation between each computer-generated point (digitised from an early map) and the corresponding point on the modern map can be displayed as a vector indicating the direction and magnitude of the error (Ravenhill and Gilg, 1974).

A related problem is the transformation of coordinates between two different geodetic reference systems. A set of points with known coordinates in both reference systems is used to obtain the transformation parameters. The Helmert transformation is one example of a commonly used method for geodesic transformations between two reference frames (Vanícek and Krakiwsky, 1986, Vanícek and Steeves, 1996). The quality of a transformation between two sets of coordinates depends on the positional quality of the points used to calculate the transformation parameters.

However, a problem arises when there is substantial spatial uncertainty in the historical data points. In this case, certain points with gross errors will not be used in the calculation of the accuracy of the entire map. When the inaccuracy of a measurement is not objectively known, as is frequently the case for historical maps, the measured feature is defined as uncertain (Hunter and Goodchild, 1993). Although uncertainty and inaccuracy are ontologically distinct concepts, it is often difficult to measure the two separately in practice, particularly in the context of historical maps (Hu, 2010).

In previous papers (Manzano-Agugliaro et al., 2012), the coordinates obtained from the historical map were displaced by the average latitude and longitude error to correct the absolute displacement error in the historical map, i.e., to correct the georeferencing error. Any points whose displacements from the corresponding points in the modern map exceeded a specified distance were then eliminated from the analysis. These points were considered to contain gross errors, either because of incorrect identification with the current points or due to a gross error in the historical map. The final estimate of the map accuracy is obtained based on the root mean square (RMS) displacement after the removal of the points with gross errors.

In this historical cartography, we cannot be certain that any given point is more accurate than another. To displace the coordinates on a historical map to positions such that the final (RMS) errors are minimal, many combinations must be performed, each time discarding the points that exceed a fixed maximum RMS for a gross or unacceptable error and then calculating the new errors. A historical map may exhibit rotation (due to projection effects) as well as horizontal and vertical scale errors in addition to latitudinal and longitudinal displacement, making the number of possible combinations that must be considered even higher. If we also aim to discard as few points as possible from the historical map, then the problem becomes multi-objective.

The multi-objective nature of these mapping problems makes the decision-making process complex. Fortunately, the increase in computational resources in recent years has allowed researchers to develop efficient computational algorithms for handling complex optimisation problems. In particular, multi-objective evolutionary algorithms (MOEAs) are known for their ability to optimise several objective functions simultaneously to provide a representative Pareto front, which is a set of problem solutions representing a trade-off between the objectives (Márquez et al., 2011). The aim of this paper is to assess the performance of evolutionary algorithms in determining the accuracy of historical maps in regard to modern cartography.

Section snippets

Concepts in multi-objective optimisation

Many of the problems faced in engineering and other disciplines are optimisation problems. Many optimisation problems are difficult to solve because of features such as non-linear formulations, constraints, and NP-hard complexity.

The techniques for solving optimisation problems generally fall into two categories. Exact techniques provide the optimal solution to a given problem but are impractical for handling NP-hard problems because of prohibitive computation time and/or memory requirements.

Data: historical cartography analysed

The map used in this paper is taken from the first edition of the Atlas Geográfico de España (AGE) by Tomás López (1730–1802), published in 1804. The historical context of the cartographic work of Tomás López has its origins in the arrival of Philip V to the Spanish throne. His prime minister, the marquis of La Ensenada (1702–1781) devised a set of reforms to improve the administration of country's mainland territories and called for a national cartographic base on which to surface and quantify

Procedure

The procedure can be divided into two stages (see Fig. 4):

  • Stage 1: Data filtering. The locations on which the algorithm is to be run are filtered as follows. First, the coordinates of the present-day locations and Tomas Lopez's towns are read in, and the data are stored in memory. We then calculate the distances between the locations as given by the two data sources. Once these distances have been obtained, we can calculate the mean error of the set of historical towns by taking the arithmetic

Results

When we run the programme based on the msPesa 50K algorithm on the 83 towns in the Kingdom of Jaen, we obtain the solutions that are partially shown in Table 1. Those solutions that eliminate the smallest number of towns are included. The Pareto front obtained consists of the best results from among 50,000 combinations of possible solutions, each based on 80 crosses (crossovers) and 10 mutations (mutation). The algorithm performs evaluations each time it runs, and the best solution is

Conclusions

The multi-objective nature of the historical cartography optimisation problem allows the problem to be tackled using Pareto-based optimisation techniques, such as the msPesa 50K algorithm.

The advantage of using Pareto fronts is that a solutions front, rather than a single solution, is obtained. The most suitable solution can therefore be adopted according to the specific requirements of the historical map in question.

Multi-objective optimisation allows any point or town with a high cartographic

Acknowledgements

This study was funded by project HAR2009-12937 (GIS Systematic Analysis for the Planimetric Accuracy of the Geographic Atlas of Spain of Tomas Lopez, 1804), a project of the Spanish Ministry of Science and Innovation.

References (33)

  • D. Corne et al.

    The Pareto envelope-based selection algorithm for multiobjective optimization. Parallel problem solving from nature PPSN VI

    Lecture Notes in Computer Science

    (2000)
  • P. Chias et al.

    The art of describing the territory: historic maps and plans of the bridge of Alcántara (Cáceres, España)

    Informes de la Construción

    (2012)
  • K. Deb et al.

    A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II

    IEEE Transactions on Evolutionary Computation

    (2002)
  • F. Edgeworth

    Mathematical psychics: an essay on the application of mathematics to the moral sciences

    (1881)
  • C. Gil et al.

    A hybrid method for solving multi-objective global optimization problems

    Journal of Global Optimization

    (2007)
  • F.W. Glover et al.

    Handbook of Metaheuristics

    (2003)
  • Cited by (20)

    • The network structure evolutionary optimization to geodetic monitoring in the aspect of information entropy

      2021, Measurement: Journal of the International Measurement Confederation
      Citation Excerpt :

      Another application is the assessment of the accuracy of historical maps when performing coordinate transformations to current systems. The authors [51] emphasize reducing the historical coordinate transformation error, with the simultaneous possibility of eliminating points of questionable quality. And in the following work, they confirm the usefulness of the evolutionary algorithms for the analysis of the points located accuracy in the data uncertainty obtained from historical maps [52].

    • The integrated optimization of underground stope layout designing and production scheduling incorporating a non-dominated sorting genetic algorithm (NSGA-II)

      2019, Resources Policy
      Citation Excerpt :

      They also allow multiple points in the Pareto front to be achieved in a single run of the algorithm (Bechikh et al., 2016). A limited number of researches have examined the use of evolutionary methods to solve the multi-objective optimization MOP problems in mine planning (Guria et al., 2005; Manzano-Agugliaro et al., 2013; Coelho et al., 2012). The counter-intuitive outcomes of the single objective integrated optimizations in underground mine planning include: a diminution in stope layout, - an increase in operating costs, and – reduction in ore recovery.

    • Wind turbine selection for wind farm layout using multi-objective evolutionary algorithms

      2014, Expert Systems with Applications
      Citation Excerpt :

      Every implemented algorithm provides a solution set (called Pareto Set) for the addressed problem. These algorithms have already been successfully used in other kinds of planning problems, e.g. greenhouse planning (Márquez et al., 2011), cartographic problems (Manzano-Agugliaro, San-Antonio-Gómez, López, Montoya, & Gil, 2013), vehicle routing problems with time windows (Baños, Ortega, Gil, Fernández, & de Toro, 2013) or power systems optimization (Montoya et al., 2010; Zavoianu et al., 2013). The paper is organized as follows.

    • The assessment of evolutionary algorithms for analyzing the positional accuracy and uncertainty of maps

      2014, Expert Systems with Applications
      Citation Excerpt :

      The majority of papers that have addressed multi-objective optimization employed the concept of Pareto-optimality to perform a comparison among several genetic algorithms (Anagnostopoulos & Mamanis, 2011; Baños, Ortega, Gil, Fernández, & de Toro, 2013; Fernández, Gil, Baños, & Montoya, 2013; Gómez-Lorente, Triguero, Gil, & Estrella, 2012) or traditional analyses (Dovgan, Javorski, Tušar, Gams, & Filipic, 2013; Sánchez, Montoya, Manzano-Agugliaro, & Gil, 2013). Previous studies show that the evolutionary algorithm msPESA is a viable alternative for transforming historical map coordinates, particularly where the quality of the position of the set of points to be used for the transformation cannot be assured (Manzano-Agugliaro, San-Antonio-Gómez, López, Montoya, & Gil, 2013). The aim of this study is the assessment of different evolutionary algorithms to determine the gross error in the control points and the accuracy of pre-geodetic maps.

    View all citing articles on Scopus
    View full text