Matching of Pathways in Sketch Maps Based on Descriptive and Geometric Information

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
One of the most well-known methods used by the public to share spatial knowledge is the sketch maps. These types of maps can be considered as an effective way to collect and share spatial data by depicting some of the spatial cognition of individuals from the real world. Because of the difference in the cognition of individuals from the environment, each of the sketch maps drawn from a specific region can include different information. An important question to be asked here is how the potential of these maps can be benefited more and better in order to collect spatial data in spite of these differences. One of the proposed methods for this purpose is to combine and integrate information extracted from different sketch maps of a region with the aim of obtaining a map with more complete information than any of the original sketches. Although this integration can provide a better use of the potential of the sketch maps for collecting spatial data, prior to that, it is necessary to consider the matching process between the features in the sketch maps. However, there are several types of features in sketch maps, but all sketches contain pathways and these pathways can be identified by name, or based on specific places or Points of Interest (POI) located in the proximity of them. Accordingly, in this paper, a new solution is proposed for matching between the existing pathways in the sketch maps. In order to describe each pathway in the sketch maps, in addition to the name of the pathway, we can use information that can be extracted indirectly from these sketch maps. To describe a specific address, even if we do not know the correct names of the pathways, we can use the names of near POIs or other related pathways. The same point is used in this paper to describe the pathways in the sketch Maps. Accordingly, the matching parameters are considered as two main parts. These parts are the proximity of POIs and intersections of pathways with matched well-known pathways. Therefore, in the first step of implementation, based on the descriptive information as well as the relative distance between the POIs, the clustering process is performed on POIs location. Subsequently, based on the qualitative spatial relations between clusters and pathways, descriptive information of the pathways, the arrangement of the pathways around the intersection points, pathway intersection with roundabouts and matched well-known pathways, the process of matching of the four sketch maps is done. In order to evaluate the accuracy of this method, the outputs of the matching process are compared with the manually matching, and then, the precision and recall values ​​for each matching are calculated. The average values ​​of these two parameters (89.63% for precision and 87.1% for recall) indicate that this solution has an acceptable accuracy compared to other studies in this field and therefore, the proposed solution can be exploited in future works as the basis for the integration to enrich the existing  metric maps with less details.
Language:
Persian
Published:
Journal of Geomatics Science and Technology, Volume:8 Issue: 3, 2019
Pages:
207 to 215
magiran.com/p1964139  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!