首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 46 毫秒
1.
The OGC Web Service (OWS) schemas have the characteristics of a complex element structure, are distributed and large scale, have differences in element naming, and are available in different versions. Applying conventional matching approaches may lead to not only poor quality, but also bad performance. In this article, the OWS schema file decomposition, fragment presentation, fragment identification, fragment element match, and combination of match results are developed based on the extended FRAG-BASE (fragment-based) schema-matching method. Different versions of Web Feature Service (WFS) and Web Coverage Service (WCS) schema-matching experiments show that the average recall of the extended FRAG-BASE matching for the schemas is above 80%, the average precision reaches 90%, the average overall achieves 85%, and the matching efficiency increases by 50% as compared with that of the COMA and CONTEXT matcher. The multi-version WFS retrieval under the Antarctic Spatial Data Infrastructure (AntSDI) data service environment demonstrates the feasibility and superiority of the extended FRAG-BASE method.  相似文献   

2.
One difficulty in integrating geospatial data sets from different sources is variation in feature classification and semantic content of the data. One step towards achieving beneficial semantic interoperability is to assess the semantic similarity among objects that are categorised within data sets. This article focuses on measuring semantic and structural similarities between categories of formal data, such as Ordnance Survey (OS) cartographic data, and volunteered geographic information (VGI), such as that sourced from OpenStreetMap (OSM), with the intention of assessing possible integration. The model involves ‘tokenisation’ to search for common roots of words, and the feature classifications have been modelled as an XML schema labelled rooted tree for hierarchical analysis. The semantic similarity was measured using the WordNet::Similarity package, while the structural similarities between sub-trees of the source and target schemas have also been considered. Along with dictionary and structural matching, the data type of the category itself is a comparison variable. The overall similarity is based on a weighted combination of these three measures. The results reveal that the use of a generic similarity matching system leads to poor agreement between the semantics of OS and OSM data sets. It is concluded that a more rigorous peer-to-peer assessment of VGI data, increasing numbers and transparency of contributors, the initiation of more programs of quality testing and the development of more directed ontologies can improve spatial data integration.  相似文献   

3.
The geospatial sensor web is set to revolutionise real-time geospatial applications by making up-to-date spatially and temporally referenced data relating to real-world phenomena ubiquitously available. The uptake of sensor web technologies is largely being driven by the recent introduction of the OpenGIS Sensor Web Enablement framework, a standardisation initiative that defines a set of web service interfaces and encodings to task and query geospatial sensors in near real time. However, live geospatial sensors are capable of producing vast quantities of data over a short time period, which presents a large, fluctuating and ongoing processing requirement that is difficult to adequately provide with the necessary computational resources. Grid computing appears to offer a promising solution to this problem but its usage thus far has primarily been restricted to processing static as opposed to real-time data sets. A new approach is presented in this work whereby geospatial data streams are processed on grid computing resources. This is achieved by submitting ongoing processing jobs to the grid that continually poll sensor data repositories using relevant OpenGIS standards. To evaluate this approach a road-traffic monitoring application was developed to process streams of GPS observations from a fleet of vehicles. Specifically, a Bayesian map-matching algorithm is performed that matches each GPS observation to a link on the road network. The results show that over 90% of observations were matched correctly and that the adopted approach is capable of achieving timely results for a linear time geoprocessing operation performed every 60 seconds. However, testing in a production grid environment highlighted some scalability and efficiency problems. Open Geospatial Consortium (OGC) data services were found to present an IO bottleneck and the adopted job submission method was found to be inefficient. Consequently, a number of recommendations are made regarding the grid job-scheduling mechanism, shortcomings in the OGC Web Processing Service specification and IO bottlenecks in OGC data services.  相似文献   

4.
ABSTRACT

Address matching is a crucial step in geocoding, which plays an important role in urban planning and management. To date, the unprecedented development of location-based services has generated a large amount of unstructured address data. Traditional address matching methods mainly focus on the literal similarity of address records and are therefore not applicable to the unstructured address data. In this study, we introduce an address matching method based on deep learning to identify the semantic similarity between address records. First, we train the word2vec model to transform the address records into their corresponding vector representations. Next, we apply the enhanced sequential inference model (ESIM), a deep text-matching model, to make local and global inferences to determine if two addresses match. To evaluate the accuracy of the proposed method, we fine-tune the model with real-world address data from the Shenzhen Address Database and compare the outputs with those of several popular address matching methods. The results indicate that the proposed method achieves a higher matching accuracy for unstructured address records, with its precision, recall, and F1 score (i.e., the harmonic mean of precision and recall) reaching 0.97 on the test set.  相似文献   

5.
Standardization is one of the pillars of interoperability. In this context, efforts promoted by the Open Geospatial Consortium, such as CityGML (Technical University, Berlin), a standard for exchanging three-dimensional models or urban city objects, are welcomed. However, information from other domains of interest (e.g. energy efficiency or building information modeling) is needed for tasks such as land planning, large-scale flooding analysis, or demand/supply energy simulations. CityGML allows extension in order to integrate information from other domains, but the development process is expensive because there is no way to perform it automatically. The discovery of correspondences between CityGML concepts and other domains concepts poses a significant challenge.

Ontology matching is the research field emerged from the Semantic Web to address automatic ontology integration. Using the ontology underlying CityGML and the ontologies which model other domains of interest, ontology matching would be able to find the correspondences that would permit the integration in a more automatic manner than it is done now.

In this paper, we evaluate if ontology matching techniques allow performing an automatic integration of geospatial information modeled from different viewpoints. In order to achieve this, an evaluation methodology was designed, and it was applied to the discovery of relationships between CityGML and ontologies coming from the building information modeling and Geospatial Semantic Web domains. The methodology and the results of the evaluation are presented. The best results have been achieved using string-based techniques, while matching systems give the worst precision and recall. Only in a few cases the values are over 50%, which shows the limitations when these techniques are applied to ontologies with a partial overlap.  相似文献   

6.
In a Web service‐based distributed environment, individual services must be chained together dynamically to solve a complex real world problem. The Semantic Web Service has shown promise for automatic chaining of Web services. This paper addresses semi‐automatic geospatial service chaining through Semantic Web Services‐based process planning. Process planning includes three phases: process modeling, process model instantiation and workflow execution. Ontologies and Artificial Intelligence (AI) planning methods are employed in process planning to help a user dynamically create an executable workflow for earth science applications. In particular, the approach was implemented in a common data and service environment enabled by interoperable standards from OGC and W3C. A case study of the chaining process for wildfire prediction illustrates the applicability of this approach.  相似文献   

7.
  相似文献   

8.
Toponym matching, i.e. pairing strings that represent the same real-world location, is a fundamental problemfor several practical applications. The current state-of-the-art relies on string similarity metrics, either specifically developed for matching place names or integrated within methods that combine multiple metrics. However, these methods all rely on common sub-strings in order to establish similarity, and they do not effectively capture the character replacements involved in toponym changes due to transliterations or to changes in language and culture over time. In this article, we present a novel matching approach, leveraging a deep neural network to classify pairs of toponyms as either matching or nonmatching. The proposed network architecture uses recurrent nodes to build representations from the sequences of bytes that correspond to the strings that are to be matched. These representations are then combined and passed to feed-forward nodes, finally leading to a classification decision. We present the results of a wide-ranging evaluation on the performance of the proposed method, using a large dataset collected from the GeoNames gazetteer. These results show that the proposed method can significantly outperform individual similarity metrics from previous studies, as well as previous methods based on supervised machine learning for combining multiple metrics.  相似文献   

9.
The use of a semantically rich registry containing a Feature Type Catalogue (FTC) to represent the semantics of geographic feature types including operations, attributes and relationships between feature types is required to realise the benefits of Spatial Data Infrastructures (SDIs). Specifically, such information provides a more complete representation of the semantics of the concepts used in the SDI, and enables advanced navigation, discovery and utilisation of discovered resources. The presented approach creates an FTC implementation in which attributes, associations and operations for a given feature type are encapsulated within the FTC, and these conceptual representations are separated from the implementation aspects of the web services that may realise the operations in the FTC. This differs from previous approaches that combine the implementation and conceptual aspects of behaviour in a web service ontology, but separate the behavioural aspects from the static aspects of the semantics of the concept or feature type. These principles are demonstrated by the implementation of such a registry using open standards. The ebXML Registry Information Model (ebRIM) was used to incorporate the FTC described in ISO 19110 by extending the Open Geospatial Consortium ebRIM Profile for the Web Catalogue Service (CSW) and adding a number of stored queries to allow the FTC component of the standards‐compliant registry to be interrogated. The registry was populated with feature types from the marine domain, incorporating objects that conform to both the object and field views of the world. The implemented registry demonstrates the benefits of inheritance of feature type operations, attributes and associations, the ability to navigate around the FTC and the advantages of separating the conceptual from the implementation aspects of the FTC. Further work is required to formalise the model and include axioms to allow enhanced semantic expressiveness and the development of reasoning capabilities.  相似文献   

10.
The purpose of object matching in conflation is to identify corresponding objects in different data sets that represent the same real-world entity. This article presents an improved linear object matching approach, named the optimization and iterative logistic regression matching (OILRM) method, which combines the optimization model and logistic regression model to obtain a better matching result by detecting incorrect matches and missed matches that are included in the result obtained from the optimization (Opt) method for object matching in conflation. The implementation of the proposed OILRM method was demonstrated in a comprehensive case study of Shanghai, China. The experimental results showed the following. (1) The Opt method can determine most of the optimal one-to-one matching pairs under the condition of minimizing the total distance of all matching pairs without setting empirical thresholds. However, the matching accuracy and recall need to be further improved. (2) The proposed OILRM method can detect incorrect matches and missed matches and resolve the issues of one-to-many and many-to-many matching relationships with a higher matching recall. (3) In the case where the source data sets become more complicated, the matching accuracy and recall based on the proposed OILRM method are much better than those based on the Opt method.  相似文献   

11.
This paper presents a new technique for information fusion. Unlike most previous work on information fusion, this paper explores the use of instance‐level (extensional) information within the fusion process. This paper proposes an algorithm that can be used automatically to infer the schema‐level structure necessary for information fusion from instance‐level information. The approach is illustrated using the example of geospatial land‐cover data. The method is then extended to operate under uncertainty, such as in cases where the data are inaccurate or imprecise. The paper describes the implementation of the fusion method within a software prototype. Finally, the paper discusses several key topics for future research, including applications of this work to spatial‐data mining and the semantic web.  相似文献   

12.
  相似文献   

13.
Partial knowledge about geospatial categories is important for practical use of ontologies in the geospatial domain. Degree of overlaps between geospatial categories, especially those based on geospatial actions concepts and geospatial enitity concepts, need to be specified in ontologies. Conventional geospatial ontologies do not enable specification of such information, and this presents difficulties in ontology reasoning for practical purposes. We present a framework to encode probabilistic information in geospatial ontologies based on the BayesOWL approach. The approach enables rich inferences such as most similar concepts within and across ontologies. This paper presents two case studies of using road‐network ontologies to demonstrate the framework for probabilistic geospatial ontologies. Besides inferences within the probabilistic ontologies, we discuss inferences about most similar concepts across ontologies based on the assumption that geospatial action concepts are invariable. The results of such machine‐based mappings of most similar concepts are verified with mappings of concepts extracted from human subjects testing. The practical uses of probabilistic geospatial ontologies for concept matching and measuring naming heterogeneities between two ontologies are discussed. Based on our experiments, we propose such a framework for probabilistic geospatial ontologies as an advancement of the proposal to develop semantic reference systems.  相似文献   

14.
构建数字城市服务公共平台,能够有效地解决异源异构数据共享的问题,实现地理信息互操作。该文以数字城市服务公共平台下的地理信息服务为例,基于本体论,利用属性枚举的语义表达方法构建地理信息服务本体,以明确且形式化的方法描述服务语义,力图解决地理信息服务语义共享的问题。最后给出数字城市公共平台部分地理信息服务的形式化语义描述,在Protégé软件中完成地理信息服务本体的构建,同时结合HermiT1.3.4实现推理过程,并以地理编码服务为例构建了一组本体结构。  相似文献   

15.
基于OGC WPS的遥感图像分布式检索系统研究   总被引：2，自引：1，他引：1  
结合OGC WPS开放标准规范和分布式检索技术,提出基于OGC WPS构建遥感图像分布式检索系统的方法。采用Z39.50通用检索表达式的扩展模式,避免了遥感图像编目数据库与检索系统的紧密耦合;采用HTTP/XML定义检索网关和资源节点之间的WPS接口,实现了编目资源节点到网关的动态接入与移出机制。最后运用开放源代码GIS技术开发了一个原型演示系统,试验证明上述方法切实可行。  相似文献   

16.
In integration of road maps modeled as road vector data, the main task is matching pairs of objects that represent, in different maps, the same segment of a real-world road. In an ad hoc integration, the matching is done for a specific need and, thus, is performed in real time, where only a limited preprocessing is possible. Usually, ad hoc integration is performed as part of some interaction with a user and, hence, the matching algorithm is required to complete its task in time that is short enough for human users to provide feedback to the application, that is, in no more than a few seconds. Such interaction is typical of services on the World Wide Web and to applications in car-navigation systems or in handheld devices.

Several algorithms were proposed in the past for matching road vector data; however, these algorithms are not efficient enough for ad hoc integration. This article presents algorithms for ad hoc integration of maps in which roads are represented as polylines. The main novelty of these algorithms is in using only the locations of the endpoints of the polylines rather than trying to match whole lines. The efficiency of the algorithms is shown both analytically and experimentally. In particular, these algorithms do not require the existence of a spatial index, and they are more efficient than an alternative approach based on using a grid index. Extensive experiments using various maps of three different cities show that our approach to matching road networks is efficient and accurate (i.e., it provides high recall and precision).

General Terms:Algorithms, Experimentation  相似文献   

17.
Linear feature matching is one of the crucial components for data conflation that sees its usefulness in updating existing data through the integration of newer data and in evaluating data accuracy. This article presents a simplified linear feature matching method to conflate historical and current road data. To measure the similarity, the shorter line median Hausdorff distance (SMHD), the absolute value of cosine similarity (aCS) of the weighted linear directional mean values, and topological relationships are adopted. The decision tree analysis is employed to derive thresholds for the SMHD and the aCS. To demonstrate the usefulness of the simple linear feature matching method, four models with incremental configurations are designed and tested: (1) Model 1: one-to-one matching based on the SMHD; (2) Model 2: matching with only the SMHD threshold; (3) Model 3: matching with the SMHD and the aCS thresholds; and (4) Model 4: matching with the SMHD, the aCS, and topological relationships. These experiments suggest that Model 2, which considers only distance, does not provide stable results, while Models 3 and 4, which consider direction and topological relationships, produce stable results with levels of accuracy around 90% and 95%, respectively. The results suggest that the proposed method is simple yet robust for linear feature matching.  相似文献   

18.
OpenGIS参考模型ORM及地理信息服务应用模式   总被引：4，自引：0，他引：4  
地理信息语义互操作是地理信息共享应用的基础,为解决OpenGIS抽象规范与实施规范在地理信息语义描述上的不足,OGC建立了OpenGIS参考模型(OpenGIS Reference Model,ORM),旨在通过ORM实现地理信息共享与互操作。该文从空间信息应用政策、空间信息语义描述、空间信息服务定义与分类、多网络服务配置、共享开发标准五个层面介绍ORM,并分析基于ORM的地理信息服务应用模式。  相似文献   

19.
There has been ample work in GIScience on the formalization of ontologies but a relatively neglected area is the influence of language and culture on ontologies of geography. Although this subject has been investigated for conceptual ontologies using indigenous words denoting geographic features, this article represents the first attempt to develop a logical ontology with an indigenous group. The process of developing logical ontologies is here referred to as formalization. A methodology for formalizing ontologies with indigenous peoples is presented. A conceptual (human readable) ontology and a logical (axioms specified in mathematical logic) ontology were developed using this methodology. Research was conducted with the Cree, the largest indigenous language grouping in Canada. Results show that the geospatial ontology developed from Cree geographic concepts possesses unique design considerations: no superordinate classes were found from archival sources or Cree speakers so ontologies are structurally flat; the ontology contains some unique classes of water bodies; and the ontology challenges our notions of the generalizability of ontologies within indigenous groups. Whereas these difficulties are not insurmountable to the establishment of a cross-cultural Geospatial Semantic Web, the current plans of the World Wide Web Consortium do not adequately address them. We suggest future directions toward an inclusive semantic interoperability.  相似文献   

20.
Geospatial data matching is an important prerequisite for data integration, change detection and data updating. At present, crowdsourcing geospatial data are attracting considerable attention with its significant potential for timely and cost-effective updating of geospatial data and Geographical Information Science (GIS) applications. To integrate the available and up-to-date information of multi-source geospatial data, this article proposes a heuristic probabilistic relaxation road network matching method. The proposed method starts with an initial probabilistic matrix according to the dissimilarities in the shapes and then integrates the relative compatibility coefficient of neighbouring candidate pairs to iteratively update the initial probabilistic matrix until the probabilistic matrix is globally consistent. Finally, the initial 1:1 matching pairs are selected on the basis of probabilities that are calculated and refined on the basis of the structural similarity of the selected matching pairs. A process of matching is then implemented to find M:N matching pairs. Matching between OpenStreetMap network data and professional road network data shows that our method is independent of matching direction, successfully matches 1:0 (Null), 1:1 and M:N pairs, and achieves a robust matching precision of above 95%.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号