Zhong Xie

Resource and Information Sharing Mechanism Based on Spatial Information Grid

Spatial information grid is established in the environment of distributed grid. With the capability of offering required services, it can immediately customize specific services and resolve the problem in sharing and cooperation of distributed massive heterogeneous spatial data. Based on spatial information grid, aim of resource and information sharing mechanism is aggregating computing resource, information resource, hardware, software resource and so forth in geographical distribution through grid technology, forming integrative grid computing environment; constructing spatial information service system based on Web service technology; dispatching resources and services dynamically and hierarchically by resource scheduling engine under distributed heterogeneous grid circumstance; and finally realizing sharing and cooperation operation of spatial data.

Building Extraction in Very High Resolution Remote Sensing Imagery Using Deep Learning and Guided Filters

Very high resolution (VHR) remote sensing imagery has been used for land cover classification, and it tends to a transition from land-use classification to pixel-level semantic segmentation. Inspired by the recent success of deep learning and the filter method in computer vision, this work provides a segmentation model, which designs an image segmentation neural network based on the deep residual networks and uses a guided filter to extract buildings in remote sensing imagery. Our method includes the following steps: first, the VHR remote sensing imagery is preprocessed and some hand-crafted features are calculated. Second, a designed deep network architecture is trained with the urban district remote sensing image to extract buildings at the pixel level. Third, a guided filter is employed to optimize the classification map produced by deep learning; at the same time, some salt-and-pepper noise is removed. Experimental results based on the Vaihingen and Potsdam datasets demonstrate that our method, which benefits from neural networks and guided filtering, achieves a higher overall accuracy when compared with other machine learning and deep learning methods. The method proposed shows outstanding performance in terms of the building extraction from diversified objects in the urban district.

A Geospatial Information Grid Framework for Geological Survey.

The use of digital information in geological fields is becoming very important. Thus, informatization in geological surveys should not stagnate as a result of the level of data accumulation. The integration and sharing of distributed, multi-source, heterogeneous geological information is an open problem in geological domains. Applications and services use geological spatial data with many features, including being cross-region and cross-domain and requiring real-time updating. As a result of these features, desktop and web-based geographic information systems (GISs) experience difficulties in meeting the demand for geological spatial information. To facilitate the real-time sharing of data and services in distributed environments, a GIS platform that is open, integrative, reconfigurable, reusable and elastic would represent an indispensable tool. The purpose of this paper is to develop a geological cloud-computing platform for integrating and sharing geological information based on a cloud architecture. Thus, the geological cloud-computing platform defines geological ontology semantics; designs a standard geological information framework and a standard resource integration model; builds a peer-to-peer node management mechanism; achieves the description, organization, discovery, computing and integration of the distributed resources; and provides the distributed spatial meta service, the spatial information catalog service, the multi-mode geological data service and the spatial data interoperation service. The geological survey information cloud-computing platform has been implemented, and based on the platform, some geological data services and geological processing services were developed. Furthermore, an iron mine resource forecast and an evaluation service is introduced in this paper.

A spatially adaptive decomposition approach for parallel vector data visualization of polylines and polygons

With the wide adoption of big spatial data and the emergence of CyberGIS, the nontrivial computational intensity introduced by massive amount of data poses great challenges to the performance of vector map visualization. The parallel computing technologies provide promising solutions to such problems. Evenly decomposing the visualization task into multiple subtasks is one of the key issues in parallel visualization of vector data. This study focuses on the decomposition of polyline and polygon data for parallel visualization. Two key factors impacting the computational intensity were identified: the number of features and the number of vertices of each feature. The computational intensity transform functions (CITFs) were constructed based on the linear relationships between the factors and the computing time. The computational intensity grid (CIG) can then be constructed using the CITFs to represent the spatial distribution of computational intensity. A noninterlaced continuous space-filling curve is used to group the lattices of CIG into multiple sub-domains such that each sub-domain entails the same amount of computational intensity as others. The experiments demonstrated that the approach proposed in this paper was able to effectively estimate and spatially represent the computational intensity of visualizing polylines and polygons. Compared with the regular domain decomposition methods, the new approach generated much more balanced decomposition of computational intensity for parallel visualization and achieved near-linear speedups, especially when the data is greatly heterogeneously distributed in space.

Shape similarity measurement model for holed polygons based on position graphs and Fourier descriptors

ABSTRACT In geographic information retrieval and spatial data mining, similarity is used to resolve shape matching and clustering. Many approaches have been developed to calculate similarity between simple geometric shapes. However, complex spatial objects are common in spatial database systems, spatial query languages and Geographic Information Science (GIS) applications. With holed polygons, many similarity measurement approaches are restricted to address the relationships between holes or between the holes and the entire complex geometric shape. A successful method should remove the restrictions due to these complex relations and retain invariant during geometric translation (rotation, moving and scaling). To overcome these deficiencies, we utilize position graphs to describe the distribution of holes in complex geometric shapes by storing invariants, such as angles and distances. In addition, Fourier descriptors and the position graph-based method are used to measure the similarity between holed polygons. Experiments show that the proposed method takes into account the relationships in an entire complex geometric shape. It can effectively calculate the similarity of holed polygons, even if they contain different numbers of holes.

A framework for correcting geographical boundary inconsistency

Spatial data quality (data accuracy, precision, consistency and so on) is a key issue in Geographic Information System. Geographical boundary inconsistency will directly affect the correctness and efficiency of analysis in GIS application. This paper describes a framework for checking and correcting geographical boundary inconsistency. Two kinds of inconsistency are identified: geometric inconsistency and topological inconsistency. Geometric inconsistency refers to the unequal of point number or coordinates of overlapping boundary. Topological inconsistency means that adjacent boundary is not able to strictly guarantee topological consistent according 9-intersection model, and generate series of gap and fragment area. Different checking and correcting methods are adopted for these two different kinds of inconsistency. In the first case, the generalized algorithm of node snapping is used, and inconsistency is solved by the mathematical methods of repeating points removing, method of averaging, method of projection, etc. In the second case, the inconsistency is solved by buffer operation, Delaunay triangulation, overlay analysis, etc. A complete framework and algorithm procedure are given in this paper to detect and correct the boundary inconsistency problem in GIS. Meanwhile, an application of inconsistency correction to land-use data based on this framework is conducted.

A balanced decomposition approach to real-time visualization of large vector maps in CyberGIS

With the dramatic development of spatial data infrastructure, CyberGIS has become significant for geospatial data sharing. Due to the large number of concurrent users and large volume of vector data, CyberGIS faces a great challenge in how to improve performance. The real-time visualization of vector maps is themost common function in CyberGIS applications, and it is time-consuming especially when the data volume becomes large. So, how to improve the efficiency of visualization of large vector maps is still a significant research direction for GIScience scientists. In this research, we review the existing three optimization strategies, and determine that the third category strategy (i.e., parallel optimization) is appropriate for the real-time visualization of large vector maps. One of the key issues of parallel optimization is how to decompose the real-time visualization tasks into balanced sub tasks while taking into consideration the spatial heterogeneous characteristics. We put forward some rules that the decomposition should conform to, and design a real-time visualization framework for large vector maps. We focus on a balanced decomposition approach that can assure efficiency and effectiveness. Considering the spatial heterogeneous characteristic of vector data, we use a “horizontal grid, verticalmultistage” approach to construct a spatial point distribution information grid. The load balancer analyzes the spatial characteristics of the map requests and decomposes the real-time viewshed into multiple balanced sub viewsheds. Then, all the sub viewsheds are distributed to multiple server nodes to be executed in parallel, so as to improve the realtime visualization efficiency of large vector maps. A group of experiments have been conducted by us. The analysis results demonstrate that the approach proposed in this research has the ability of balanced decomposition, and it is efficient and effective for all geometry types of vector data.

Quality assessment of building footprint data using a deep autoencoder network

ABSTRACT Volunteered geographic information (VGI), OpenStreetMap (OSM), has been used in many applications, especially when official spatial data are unavailable or outdated. However, the quality of VGI remains a valid concern. In this paper, we use the matched results between OSM building footprints and official data as the samples for training an autoencoder network, which encodes and reconstructs the sample populations according to unknown complex multivariate probability distributions. Then, the OSM data are assessed based on the theory that small probability samples contribute little to the autoencoder network and that they can be recognized by the higher reconstructed errors during training. In the method described here, the selected measures, including data completeness, positional accuracy, shape accuracy, semantic accuracy and orientation consistency between OSM and official data, are used as the inputs for a deep autoencoder network. Finally, building footprint data from Toronto, Canada, are evaluated, and experiments show that the proposed method can assess the OSM data comprehensively, objectively and accurately.

A Knowledge-Driven Geospatially Enabled Framework for Geological Big Data

Geologic survey procedures accumulate large volumes of structured and unstructured data. Fully exploiting the knowledge and information that are included in geological big data and improving the accessibility of large volumes of data are important endeavors. In this paper, which is based on the architecture of the geological survey information cloud-computing platform (GSICCP) and big-data-related technologies, we split geologic unstructured data into fragments and extract multi-dimensional features via geological domain ontology. These fragments are reorganized into a NoSQL (Not Only SQL) database, and then associations between the fragments are added. A specific class of geological questions was analyzed and transformed into workflow tasks according to the predefined rules and associations between fragments to identify spatial information and unstructured content. We establish a knowledge-driven geologic survey information smart-service platform (GSISSP) based on previous work, and we detail a study case for our research. The study case shows that all the content that has known relationships or semantic associations can be mined with the assistance of multiple ontologies, thereby improving the accuracy and comprehensiveness of geological information discovery.

Research on semantics of entity space similarity measure based on artificial neural networks

Semantics plays an important role on spatial scenes building and similarity contrast. Based on the description logic knowledge base (ontology) and multi-layer neural network, this paper simulates the procedure of human perception, measures the semantic similarity between spatial entities. In the Knowledge Base, spatial concepts are built by some description of space, time, and properties, most of these properties are representative, such as structure, shape and function and so on. This paper will describe the spatial entities semantics by function, part and attribute. Semantics description of similarity is calculated by each category. Then, introducing the artificial neural network algorithm during calculating the similarity, establishing the learning rules, optimizing the problem of weight value in similarity calculation process. This paper regard the waters as research object, train the artificial neural network by the calculated result and human subject, to mine knowledge, and verify the results. The result shows that this model can simulate cognition of human better, and calculate similarity of semantics easily and accurately.