INFORMATION THEORY OF CARTOGRAPHY: A FRAMEWORK FOR ENTROPY-BASED CARTOGRAPHIC COMMUNICATION THEORY

Author(s):  
Z. Li

Abstract. Map is an effective communication means. It carries and transmits spatial information about spatial objects and phenomena, from map makers to map users. Therefore, cartography can be regarded as a communication system. Efforts has been made on the application of Shannon Information theory developed in digital communication to cartography to establish an information theory of cartography, or simply cartographic information theory (or map information theory). There was a boom during the period from later 1960s to early 1980s. Since later 1980s, researcher have almost given up the dream of establishing the information theory of cartography because they met a bottleneck problem. That is, Shannon entropy is only able to characterize the statistical information of map symbols but not capable of characterizing the spatial configuration (patterns) of map symbols. Fortunately, break-through has been made, i.e. the building of entropy models for metric and thematic information as well as a feasible computational model for Boltzmann entropy. This paper will review the evolutional processes, examine the bottleneck problems and the solutions, and finally propose a framework for the information theory of cartography. It is expected that such a theory will become the most fundamental theory of cartography in the big data era.

2019 ◽  
Vol 1 ◽  
pp. 1-1
Author(s):  
Hong Zhang ◽  
Peichao Gao ◽  
Zhilin Li

<p><strong>Abstract.</strong> Spatial information is fundamentally important to our daily life. It has been estimated by many scholars that almost 80 percent or more of all information in this world are spatially referenced and can be regarded as spatial information. Given such importance, a discipline called spatial information theory has been formed since the late 20th century. In addition, international conferences on spatial information have been frequently held. For example, COSIT (Conference on Spatial Information Theory) was established in 1993 and are held every two years all over the world.</p><p>In spatial information theory, one fundamental question is how to measure the amount of information (i.e., information content) of a spatial dataset. A widely used method is to employ entropy, which is proposed by the American mathematician Claude Shannon in 1948 and usually referred to as Shannon entropy or information entropy. This information entropy was originally designed to measure the statistical information content of a telegraph message. However, a spatial dataset such as a map or a remote sensing image contains not only statistical information but also spatial information, which cannot be measured by using the information entropy.</p><p>As a consequence, considerable efforts have been made to improve the information entropy for spatial datasets in either a vector format of a raster format. There are two basic lines of thought. The first is to improve the information entropy by defining how to calculate its probability parameters, and the other is to introduce new parameters into the formula of the information entropy. The former results in a number of improved information entropies, while the latter leads to a series of variants of the information entropy. Both seem to be capable of distinguishing different spatial datasets, but there is a lack of comprehensive evaluation of their performance in measuring spatial information.</p><p>This study first presents a state-of-the-art review of the improvements to the information entropy for the information content of spatial datasets in a raster format (i.e., raster spatial data, such as a grey image and a digital elevation model). Then, it presents a comprehensive evaluation of the resultant measures (either improved information entropies or variants of the information entropy) according to the Second Law of Thermodynamics. A set of evaluation criteria were proposed, as well as corresponding measures. All resultant measures were ranked accordingly.</p><p>The results reported in this study should be useful for entropic spatial data analysis. For example, in image fusion, a crucial question is how to evaluate the performance of a fusion algorithm. This evaluation is usually achieved by using the information entropy to measure the increase in the information content during the fusion. It can now be performed by the best-improved information entropy reported in this study.</p>


2019 ◽  
Vol 1 ◽  
pp. 1-1 ◽  
Author(s):  
Peichao Gao ◽  
Hong Zhang ◽  
Zhilin Li

<p><strong>Abstract.</strong> Entropy is an important concept that originated in thermodynamics. It is the subject of the famous Second Law of Thermodynamics, which states that “the entropy of a closed system increases continuously and irrevocably toward a maximum” (Huettner 1976, 102) or “the disorder in the universe always increases” (Framer and Cook 2013, 21). Accordingly, it has been widely regarded as an ideal measure of disorder. Its computation can be theoretically performed according to the Boltzmann equation, which was proposed by the Austrian physicist Ludwig Boltzmann in 1872. In practice, however, the Boltzmann equation involves two problems that are difficult to solve, that is the definition of the macrostate of a system and the determination of the number of possible microstates in the microstate. As noted by the American sociologist Kenneth Bailey, “when the notion of entropy is extended beyond physics, researchers may not be certain how to specify and measure the macrostate/microstate relations” (Bailey 2009, 151). As a result, this entropy (also referred to as Boltzmann entropy and thermodynamic entropy) has remained largely at a conceptual level.</p><p> In practice, the widely used entropy is actually proposed by the American mathematician, electrical engineer, and cryptographer Claude Elwood Shannon in 1948, hence the term Shannon entropy. Shannon entropy was proposed to quantify the statistical disorder of telegraph messages in the area of communications. The quantification result was interpreted as the information content of a telegraph message, hence also the term information entropy. This entropy has served as the cornerstone of information theory and was introduced to various fields including chemistry, biology, and geography. It has been widely utilized to quantify the information content of geographic data (or spatial data) in either a vector format (i.e., vector data) or a raster format (i.e., raster data). However, only the statistical information of spatial data can be quantified by using Shannon entropy. The spatial information is ignored by Shannon entropy; for example, a grey image and its corresponding error image share the same Shannon entropy.</p><p> Therefore, considerable efforts have been made to improve the suitability of Shannon entropy for spatial data, and a number of improved Shannon entropies have been put forward. Rather than further improving Shannon entropy, this study introduces a novel strategy, namely shifting back from Shannon entropy to Boltzmann entropy. There are two advantages of employing Boltzmann entropy. First, as previously mentioned, Boltzmann entropy is the ideal, standard measure of disorder or information. It is theoretically capable of quantifying not only the statistical information but also the spatial information of a data set. Second, Boltzmann entropy can serve as the bridge between spatial patterns and thermodynamic interpretations. In this sense, the Boltzmann entropy of spatial data may have wider applications. In this study, Boltzmann entropy is employed to quantify the spatial information of raster data, such as images, raster maps, digital elevation models, landscape mosaics, and landscape gradients. To this end, the macrostate of raster data is defined, and the number of all possible microstates in the macrostate is determined. To demonstrate the usefulness of Boltzmann entropy, it is applied to satellite remote sensing image processing, and a comparison is made between its performance and that of Shannon entropy.</p>


1997 ◽  
Vol 06 (04) ◽  
pp. 423-450 ◽  
Author(s):  
Baher A. El-Geresy ◽  
Alia I. Abdelmoty

In this paper we propose a general approach for reasoning in space. The approach is composed of a set of two general constraints to govern the spatial relationships between objects in space, and two rules to propagate relationships between those objects. The approach is based on a novel representation of the topology of the space as a connected set of components using a structure called adjacency matrix which can capture the topology of objects of different complexity in any space dimension. The formalism is used to explain spatial compositions resulting in indefinite and definite relations and it is shown to be applicable to reasoning in the temporal domain. The main contribution of the formalism is that it provides means for constructing composition tables for objects with arbitrary complexity in any space dimension. A new composition table between spatial objects of different types is presented. A major advantage of the method is that reasoning between objects of any complexity can be achieved in a defined limited number of steps. Hence, the incorporation of spatial reasoning mechanisms in spatial information systems becomes possible.


2015 ◽  
pp. 586-598
Author(s):  
Sahib Jan ◽  
Angela Schwering ◽  
Jia Wang ◽  
Malumbo Chipofya

Sketch maps are externalizations of cognitive maps which are typically distorted, schematized, incomplete, and generalized. Processing spatial information from sketch maps automatically requires reliable formalizations which are not subject to schematization, distortion or other cognitive effects in sketch maps. Based on previous empirical work, the authors identified different sketch aspects such as ordering, topology and orientation to align and integrate spatial information from sketch maps with metric maps qualitatively. This research addresses the question how these qualitative sketch aspects can be formalized for a computational approach for sketch map alignment. In this study, the authors focus on the ordering aspect: ordering of landmarks and street segments along routes and around junctions. The authors first investigate different qualitative representations and propose suitable representations to formalize these aspects. The proposed representations capture qualitative relations between spatial objects in the form of qualitative constraint networks. The authors then evaluate the proposed representations by testing the accuracy of qualitative constraints between sketched objects and their corresponding objects in a metric map. The results of the evaluation show that the proposed representations are suitable for the alignment of spatial objects from sketch maps with metric maps.


Sign in / Sign up

Export Citation Format

Share Document