A Hierarchical Approach for Measuring the Consistency of Water Areas between Multiple Representations of Tile Maps with Different Scales

: In geographic information systems, the reliability of querying, analysing, or reasoning results depends on the data quality. One central criterion of data quality is consistency, and identifying inconsistencies is crucial for maintaining the integrity of spatial data from multiple sources or at multiple resolutions. In traditional methods of consistency assessment, vector data are used as the primary experimental data. In this manuscript, we describe the use of a new type of raster data, tile maps, to access the consistency of information from multiscale representations of the water bodies that make up drainage systems. We describe a hierarchical methodology to determine the spatial consistency of tile-map datasets that display water areas in a raster format. Three characteristic indices, the degree of global feature consistency, the degree of local feature consistency, and the degree of overlap, are proposed to measure the consistency of multiscale representations of water areas. The perceptual hash algorithm and the scale-invariant feature transform (SIFT) descriptor are applied to extract and measure the global and local features of water areas. By performing combined calculations using these three characteristic indices, the degrees of consistency of multiscale representations of water areas can be divided into ﬁve grades: exactly consistent, highly consistent, moderately consistent, less consistent, and inconsistent. For evaluation purposes, the proposed method is applied to several test areas from the Tiandi map of China. In addition, we identify key technologies that are related to the process of extracting water areas from a tile map. The accuracy of the consistency assessment method is evaluated, and our experimental results conﬁrm that the proposed methodology is efﬁcient and accurate.


Introduction
Five essential dimensions regarding a possible geospatial data standard, including the positional accuracy, attribute accuracy, logical consistency, completeness, and lineage, were proposed in the 1980s [1].These five dimensions eventually formed the basis for defining data-quality elements.Logical consistency is a crucial element of spatial data quality [2]; thus, maintaining the consistency of spatial data is very important for aspects, including the high-speed transmission of spatial data on the Internet [3], querying spatial data at multiple resolutions [4], and extracting and integrating information from spatial data with varying levels of detail [5].In particular, interest in volunteered geographic information (VGI) has rapidly increased in recent years [6].An official spatial dataset can be considerably different from a VGI dataset.The integration of VGI data (e.g., OpenStreetMap) and official data is an important issue for many applications such as data-description enrichment [7,8], data-quality enhancement [9], and data-change detections.However, the consistency of geographical ISPRS Int.J. Geo-Inf.2017, 6, 240 2 of 20 objects at different scales must be assessed and maintained when integrating spatial data.Therefore, additional attention should be paid to the consistency of spatial data with the rapid development of computational power and the Internet.
Previous methods of consistency assessment can be classified into two categories [10], specifically object-based consistency [11][12][13][14] and relation-based consistency [15][16][17][18][19][20][21].Object-based consistency mainly involves the similarity of shapes, structures, and dimensions of geographical objects at different levels of detail.Dettoriet et al. [11] assessed the geometrical consistency of spatial objects under the influence of a simplification operator.Delis et al. [12] proposed a framework to evaluate the geometrical consistency of line elements between two map layers.Du et al. [13] proposed a model to assess the structural consistency of complex regions.In this approach, the closest structure-level graph is used to form multiple potential representations of complex regions.Generalization operators are then used to automatically generate correspondences at different scales.Finally, the correspondences are used to assess the structural consistency of spatial objects at different levels of detail.Relation-based consistency mainly considers the similarity of relative sizes, directional relationships, and topological relationships among geographical objects at different scales and resolutions.Egenhoferet et al. [15] developed a framework to assess the topological consistency at different levels of detail based on topological homeomorphism.Tryfona and Egenhofer [16] evaluated the topological consistency of spatial objects at different scales by considering homogeneous and heterogeneous networks and proposed a framework to drive topological relationships among aggregates from the relationships among the components.Du et al. [19] proposed computational measures to derive the directional relationships between spatial objects on a coarse level using the relationships among spatial objects at a detailed level.The consistency of the directional relationships among these multiple representations can then be assessed by determining whether the derived relationships match those established from the multi-resolution spatial objects at a coarse level.Andrea et al. [20] developed methods to assess the degree of violation of a topological dependency constraint using geometries stored in a spatial-database instance.Brisaboa et al. [21] developed a method to measure the inconsistency of spatial datasets with respect to a set of topological constraints that should be maintained between the spatial objects in the dataset.
Studies of similarity calculations for area elements have mainly considered the shape similarity factor.Global indicators for shape measurement such as the perimeter, size, convex perimeter, compactness, roughness, and elongation can be used to measure degrees of similarity between objects [22].Fourier descriptors are also widely used to calculate the shape similarity [23] because these factors are invariant to starting point shifts in the polygon curve.In addition, similarities have been measured by using complex methods (e.g., computational geometry [24], polygon curve representations [25], the morphological characterization method [26], and the correspondence of visual parts [27]).
The above information indicates that most studies have used vector data to access the consistency of spatial data, whereas few studies have used raster data.However, data sources and GIS types can vary in the context of big data.Extracting meaningful information from a growing collection of unstructured data (e.g., pictures, street views, 3D models, and videos) is necessary but challenging.Therefore, we must use a new form of raster data, namely tile maps, to measure the consistency of representations of water features.
In contrast, the scale of spatial data tends to be the same or at an adjacent scale, and multiscale spatial data are relatively rarely addressed in the studies discussed above.However, spatial data can be generated at a lower resolution using different generalization operators such as simplification, smoothing, aggregation, omission, and displacement [28].Therefore, multi-resolution spatial data always contain inconsistencies in their topological, directional, and metric relationships because of differences in the measurement methods, data acquisition approaches, and map-generalization algorithms.Consistency assessment methods used at individual scales are not appropriate for multiscale cases.Thus, a new method is required to verify such inconsistencies.
Inconsistencies must be identified before they can be corrected, and such inconsistencies can help identify potentially problematic areas that require the collection of additional data or characterize the degree of certainty associated with information [29].However, whether such differences occur normally due to the generalization algorithms or because of the presence of erroneous or outdated data in a given database must be determined to make the best use of these inconsistencies [30][31][32][33].Therefore, prior to the inconsistent processing of spatial data, we must determine the degree of inconsistency present in the data and determine whether the inconsistencies are reasonable or problematic in order to better address inconsistent data in future work.For example, Figure 1 shows two lakes that are inconsistently represented among the multiple scales.Lake A appears at levels 10 and 12, but it disappears at level 11.This inconsistent representation of lake A is unreasonable because its expression is discontinuous.Lake B displays an abrupt change from level 9 to level 10.As the changes between adjacent scales should be progressive, this kind of inconsistency has a negative effect on the acceptance of geographic information by users and their reasoning about that information.We must therefore identify types of inconsistencies that are reasonable or unreasonable to avoid placing unnecessary cognitive burdens on the user and to provide better geographic information services for public use.Inconsistencies must be identified before they can be corrected, and such inconsistencies can help identify potentially problematic areas that require the collection of additional data or characterize the degree of certainty associated with information [29].However, whether such differences occur normally due to the generalization algorithms or because of the presence of erroneous or outdated data in a given database must be determined to make the best use of these inconsistencies [30][31][32][33].Therefore, prior to the inconsistent processing of spatial data, we must determine the degree of inconsistency present in the data and determine whether the inconsistencies are reasonable or problematic in order to better address inconsistent data in future work.For example, Figure 1 shows two lakes that are inconsistently represented among the multiple scales.Lake A appears at levels 10 and 12, but it disappears at level 11.This inconsistent representation of lake A is unreasonable because its expression is discontinuous.Lake B displays an abrupt change from level 9 to level 10.As the changes between adjacent scales should be progressive, this kind of inconsistency has a negative effect on the acceptance of geographic information by users and their reasoning about that information.We must therefore identify types of inconsistencies that are reasonable or unreasonable to avoid placing unnecessary cognitive burdens on the user and to provide better geographic information services for public use.Therefore, this paper uses new unstructured tile data to detect inconsistencies in multiscale representations of water areas.We also grade the degrees of inconsistency in a hierarchical manner.Following this introduction, Section 2 describes the hierarchical framework of the inconsistency assessment method for multiscale representations of water areas based on tile data.In Section 3, we describe the methods used to perform feature description, feature extraction, and comparisons at each level.Section 4 presents the results of the experiments, illustrates the proposed approaches, and provides a discussion and analysis of these approaches.Section 5 presents the conclusions.

Framework of Hierarchical Consistency Assessment for Water Areas
To address the problems outlined above, we must consider the inconsistencies that occur among multiple scales rather than two uniform or adjacent scales.Methods of distinguishing and grading inconsistency information from multiscale spatial data must be determined.In this Therefore, this paper uses new unstructured tile data to detect inconsistencies in multiscale representations of water areas.We also grade the degrees of inconsistency in a hierarchical manner.Following this introduction, Section 2 describes the hierarchical framework of the inconsistency assessment method for multiscale representations of water areas based on tile data.In Section 3, we describe the methods used to perform feature description, feature extraction, and comparisons at each level.Section 4 presents the results of the experiments, illustrates the proposed approaches, and provides a discussion and analysis of these approaches.Section 5 presents the conclusions.

Framework of Hierarchical Consistency Assessment for Water Areas
To address the problems outlined above, we must consider the inconsistencies that occur among multiple scales rather than two uniform or adjacent scales.Methods of distinguishing and grading inconsistency information from multiscale spatial data must be determined.In this manuscript, we hierarchically use both global and local features of images to analyze and study this problem.
Fundamentally, the features that are extracted from the images can be divided into two types: global features and local features.The features within images can also be referred to as descriptors.Global descriptors can be used for object detection, object classification, or image retrieval, whereas local descriptors are widely used for object identification or recognition.Global features describe the image as a whole and can generalize the entire object using a single vector, whereas local features describe image patches of an object and are usually expressed in the form of key points.Global and local features provide different types of information about images because of the differences in the computing methods of the two representations.Global features typically include shape descriptors, texture features, and contour representations, whereas local features represent textures in an image patch.
Water areas are expressed in the form of map tiles in this study; thus, we combined local and global features to measure the similarity of match objects.During comparisons, the general features are extracted and compared, and the detailed features are then considered.This approach or method for resolving a problem from the general to the specific or from the whole to the part is referred to as a hierarchical method.A combination of global and local features improves the accuracy of similarity calculations and provides an effective method to grade the degree of consistency.
The basic principle of feature comparison is shown in Figure 2. Let us assume that we have an object S and must select the most similar object to S from objects a, b, and c.When our brain begins to screen, objects that are not similar in appearance, such as object c in this case, are preferentially ignored.This process can be regarded as the analysis and comparison of general features on a global level.After performing a preliminary selection of objects a and b, we must further identify the most similar object from objects a and b.Naturally, we focus on the detailed features of objects a and b.This process can be regarded as an analysis and comparison of detailed features at a local level.Finally, we select object a as the best choice.Fundamentally, the features that are extracted from the images can be divided into two types: global features and local features.The features within images can also be referred to as descriptors.Global descriptors can be used for object detection, object classification, or image retrieval, whereas local descriptors are widely used for object identification or recognition.Global features describe the image as a whole and can generalize the entire object using a single vector, whereas local features describe image patches of an object and are usually expressed in the form of key points.Global and local features provide different types of information about images because of the differences in the computing methods of the two representations.Global features typically include shape descriptors, texture features, and contour representations, whereas local features represent textures in an image patch.
Water areas are expressed in the form of map tiles in this study; thus, we combined local and global features to measure the similarity of match objects.During comparisons, the general features are extracted and compared, and the detailed features are then considered.This approach or method for resolving a problem from the general to the specific or from the whole to the part is referred to as a hierarchical method.A combination of global and local features improves the accuracy of similarity calculations and provides an effective method to grade the degree of consistency.
The basic principle of feature comparison is shown in Figure 2. Let us assume that we have an object S and must select the most similar object to S from objects a, b, and c.When our brain begins to screen, objects that are not similar in appearance, such as object c in this case, are preferentially ignored.This process can be regarded as the analysis and comparison of general features on a global level.After performing a preliminary selection of objects a and b, we must further identify the most similar object from objects a and b.Naturally, we focus on the detailed features of objects a and b.This process can be regarded as an analysis and comparison of detailed features at a local level.Finally, we select object a as the best choice.In this study, when comparing two matching targets and measuring their consistency, we analyze the global features first, followed by the local features.The degree of consistency is measured and graded according to the feature similarities of the two levels.In this study, when comparing two matching targets and measuring their consistency, we analyze the global features first, followed by the local features.The degree of consistency is measured and graded according to the feature similarities of the two levels.

Framework for Measuring Consistency
Framework for Measuring Consistency into five components (object extraction, object matching, feature comparison and analysis, and consistency measurement), which are shown in Figure 3, to treat tile data as a potential object of consistency assessment.proposed method into five components (object extraction, object matching, feature comparison and analysis, and consistency measurement), which are shown in Figure 3, to treat tile data as a potential object of consistency assessment.(

1) Object Extraction
Water extraction involves the separation of water elements from a tile map.As tile technologies have become increasingly advanced, many map suppliers have begun to treat drainage systems as independent elements, and water areas can be directly extracted from map services (e.g., the Tiandi map for China).However, considering the problems of technological universality, the extraction of water from tile elements remains a problem that cannot be ignored.Water is a key component of tile maps and typically has a uniform blue colour within the same map.Thus, image threshold segmentation methods represent the simplest and most effective means of extracting water areas.To obtain more satisfactory extraction results, certain mature tools such as noise removal algorithms and fracture repair algorithms are also applied to extract water areas from map tiles in this study.We do not focus heavily on these tools in this paper.
(2) Object Matching We match the drainage system by overlaying tile data of different levels.The tile data are organized in a pyramid shape.At the smallest scale, the Earth is shown as one image at 256 pixels by 256 pixels.When the zoom level is increased, the quantity of images increases four-fold, following a given pattern, as shown in Figure 4. Therefore, magnification at a high level must only be performed four times to match the water area and overlay it with low-level tiles from the same coordinate system.Overlapping water elements can be treated as targets with the same name.(

1) Object Extraction
Water extraction involves the separation of water elements from a tile map.As tile technologies have become increasingly advanced, many map suppliers have begun to treat drainage systems as independent elements, and water areas can be directly extracted from map services (e.g., the Tiandi map for China).However, considering the problems of technological universality, the extraction of water from tile elements remains a problem that cannot be ignored.Water is a key component of tile maps and typically has a uniform blue colour within the same map.Thus, image threshold segmentation methods represent the simplest and most effective means of extracting water areas.To obtain more satisfactory extraction results, certain mature tools such as noise removal algorithms and fracture repair algorithms are also applied to extract water areas from map tiles in this study.We do not focus heavily on these tools in this paper.
(2) Object Matching We match the drainage system by overlaying tile data of different levels.The tile data are organized in a pyramid shape.At the smallest scale, the Earth is shown as one image at 256 pixels by 256 pixels.When the zoom level is increased, the quantity of images increases four-fold, following a given pattern, as shown in Figure 4. Therefore, magnification at a high level must only be performed four times to match the water area and overlay it with low-level tiles from the same coordinate system.Overlapping water elements can be treated as targets with the same name.proposed method into five components (object extraction, object matching, feature comparison and analysis, and consistency measurement), which are shown in Figure 3, to treat tile data as a potential object of consistency assessment.(

1) Object Extraction
Water extraction involves the separation of water elements from a tile map.As tile technologies have become increasingly advanced, many map suppliers have begun to treat drainage systems as independent elements, and water areas can be directly extracted from map services (e.g., the Tiandi map for China).However, considering the problems of technological universality, the extraction of water from tile elements remains a problem that cannot be ignored.Water is a key component of tile maps and typically has a uniform blue colour within the same map.Thus, image threshold segmentation methods represent the simplest and most effective means of extracting water areas.To obtain more satisfactory extraction results, certain mature tools such as noise removal algorithms and fracture repair algorithms are also applied to extract water areas from map tiles in this study.We do not focus heavily on these tools in this paper.
(2) Object Matching We match the drainage system by overlaying tile data of different levels.The tile data are organized in a pyramid shape.At the smallest scale, the Earth is shown as one image at 256 pixels by 256 pixels.When the zoom level is increased, the quantity of images increases four-fold, following a given pattern, as shown in Figure 4. Therefore, magnification at a high level must only be performed four times to match the water area and overlay it with low-level tiles from the same coordinate system.Overlapping water elements can be treated as targets with the same name.(3) Object Feature Comparison Studies that have evaluated object-based consistency have mainly considered two factors: the shapes and structures of spatial objects.Scholars have always considered shapes, sizes, perimeters, convex perimeters, and other indicators when using traditional methods of feature comparisons that are based on vector data.However, coordinate data rather than image data have been used when measuring these indicators.Therefore, we compare the features of water areas via image processing.If the level of detail exceeds a certain threshold, a greater number of viewable objects corresponds to fewer objects that can be expressed [34].Features are compared based on the global structures of shapes, and local similarity criteria are used to further refine the comparisons.Multi-level features of area objects, which include global features and local features, are extracted, and improved algorithms are applied.Differences can be easily identified and evaluated when comparing the features of area objects.

(4) Consistency Measurement
From an engineering perspective, the concept of multiple representations is redundant.Thus, a method that can assess and measure the consistency of a database in order to better distinguish between reasonable and unreasonable inconsistencies is needed.Studies that compare maps or databases must explicitly manage fuzziness or uncertainty, partly because of the presence of inconsistencies within the data [35].Therefore, we grade the fuzziness or uncertainty of inconsistencies that are identified by comparing features in this section.The inconsistencies in multiscale representations of water areas are divided into five grades: exactly consistent, highly consistent, moderately consistent, less consistent, and inconsistent.

Feature Classification and the Degree of Consistency
A picture is a two-dimensional signal that includes different frequency components.Typically, a region that shows minor changes in brightness includes low-frequency components, which describe a broad range of information.A region that presents drastic changes in brightness such as the edge of an object includes high-frequency components, which describe detailed features.Accordingly, high frequencies provide detailed information about a picture, whereas low frequencies provide the framework of a picture.Thus, we use both general and detailed information to measure the consistency of water areas in this paper.

Degree of Global Feature Consistency
At the International Conference on Image Processing in 1996, Schneider and Chang [36] advanced the concept of image hashes.Subsequently, research on the theory and application of image hashes quickly raised concerns.Many algorithms for generating image hashes have also been proposed [37][38][39].In pictures, high frequencies provide detailed information, whereas low frequencies reveal structures.The average hash algorithm mainly takes advantage of the low-frequency information in pictures; therefore, we use the improved average hash algorithm to extract features of water areas using the following steps.
(1) Determine the calculation region.A reasonable calculation region should be identified before feature extraction.In this paper, we consider the minimum bounding rectangle of the object to be the effective calculation region, as shown in Figure 5a.(2) Reduce the size.Shrinking is performed to retain sketchy information and remove the high frequencies in an image.In this circumstance, we shrink the image to 8 × 8, yielding a total of 64 pixels.The aspect ratio does not need to be maintained, and features can be condensed to fit into an 8 × 8 square.Thus, the hash algorithm can be applied to assess any changes in the image without considering the scale or aspect ratio.
ISPRS Int.J. Geo-Inf.2017, 6, 240 7 of 20 (3) Reduce and average the colours.A small 8 × 8 picture is transformed to a grayscale image, as shown in Figure 5b, and the average gray value of the 64 pixels is calculated.(4) Calculate the bits.Each bit is characterized depending on whether its colour value is above or below the mean.( 5) Construct the hash.The 64 bits are set to a 64-bit integer.The order does not matter, as long as consistency is maintained.For example, bits can be set from left to right or from top to bottom using the big-endian approach.
ISPRS Int.J. Geo-Inf.2017, 6, 240 7 of 20 (3) Reduce and average the colours.A small 8 × 8 picture is transformed to a grayscale image, as shown in Figure 5b, and the average gray value of the 64 pixels is calculated.(4) Calculate the bits.Each bit is characterized depending on whether its colour value is above or below the mean.( 5) Construct the hash.The 64 bits are set to a 64-bit integer.The order does not matter, as long as consistency is maintained.For example, bits can be set from left to right or from top to bottom using the big-endian approach.
(a) (b) The results of the average hash algorithm remain the same when the aspect ratio of the image changes or the image is scaled.In addition, altering the colours, the brightness, or even the contrast of the image does not remarkably influence the hash value.Thus, this method is efficient.
Let us assume that ℎ 1 and ℎ 2 are the hash sequences of two images and  is the length of this sequence.Let ℎ 1 () and ℎ 2 () represent the ith element (1 ≤  ≤  ) of sequences ℎ 1 and ℎ 2 , respectively.(ℎ 1 , ℎ 2 ) represents the similarity between ℎ 1 and ℎ 2 .In this paper, we use the Hamming distance to calculate the degree of similarity.The formula for the similarity is as follows: Images with shorter Hamming distances show fewer differences.Conversely, images with greater Hamming distances show more differences.To identify the differences between two images, the hash from each image should be constructed, and the number of bit positions that are different should be counted; this number equals the Hamming distance.A distance of zero indicates that the pictures are completely similar or the same.A distance of 5 indicates that the pictures are likely similar, although a few features may be different from each other.A distance of 10 or more indicates that the pictures are probably different.
We define the degree of global consistency (GC) through our comparison of global features, as follows: 10 , (ℎ 1 , ℎ 2 ) ≤ 10 0, (ℎ 1 , ℎ 2 ) > 10 when  = 1, the two objects are completely consistent in terms of their global features.As GC decreases, the two objects become progressively less consistent.When  = 0, the two objects are inconsistent in terms of their global features.

Degree of Local Feature Consistency
The points of interest associated with any object in an image can be extracted to generate a 'feature description' of that object.This description, which is extracted from a training image, can then be used to recognize the object when attempting to locate it in a test image that contains many other objects.Even if the scale, noise, and illumination of the image change, the features that are The results of the average hash algorithm remain the same when the aspect ratio of the image changes or the image is scaled.In addition, altering the colours, the brightness, or even the contrast of the image does not remarkably influence the hash value.Thus, this method is efficient.
Let us assume that h 1 and h 2 are the hash sequences of two images and n is the length of this sequence.Let h 1 (i) and h 2 (i) represent the ith element (1 ≤ i ≤ n) of sequences h 1 and h 2 , respectively.D(h 1 , h 2 ) represents the similarity between h 1 and h 2 .In this paper, we use the Hamming distance to calculate the degree of similarity.The formula for the similarity is as follows: Images with shorter Hamming distances show fewer differences.Conversely, images with greater Hamming distances show more differences.To identify the differences between two images, the hash from each image should be constructed, and the number of bit positions that are different should be counted; this number equals the Hamming distance.A distance of zero indicates that the pictures are completely similar or the same.A distance of 5 indicates that the pictures are likely similar, although a few features may be different from each other.A distance of 10 or more indicates that the pictures are probably different.
We define the degree of global consistency (GC) through our comparison of global features, as follows: when GC = 1, the two objects are completely consistent in terms of their global features.As GC decreases, the two objects become progressively less consistent.When GC = 0, the two objects are inconsistent in terms of their global features.

Degree of Local Feature Consistency
The points of interest associated with any object in an image can be extracted to generate a 'feature description' of that object.This description, which is extracted from a training image, can then be used to recognize the object when attempting to locate it in a test image that contains many other objects.Even if the scale, noise, and illumination of the image change, the features that are extracted from the training image must be detectable to perform reliable identification.Such points are typically located in high-contrast regions in images (e.g., along the edges of object).
The scale-invariant feature transform (SIFT) is an effective feature descriptor to extract and describe local features in images.The SIFT algorithm was patented in the US by the University of British Columbia and was first published by David Lowe in 1999 [40].David Lowe perfected SIFT in 2004 [41].SIFT is the most robust local feature descriptor that can be used for object matching and recognition, and it works by extracting distinctive invariant features.The features are invariant to the image scale and rotation and facilitate robust matching across a substantial range of affine distortion levels, changes in 3D viewpoints, additions of noise, and changes in illumination.
Thus, we attempt to use the SIFT algorithm to measure local features in this study.A typical example is illustrated in Figure 6.A lake from a low level in the Tiandi map is shown in Figure 6a, and the red section is a local SIFT feature.Figure 6b shows the same lake from a high level in the Tiandi map, and the red section is also a local SIFT feature.As shown in these images, 37 keypoints are located in the lake shown in Figure 6a, whereas 93 keypoints are located in the lake shown in Figure 6b.More details of the image are shown when a larger scale is used.Figure 6c shows the matching results; the 22 matching keypoints are connected with green lines.We believe that the presence of a greater number of keypoints that are matched with objects indicates a greater degree of consistency among the matching objects.
When the keypoints of two images are matched, the Euclidean distance of the feature vector of keypoints is used to measure the similarities between the keypoints.The best candidate match for each keypoint is found by identifying its nearest neighbor in the database of keypoints from the training images.However, many feature points in the image might be assigned an incorrect match in the training database because of background noise or similar features.Therefore, a more effective measure is obtained by comparing the distance of the closest neighbor to that of the second-closest neighbor.Lowe rejects all matches for which the distance ratio is greater than 0.8 [41].In Figure 6c, the ratio is 0.5, and this process performs well because false matches are not observed.Incorrect matches may occur when the ratio is greater than 0.5.More errors occur with larger ratios.
ISPRS Int.J. Geo-Inf.2017, 6, 240 8 of 20 extracted from the training image must be detectable to perform reliable identification.Such points are typically located in high-contrast regions in images (e.g., along the edges of object).
The scale-invariant feature transform (SIFT) is an effective feature descriptor to extract and describe local features in images.The SIFT algorithm was patented in the US by the University of British Columbia and was first published by David Lowe in 1999 [40].David Lowe perfected SIFT in 2004 [41].SIFT is the most robust local feature descriptor that can be used for object matching and recognition, and it works by extracting distinctive invariant features.The features are invariant to the image scale and rotation and facilitate robust matching across a substantial range of affine distortion levels, changes in 3D viewpoints, additions of noise, and changes in illumination.
Thus, we attempt to use the SIFT algorithm to measure local features in this study.A typical example is illustrated in Figure 6.A lake from a low level in the Tiandi map is shown in Figure 6a, and the red section is a local SIFT feature.Figure 6b shows the same lake from a high level in the Tiandi map, and the red section is also a local SIFT feature.As shown in these images, 37 keypoints are located in the lake shown in Figure 6a, whereas 93 keypoints are located in the lake shown in Figure 6b.More details of the image are shown when a larger scale is used.Figure 6c shows the matching results; the 22 matching keypoints are connected with green lines.We believe that the presence of a greater number of keypoints that are matched with objects indicates a greater degree of consistency among the matching objects.
When the keypoints of two images are matched, the Euclidean distance of the feature vector of keypoints is used to measure the similarities between the keypoints.The best candidate match for each keypoint is found by identifying its nearest neighbor in the database of keypoints from the training images.However, many feature points in the image might be assigned an incorrect match in the training database because of background noise or similar features.Therefore, a more effective measure is obtained by comparing the distance of the closest neighbor to that of the second-closest neighbor.Lowe rejects all matches for which the distance ratio is greater than 0.8 [41].In Figure 6c, the ratio is 0.5, and this process performs well because false matches are not observed.Incorrect matches may occur when the ratio is greater than 0.5.More errors occur with larger ratios.Let α represent the percentage of matches and total keypoints in one image, and let β represent the percentage of matches and total keypoints in another image.We define the degree of local consistency (LC) through the comparison of local features as follows: If LC = 1, then the two objects are completely consistent in terms of their local features.As LC decreases, the consistency between two objects becomes progressively weaker.When LC = 0, the two objects are inconsistent in terms of their local features.

Degree of Overlap
The average hash and SIFT algorithms can be used to measure global and local similarity.However, these methods cannot be used to assess the differences in the positioning of an image.Therefore, we use a third feature index, namely the degree of overlap, to measure this aspect of the differences between images.To a certain degree, the degree of overlap between two images reflects the degree of similarity between the images, although this degree of similarity is not properly conveyed when only the degree of overlap is used.However, we can use the degree of overlap to identify differences in location when the global and local features are similar.
For each group of matching objects in water areas, the degree of overlap OD is the ratio between the overlapping pixel number Num lap and the total pixel number Num all after overlaying; specifically, OD = Num lap /Num all .As shown in Figure 7 Let  represent the percentage of matches and total keypoints in one image, and let  represent the percentage of matches and total keypoints in another image.We define the degree of local consistency (LC) through the comparison of local features as follows:

𝐿𝐶 = (α + 𝛽) 2 ⁄
If  = 1, then the two objects are completely consistent in terms of their local features.As LC decreases, the consistency between two objects becomes progressively weaker.When  = 0, the two objects are inconsistent in terms of their local features.

Degree of Overlap
The average hash and SIFT algorithms can be used to measure global and local similarity.However, these methods cannot be used to assess the differences in the positioning of an image.Therefore, we use a third feature index, namely the degree of overlap, to measure this aspect of the differences between images.To a certain degree, the degree of overlap between two images reflects the degree of similarity between the images, although this degree of similarity is not properly conveyed when only the degree of overlap is used.However, we can use the degree of overlap to identify differences in location when the global and local features are similar.
For each group of matching objects in water areas, the degree of overlap OD is the ratio between the overlapping pixel number   and the total pixel number   after overlaying; specifically,  =     ⁄ .As shown in Figure 7  Let α represent the OD of one image, and let β represent the OD of the other matching image.We define the OD of the two matching objects as follows: when  = 1, the two objects overlap completely.As OD decreases, the consistency of the two objects becomes increasingly weaker.The OD can be considered to be a strengthening index with the exception of the degree of global feature consistency and the degree of local feature consistency, when the degree of similarity between two objects is finally confirmed.

Definition of Degrees of Consistency
The degree of consistency of two objects can be divided into five grades (exactly consistent, highly consistent, moderately consistent, less consistent, and inconsistent) through the analysis of global and local features, as shown in the following table (Table 1).Let α represent the OD of one image, and let β represent the OD of the other matching image.We define the OD of the two matching objects as follows: when OD = 1, the two objects overlap completely.As OD decreases, the consistency of the two objects becomes increasingly weaker.The OD can be considered to be a strengthening index with the exception of the degree of global feature consistency and the degree of local feature consistency, when the degree of similarity between two objects is finally confirmed.

Definition of Degrees of Consistency
The degree of consistency of two objects can be divided into five grades (exactly consistent, highly consistent, moderately consistent, less consistent, and inconsistent) through the analysis of global and local features, as shown in the following table (Table 1  After calculating the three characteristic indices (the degree of global consistency, the degree of local consistency, and the degree of overlap), we define the consistency between two matching objects via a weighted summation method.This equation can be written as follows: In this equation, GC denotes the global degree of consistency, LC denotes the local degree of consistency, OD denotes the degree of overlap, and α, β, and γ are the weighted coefficients.Global features typically have a stronger effect than local features; thus, α > β > γ and α + β + γ = 1.When the precision is 0.1, there are only four possible combinations of the values of α, β, and γ.To reasonably distinguish the differences between the global and local features and to avoid permitting the strengthening index to have excessive influence, we set α = 0.6, β = 0.3, and γ = 0.1.
The following figures show typical examples.As shown in Figure 8, the three indices (the degree of global consistency, the degree of local consistency, and the degree of overlap) of the lakes in a and b are higher; thus, their degree of consistency is identified as highly consistent.The grade of the lake shown in c shows a higher degree of global consistency and a lower degree of local consistency and is identified as less consistent.The lake in d shows a lower degree of both global consistency and local consistency, and is identified as inconsistent.Different changes can lead to different degrees of consistency.When the difference in the global degree of consistency is small, a higher local degree of consistency corresponds to higher overall consistency.When the difference in the local degree of consistency is small, a higher global degree of consistency corresponds to higher overall consistency.We conducted an experiment based on the characteristics of the SIFT algorithm and concluded that the local similarities of two objects are more prominent when the local degree of consistency is greater than 0.5 (Figure 8a).Objects with smoother boundaries correspond to fewer SIFT feature points.Boundaries that are more strongly curved correspond to a higher number of SIFT feature points (Figure 8d).When the global and local degrees of consistency of two objects are roughly the same (e.g., because they are displaced relative to one another), we can further identify the consistency degree using the degree of overlap (Figure 8e).Overall, the degree of consistency of two objects is determined from three indices: the degree of global consistency, the degree of local consistency, and the degree of overlap.
The consistency over multiple scales can be obtained via the accumulation of degrees of consistency for two adjacent scales, which can be represented as follows: where C i denotes the degree of consistency between two adjacent scales.

Methods
The difficulties that are associated with extracting water from tile elements cannot be ignored.Therefore, we focus on methods of extracting independent water areas from a tile map prior to change detection.In contrast to the other elements on a map, water areas are typically expressed as a uniform blue.Therefore, water areas can be separated from other geographical elements shown on a single map using a given colour threshold.However, the extracted water areas display obvious fractures or 'holes' due to the overlays from other elements on the map such as roads and annotations.Based on these two factors, this paper proposes the following steps to extract water areas from a tile map.

Extract Water Areas via Colour Segmentation
Although the water areas across different tile maps vary in colour, the colour of water on a given map is uniform.Therefore, water elements can be separated from other geographical elements on the same map by using a specific colour threshold.In Figure 9, a tile from the Tiandi map is shown on the left, and the result after extraction with the colour threshold is shown on the right.The extraction area is non-continuous and fractured because of the presence of a road overlay.

Methods
The difficulties that are associated with extracting water from tile elements cannot be ignored.Therefore, we focus on methods of extracting independent water areas from a tile map prior to change detection.In contrast to the other elements on a map, water areas are typically expressed as a uniform blue.Therefore, water areas can be separated from other geographical elements shown on a single map using a given colour threshold.However, the extracted water areas display obvious fractures or 'holes' due to the overlays from other elements on the map such as roads and annotations.Based on these two factors, this paper proposes the following steps to extract water areas from a tile map.

Extract Water Areas via Colour Segmentation
Although the water areas across different tile maps vary in colour, the colour of water on a given map is uniform.Therefore, water elements can be separated from other geographical elements on the same map by using a specific colour threshold.In Figure 9, a tile from the Tiandi map is shown on the left, and the result after extraction with the colour threshold is shown on the right.The extraction area is non-continuous and fractured because of the presence of a road overlay.

Connection of Fractured Water Areas
The water areas may exhibit fractures because of the overlay relationships between water features and other geographic elements such as roads in the map.As shown in the upper right of Figure 10, the roads, which overlie the river, produce fractures in the extracted river.We use an algorithm that is based on convex hulls to connect these fractures.The pseudo code is shown on the left side of Figure 10, and the results after using the algorithm to connect the fractures are shown on the right.The algorithm adequately maintains the original width and orientation of the river.

Connection of Fractured Water Areas
The water areas may exhibit fractures because of the overlay relationships between water features and other geographic elements such as roads in the map.As shown in the upper right of Figure 10, the roads, which overlie the river, produce fractures in the extracted river.We use an algorithm that is based on convex hulls to connect these fractures.The pseudo code is shown on the left side of Figure 10, and the results after using the algorithm to connect the fractures are shown on the right.The algorithm adequately maintains the original width and orientation of the river.

Filling Holes in Water Areas
The extraction areas corresponding to some larger water areas contain holes because of the presence of annotations, as shown in the central part of Figure 11.Whether the regions surrounding annotations contain water pixels must be determined to address this problem.When the neighborhoods contain water pixels, the annotation pixels are marked as water pixels.Otherwise, the annotation pixels are not marked.The results that are generated after using this method to fill the holes are shown on the right side of Figure 11.
The extraction areas corresponding to some larger water areas contain holes because of the presence of annotations, as shown in the central part of Figure 11.Whether the regions surrounding annotations contain water pixels must be determined to address this problem.When the neighborhoods contain water pixels, the annotation pixels are marked as water pixels.Otherwise, the annotation pixels are not marked.The results that are generated after using this method to fill the holes are shown on the right side of Figure 11.

Study Area
In this study, experimental data that were used to detect changes in water areas over multiple scales were obtained from the Tiandi map for China.We used data covering the tenth through the twelfth levels from the Tiandi map.The study area is located in the western part of the Autonomous Region of Tibet in China.Several lakes and a few rivers are present within this area.The study area is located between 34.34 and 36.62 degrees north in latitude and between 89.97and 92.87 degrees east in longitude.The data at the tenth level consists of 128 tiles, and the size of one tile is 256 by 256 pixels.As the level increases, the total number of tiles also increases, according to the rules of the pyramid.The data at the highest level, namely the 12th level, include 2048 tiles.The coordinate range of these tiles is 6144 ≤  ≤ 6207, 3200 ≤  ≤ 3263.The image that is formed from these tiles contains 8192 by 16,384 pixels.The extraction areas corresponding to some larger water areas contain holes because of the presence of annotations, as shown in the central part of Figure 11.Whether the regions surrounding annotations contain water pixels must be determined to address this problem.When the neighborhoods contain water pixels, the annotation pixels are marked as water pixels.Otherwise, the annotation pixels are not marked.The results that are generated after using this method to fill the holes are shown on the right side of Figure 11.

Study Area
In this study, experimental data that were used to detect changes in water areas over multiple scales were obtained from the Tiandi map for China.We used data covering the tenth through the twelfth levels from the Tiandi map.The study area is located in the western part of the Autonomous Region of Tibet in China.Several lakes and a few rivers are present within this area.The study area is located between 34.34 and 36.62 degrees north in latitude and between 89.97and 92.87 degrees east in longitude.The data at the tenth level consists of 128 tiles, and the size of one tile is 256 by 256 pixels.As the level increases, the total number of tiles also increases, according to the rules of the pyramid.The data at the highest level, namely the 12th level, include 2048 tiles.The coordinate range of these tiles is 6144 ≤  ≤ 6207, 3200 ≤  ≤ 3263.The image that is formed from these tiles contains 8192 by 16,384 pixels.

Study Area
In this study, experimental data that were used to detect changes in water areas over multiple scales were obtained from the Tiandi map for China.We used data covering the tenth through the twelfth levels from the Tiandi map.The study area is located in the western part of the Autonomous Region of Tibet in China.Several lakes and a few rivers are present within this area.The study area is located between 34.34 and 36.62 degrees north in latitude and between 89.97and 92.87 degrees east in longitude.The data at the tenth level consists of 128 tiles, and the size of one tile is 256 by 256 pixels.As the level increases, the total number of tiles also increases, according to the rules of the pyramid.The data at the highest level, namely the 12th level, include 2048 tiles.The coordinate range of these tiles is 6144 ≤ x ≤ 6207, 3200 ≤ y ≤ 3263.The image that is formed from these tiles contains 8192 by 16,384 pixels.
Many overlying features such as roads and annotations intersect the lakes.We can use the methods described in Section 4.1 to extract the lakes.Figure 12 shows the results of the extraction for the tenth to twelfth levels.The results after fracture connection and hole filling are satisfactory.
Many overlying features such as roads and annotations intersect the lakes.We can use the methods described in Section 4.1 to extract the lakes.Figure 12 shows the results of the extraction for the tenth to twelfth levels.The results after fracture connection and hole filling are satisfactory.

Results and Analysis
Figure 13 shows the overlapping of the lakes at the tenth and eleventh levels.Figure 14 shows the overlapping of the lakes at the eleventh and twelfth levels.Figure 15 shows the matching results in terms of the local degree of consistency of several typical lakes.Table 2 shows the calculation results of the global degree of consistency, local degree of consistency, and degree of overlap of these lakes.

Results and Analysis
Figure 13 shows the overlapping of the lakes at the tenth and eleventh levels.Figure 14 shows the overlapping of the lakes at the eleventh and twelfth levels.Figure 15 shows the matching results in terms of the local degree of consistency of several typical lakes.Table 2 shows the calculation results of the global degree of consistency, local degree of consistency, and degree of overlap of these lakes.Many overlying features such as roads and annotations intersect the lakes.We can use the methods described in Section 4.1 to extract the lakes.Figure 12 shows the results of the extraction for the tenth to twelfth levels.The results after fracture connection and hole filling are satisfactory.

Results and Analysis
Figure 13 shows the overlapping of the lakes at the tenth and eleventh levels.Figure 14 shows the overlapping of the lakes at the eleventh and twelfth levels.Figure 15 shows the matching results in terms of the local degree of consistency of several typical lakes.Table 2 shows the calculation results of the global degree of consistency, local degree of consistency, and degree of overlap of these lakes.As shown in Figures 13 and 14, many regions at levels 10 and 11 do not fully overlap after overlapping the matching lakes, and these non-overlapping regions are marked in red and blue.However, at levels 11 and 12, these non-overlapping regions are relatively less common.We select four typical lakes from all of the lakes within the study area to show the calculation process and the parameters that are used.Four lakes, a, b, c, and d, are shown in Figure 15.Each of these lakes includes four feature matches.The two images on the left are the results of the positive and negative matching of local features at levels 10 and 11, and the two images on the right are the results of the positive and negative matching of local features at levels 11 and 12.The intersecting lines show incorrect matches; however, few incorrect matches are observed, and these features did not notably influence the measurement of the local features.Table 2 shows that the number of local feature points noted in the lakes at levels 11 and 12 was greater than the number of local feature points noted in the lakes at levels 10 and 11.Therefore, the lakes at levels 10 and 11 were moderately or less consistent, whereas the lakes at levels 11 and 12 were exactly or highly consistent.
Figure 16 shows the final results of the consistency assessment between the three The results indicate that the degree of consistency of the lakes at levels 10 and 11 is relatively low, as reflected by the grades associated with the matches (less consistent, moderately consistent, and inconsistent).However, the degree of consistency of the lakes at levels 11 and 12 is relatively high, and the corresponding grades are highly consistent, exactly consistent, and inconsistent.The inconsistent lakes are almost completely new.Table 3 shows the final number and proportion of the different degrees of consistency.As shown in Table 3, the proportion of inconsistent lakes at levels 10 and 11 is the highest, and these lakes make up 40.9% of all the lakes; the proportion of moderately consistent lakes is the second largest, and these lakes make up 36.4% of all the lakes; and the proportion of less consistent lakes is the lowest, and these lakes make up only 22.7% of all the lakes.At levels 11 to 12, the number of lakes increased significantly and all the consistency grades are highly consistent or exactly consistent, except for those for the added lakes.The exactly consistent lakes make up 2.4% of all the lakes, and the highly consistent lakes make up 15.0% of all the lakes.The proportion of new inconsistent lakes is the highest, and they make up 82.6% of all the lakes.As shown in Figures 13 and 14, many regions at levels 10 and 11 do not fully overlap after overlapping the matching lakes, and these non-overlapping regions are marked in red and blue.However, at levels 11 and 12, these non-overlapping regions are relatively less common.We select four typical lakes from all of the lakes within the study area to show the calculation process and the parameters that are used.Four lakes, a, b, c, and d, are shown in Figure 15.Each of these lakes includes four feature matches.The two images on the left are the results of the positive and negative matching of local features at levels 10 and 11, and the two images on the right are the results of the positive and negative matching of local features at levels 11 and 12.The intersecting lines show incorrect matches; however, few incorrect matches are observed, and these features did not notably influence the measurement of the local features.Table 2 shows that the number of local feature points noted in the lakes at levels 11 and 12 was greater than the number of local feature points noted in the lakes at levels 10 and 11.Therefore, the lakes at levels 10 and 11 were moderately or less consistent, whereas the lakes at levels 11 and 12 were exactly or highly consistent.
Figure 16 shows the final results of the consistency assessment between the three levels.The results indicate that the degree of consistency of the lakes at levels 10 and 11 is relatively low, as reflected by the grades associated with the matches (less consistent, moderately consistent, and inconsistent).However, the degree of consistency of the lakes at levels 11 and 12 is relatively high, and the corresponding grades are highly consistent, exactly consistent, and inconsistent.The inconsistent lakes are almost completely new.Table 3 shows the final number and proportion of the different degrees of consistency.As shown in Table 3, the proportion of inconsistent lakes at levels 10 and 11 is the highest, and these lakes make up 40.9% of all the lakes; the proportion of moderately consistent lakes is the second largest, and these lakes make up 36.4% of all the lakes; and the proportion of less consistent lakes is the lowest, and these lakes make up only 22.7% of all the lakes.At levels 11 to 12, the number of lakes increased significantly and all the consistency grades are highly consistent or exactly consistent, except for those for the added lakes.The exactly consistent lakes make up 2.4% of all the lakes, and the highly consistent lakes make up 15.0% of all the lakes.The proportion of new inconsistent lakes is the highest, and they make up 82.6% of all the lakes.

Conclusions
Consistency among spatial objects at different resolutions is a key issue in many scale-dependent applications such as querying spatial data at different resolutions, integrating spatial data from multiple sources, and rapidly transmitting spatial data in a networked environment.Therefore, evaluating, checking, and maintaining the consistency of spatial data at different resolutions is very important.All existing studies use vector data to assess the consistency of objects, whereas consistency that is based on raster data remains an open problem.Moreover, previous study objects were confined to buildings, roads, or land-cover data, but water is also an important component of maps.This paper focused on the consistency of water areas at different scales.In particular, we described a hierarchical approach that uses both global and local image features to measure consistency based on raster tiles.Three types of characteristic indices were proposed to measure the degree of consistency of multiscale representations of water areas.These indices were the degree of global feature consistency, the degree of local feature consistency and the degree of overlap.The degree of consistency of pairs of objects was divided into five grades, specifically exactly consistent, highly consistent, moderately consistent, less consistent, and inconsistent, through the analysis of global and local features.We also extracted independent water areas from a tile map and found that the proposed methods were effective.
As there are many potential types of unreasonable inconsistencies, our study has practical utility in the verification and maintenance of spatial data quality for use in several types of applications: (1) Supporting decision making.In this paper, we have provided metrics for assessing the consistency of multiscale representations of water areas and grading the degree of inconsistency.In the process of removing unreasonable inconsistencies, it will be useful to decide which inconsistencies can be neglected, which inconsistencies are worth noting, and which inconsistencies should receive attention or be corrected (such as those associated with the highly consistent, less consistent, and inconsistent grades, respectively).( 2) Checking for updates.When map suppliers

Conclusions
Consistency among spatial objects at different resolutions is a key issue in many scale-dependent applications such as querying spatial data at different resolutions, integrating spatial data from multiple sources, and rapidly transmitting spatial data in a networked environment.Therefore, evaluating, checking, and maintaining the consistency of spatial data at different resolutions is very important.All existing studies use vector data to assess the consistency of objects, whereas consistency that is based on raster data remains an open problem.Moreover, previous study objects were confined to buildings, roads, or land-cover data, but water is also an important component of maps.This paper focused on the consistency of water areas at different scales.In particular, we described a hierarchical approach that uses both global and local image features to measure consistency based on raster tiles.Three types of characteristic indices were proposed to measure the degree of consistency of multiscale representations of water areas.These indices were the degree of global feature consistency, the degree of local feature consistency and the degree of overlap.The degree of consistency of pairs of objects was divided into five grades, specifically exactly consistent, highly consistent, moderately consistent, less consistent, and inconsistent, through the analysis of global and local features.We also extracted independent water areas from a tile map and found that the proposed methods were effective.
As there are many potential types of unreasonable inconsistencies, our study has practical utility in the verification and maintenance of spatial data quality for use in several types of applications: (1) Supporting decision making.In this paper, we have provided metrics for assessing the consistency of multiscale representations of water areas and grading the degree of inconsistency.In the process of removing unreasonable inconsistencies, it will be useful to decide which inconsistencies can be neglected, which inconsistencies are worth noting, and which inconsistencies should receive attention or be corrected (such as those associated with the highly consistent, less consistent, and inconsistent grades, respectively).( 2) Checking for updates.When map suppliers update the map data that underlie their services, there is no need to update all the data.Our study can help to distinguish which data must be updated, which data can be updated, and which data do not need to be updated.
(3) Data filtering.When users upload data to the map database of a map supplier in a VGI system, our methods can help to filter out inconsistent data and avoid the entering of erroneous data into the database.However, some incorrect matches were obtained when we used the SIFT algorithm to calculate the local characteristics of water areas.The development of more effective and reasonable methods for feature extraction and matching is worthy of further study.In addition, the methods used for measuring the consistency of other geographical elements such as buildings, roads, and annotations should be considered for use with tile maps in the future.

Figure 1 .
Figure 1.Inconsistencies between lakes at different scales.

Figure 1 .
Figure 1.Inconsistencies between lakes at different scales.
ISPRS Int.J. Geo-Inf.2017, 6, 240 4 of 20 manuscript, we hierarchically use both global and local features of images to analyze and study this problem.

Figure 2 .
Figure 2. Feature comparison at the global and local levels.

Figure 2 .
Figure 2. Feature comparison at the global and local levels.

Figure 6 .
Figure 6.Local feature calculation using the scale-invariant feature transform (SIFT) algorithm.(a) A lake from a low level; (b) The same lake from a high level; (c) Matching results.Figure 6. Local feature calculation using the scale-invariant feature transform (SIFT) algorithm.(a) A lake from a low level; (b) The same lake from a high level; (c) Matching results.

Figure 6 .
Figure 6.Local feature calculation using the scale-invariant feature transform (SIFT) algorithm.(a) A lake from a low level; (b) The same lake from a high level; (c) Matching results.Figure 6. Local feature calculation using the scale-invariant feature transform (SIFT) algorithm.(a) A lake from a low level; (b) The same lake from a high level; (c) Matching results.
, area A is composed of 12 pixels, and area B is composed of 15 pixels.The overlapping portions of areas A and B are shown in red.Therefore, the OD of A is OD A = Num lap /Num all = 412 = 33.3% and the OD of B is OD B = Num lap /Num all = 4/15 = 22.7%.ISPRS Int.J. Geo-Inf.2017, 6, 240 9 of 20 , area A is composed of 12 pixels, and area B is composed of 15 pixels.The overlapping portions of areas A and B are shown in red.Therefore, the OD of A is   =     = 4 ⁄ 12 = ⁄ 33.3 % and the OD of B is   =     ⁄ = 4 15 = 22.7% ⁄ .

Figure 9 .
Figure 9. Extracted water areas with colour segmentation.

Figure 9 .
Figure 9. Extracted water areas with colour segmentation.

Figure 13 .
Figure 13.Overlay of the tenth and eleventh levels.

Figure 13 .
Figure 13.Overlay of the tenth and eleventh levels.Figure 13.Overlay of the tenth and eleventh levels.

Figure 13 .
Figure 13.Overlay of the tenth and eleventh levels.Figure 13.Overlay of the tenth and eleventh levels.

Figure 14 .
Figure 14.Overlay of the eleventh and twelfth levels.

Table 1 .
Definition of degrees of consistency.

Table 2 .
Calculation results of the indices.

Table 2 .
Calculation results of the indices.

Table 2 .
Calculation results of the indices.