Matching of Polygon Objects by Optimizing Geometric Criteria
Authors
Abstract:
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary. In previous research, the most used geometric criteria are the overlap area between two features, the Euclidian distance between two features, the orientation difference of two features, and the shape similarity of two features. In addition to determining the impact factor of each criterion in the best result, the best geometric criteria combination should be specified. In this study, unlike previous studies which have considered object matching as a unique issue in all datasets, objects matching is considered as a separate issue in each dataset and by converting the problem as an optimization problem, an approach is proposed to define optimal weights of criteria for different datasets using a genetic algorithm. In each dataset, corresponding best weights have distinguished that lead to the best matching result. To evaluate the proposed approach, a variety of spatial datasets of residential buildings have been used including a part of Bandar Abbas city in 1:25000, 1:50000, and 1:100000 scales; a part of district 6 of Tehran city in 1:25000 and 1:50000 scales; and a part of Rasht city in 1:25000, 1:50000, and 1:100000 scales. The results showed that the proposed approach has done a good performance in both polygon feature matching and identifying six corresponding relationship classes in all study areas. Moreover, matching results have been improved by an average of 28.61% compared to the case where all criteria are considered with equal weights and an average of 9.13% compared to the case that criteria are assessed according to expert opinions.
similar resources
Matching points with geometric objects: Combinatorial results
Given a class C of geometric objects and a point set P , a Cmatching of P is a set M = {C1, . . . , Ck} of elements of C such that every Ci contains exactly two elements of P . If all the elements of P belong to some Ci, M is called a perfect matching ; if in addition all the elements of M are pairwise disjoint we say that this matching M is strong. In this paper we study the existence and char...
full textMatching Objects in Multi-Camera Surveillance without Geometric Constraints
Intelligent visual surveillance by multiple cameras has becoming more and more important in recent years. A novel and effective method to match objects between multiple cameras is proposed in this work, based on the proposed wavelet salient features. Firstly, the background and foreground is separated based on Gaussian Mixture Model (GMM). To achieve a reliable matching objects between cameras,...
full textMultiple Polyline to Polygon Matching
This paper addresses the partial shape matching problem, which helps identifying similarities even when a significant portion of one shape is occluded, or seriously distorted. We introduce a measure for computing the similarity between multiple polylines and a polygon, that can be computed in O(kmn) time with a straightforward dynamic programming algorithm. We then present a novel fast algorith...
full textGeometric descriptions of polygon and chain spaces
We give a few simple methods to geometically describe some polygon and chain spaces in R. They are strong enough to give tables of m-gons and m-chains when m ≤ 6.
full textOptimizing KLIC Generic Objects by Static Analysis
The KLIC system has achieved both high portability and extensibility by employing C as an intermediate language and featuring generic objects that allow users to dene new classes of data. It is also e cient for an untyped and unmoded language with ne-grained concurrency, but its exibility incurs runtime overhead that could be reduced by static analysis. This paper studies how constraint-based s...
full textOptimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming languages. The main originality is to support pattern matching against native data-structures like objects or records. While crucial to the efficient implementation of functional languages as well as rewrite rule bas...
full textMy Resources
Journal title
volume 9 issue None
pages 1- 24
publication date 2021-12
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023