• Title/Summary/Keyword: Information map

Search Result 6,313, Processing Time 0.033 seconds

Design and Implementation of Visual Filtering for Integrated Underground Map Security (보안을 고려한 지하공간통합지도의 가시화 필터링 설계)

  • Kim, Yong Tae;Park, Chan Seob
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.39 no.6
    • /
    • pp.477-482
    • /
    • 2021
  • The integrated underground space map system provides information on infrastructure that requires security, but to prevent rupture accidents during excavation work at the underground construction site, it must provide information on all underground facilities on the site. Providing additional information other than the object of interest to the user is a factor that increases the risk of information leakage of security data. In this paper, we design the visualization filtering method that when visualizing the integrated underground space map in the field, the visualization of entire underground facilities of interest to workers is performed, but visualization of other underground facilities is minimized to minimize the risk of security data information leakage. To this end, a visualization area of a certain distance for each of the underground facilities of interest was created, and an integrated visualization filter was created with spatial union operation. When the integrated underground map is output on the screen, only the objects located within the filter area are visualized using the generated filter information, and objects that exist outside are not visualized, thereby minimizing the provision of information to the user.

A Study on the Effectiveness of Small-scale Maps Production Based on Tolerance Changes of Map Generalization Algorithm (지도 일반화 알고리듬의 임계값 설정에 따른 소축척 지도 제작의 효용성 연구)

  • Hwakyung Kim;Jaehak Ryu;Jiyong Huh;Yongtae Shin
    • Journal of Information Technology Services
    • /
    • v.22 no.5
    • /
    • pp.71-86
    • /
    • 2023
  • Recently, various geographic information systems have been used based on spatial information of geographic information systems. Accordingly, it is essential to produce a large-scale map as a small-scale map for various uses of spatial information. However, maps currently being produced have inconsistencies between data due to production timing and limitations in expression, and productivity efficiency is greatly reduced due to errors in products or overlapping processes. In order to improve this, various efforts are being made, such as publishing research and reports for automating domestic mapping, but because there is no specific result, it relies on editors to make maps. This is mainly done by hand, so the time required for mapping is excessive, and quality control for each producer is different. In order to solve these problems, technology that can be automatically produced through computer programs is needed. Research has been conducted to apply the rule base to geometric generalization. The algorithm tolerance setting applied to rule-based modeling is a factor that greatly affects the result, and the level of the result changes accordingly. In this paper, we tried to study the effectiveness of mapping according to tolerance setting. To this end, the utility was verified by comparing it with a manually produced map. In addition, the original data and reduction rate were analyzed by applying generalization algorithms and tolerance values. Although there are some differences by region, it was confirmed that the complexity decreased on average. Through this, it is expected to contribute to the use of spatial information-based services by improving tolerances suitable for small-scale mapping regulations in order to secure spatial information data that guarantees consistency and accuracy.

Analysis of Mashup Performances based on Vector Layer of Various GeoWeb 2.0 Platform Open APIs (다양한 공간정보 웹 2.0 플랫폼 Open API의 벡터 레이어 기반 매쉬업 성능 분석)

  • Kang, Jinwon;Kim, Min-soo
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.9 no.4
    • /
    • pp.745-754
    • /
    • 2019
  • As GeoWeb 2.0 technologies are widely used, various kinds of services that mashup spatial data and user data are being developed. In particular, various spatial information platforms such as Google Maps, OpenStreetMap, Daum Map, Naver Map, olleh Map, and VWorld based on GeoWeb 2.0 technologies support mashup service. The mashup service which is supported through the Open APIs of the platforms, provides various kinds of spatial data such as 2D map, 3D map, and aerial image. Also, application fields using the mashup service are greatly expanded. Recently, as user data for mashup have been greatly increased, there was a problem in mashup performance. However, the research on the mashup performance improvement is currently insufficient, even the research on the mashup performance comparison of various platforms has not been performed. In this paper, we perform comparative analysis of the mashup performance for large amounts of user data and spatial data using various spatial information platforms available in Korea. Specifically, we propose two performance analysis indexes of mashup time and user interaction time in order to analyze the mashup performance efficiently. Also, we implement a system for the performance analysis. Finally, from the performance analysis result, we propose a spatial information platform that can be efficiently applied to cases when user data increases greatly and user interaction occurs frequently.

Path Planning Using an Information Grid Map for Safe Navigation (안전한 주행을 위한 정보 격자지도 기반의 경로계획)

  • Jung, Min-Kuk;Park, Joong-Tae;Song, Jae-Bok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.6
    • /
    • pp.623-628
    • /
    • 2012
  • Conventional path planning methods have focused on the generation of an optimal shortest path to the goal. However, this optimal path cannot guarantee safe navigation, because it can often lead to a narrow area. Therefore, we propose a Coulomb's law-based safe path planning method that uses an information grid map. The information grid map includes four types of information: occupied, empty, guide, and dangerous areas. A safe path can be generated away from the dangerous area and close to the guide area by repulsive and attractive forces, respectively. Experiments and simulations show that the proposed method can generate paths inside the safe region and is useful for safe navigation.

Recent Technologies for the Acquisition and Processing of 3D Images Based on Deep Learning (딥러닝기반 입체 영상의 획득 및 처리 기술 동향)

  • Yoon, M.S.
    • Electronics and Telecommunications Trends
    • /
    • v.35 no.5
    • /
    • pp.112-122
    • /
    • 2020
  • In 3D computer graphics, a depth map is an image that provides information related to the distance from the viewpoint to the subject's surface. Stereo sensors, depth cameras, and imaging systems using an active illumination system and a time-resolved detector can perform accurate depth measurements with their own light sources. The 3D image information obtained through the depth map is useful in 3D modeling, autonomous vehicle navigation, object recognition and remote gesture detection, resolution-enhanced medical images, aviation and defense technology, and robotics. In addition, the depth map information is important data used for extracting and restoring multi-view images, and extracting phase information required for digital hologram synthesis. This study is oriented toward a recent research trend in deep learning-based 3D data analysis methods and depth map information extraction technology using a convolutional neural network. Further, the study focuses on 3D image processing technology related to digital hologram and multi-view image extraction/reconstruction, which are becoming more popular as the computing power of hardware rapidly increases.

2D-to-3D Conversion System using Depth Map Enhancement

  • Chen, Ju-Chin;Huang, Meng-yuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1159-1181
    • /
    • 2016
  • This study introduces an image-based 2D-to-3D conversion system that provides significant stereoscopic visual effects for humans. The linear and atmospheric perspective cues that compensate each other are employed to estimate depth information. Rather than retrieving a precise depth value for pixels from the depth cues, a direction angle of the image is estimated and then the depth gradient, in accordance with the direction angle, is integrated with superpixels to obtain the depth map. However, stereoscopic effects of synthesized views obtained from this depth map are limited and dissatisfy viewers. To obtain impressive visual effects, the viewer's main focus is considered, and thus salient object detection is performed to explore the significance region for visual attention. Then, the depth map is refined by locally modifying the depth values within the significance region. The refinement process not only maintains global depth consistency by correcting non-uniform depth values but also enhances the visual stereoscopic effect. Experimental results show that in subjective evaluation, the subjectively evaluated degree of satisfaction with the proposed method is approximately 7% greater than both existing commercial conversion software and state-of-the-art approach.

A Technique for Generating Semantic Trajectories by Using GPS Positions and POI Information (GPS 이동 궤적과 관심지점 정보를 이용한 시맨틱 궤적 생성 기법)

  • Jang, Yuhee;Lee, Juwon;Lim, Hyo-Sang
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.10
    • /
    • pp.439-446
    • /
    • 2015
  • Recently, semantic trajectories which combine GPS positions and POIs(Point of Interests) become more popular in order to expand location based services. To construct semantic trajectories, the existing algorithms exploit the extent information of POIs described as polygons and find overlapping regions between GPS positions and the extents. However, the algorithms are not applicable in the condition where the extent information is not provided such as in Google Map, Naver Map, OpenStreetMap and most of the open geographic information systems. In this paper, we provide a novel algorithm to construct semantic trajectories only with GPS positions and POI points but without POI extents.

Utilizing Usability Metrics to Evaluate a Subway Map Design

  • Jung, Kwang Tae
    • Journal of the Ergonomics Society of Korea
    • /
    • v.36 no.4
    • /
    • pp.343-353
    • /
    • 2017
  • Objective: This study aims to evaluate the efficiency of two representative subway map design types, namely a diagram type and a geographical type using physiological metrics, performance metrics, and self-reported metrics, which are representative usability metrics. Background: Subway maps need to be designed in order for users to quickly search and recognize subway line information. Although most cities' subway maps currently use the diagram type designed by Henry Beck, New York City's subway map has recently been changed to the subway map type combined with the geographical type designed by Michael Hertz. However, not many studies on its efficiency are found, and the studies that are available mainly depend on questionnaire surveys or take on a subjective behavioral study type based on experts' experiences. In this regard, evaluation through a more objective method is needed. Method: This study employed usability metrics as a method to evaluate the efficiency of information search targeting the diagram type and geographical type subway maps used mostly as subway maps. To this end, physiological metrics obtained through eye tracking, task completion time, representative metric of task performance, and subjective evaluation metrics were used for the suitability evaluation of subway map designs. Results: In the result of gaze movement distance analysis, no significant difference was shown in the two design types in terms of a process finding a departure station from the starting point and a process finding a transfer station between the departure station and arrival station (destination). However, the gaze movement distance in the process finding the arrival station at the departure station was significantly shorter in the geographical type, rather than in the diagram type. The analysis of task completion time showed a result similar to the gaze movement distance analysis result. Task completion time was significantly shorter in the geographical type, rather than in the diagram type, which is in the process finding the arrival station at the departure station. In other information search processes, no significant difference was shown. As a result of subjective evaluation metrics analysis, no significant difference was revealed in the two design types. Conclusion: An analysis on the two representative subway map design types was carried out via the adoption of usability metrics. As a result, although no significant difference was shown in some information search processes, it was revealed that information search was easier in the geographical type overall. Also, it was found that usability metrics can be effectively used to evaluate the design types of subway maps. Application: The study results can be used to set design direction to offer ease in information search on subway lines. The study also can be used as a method to evaluate a subway map's design type.

Motion Map Generation for Maintaining the Temporal Coherence of Brush Strokes in the Painterly Animation (회화적 애니메이션에서 브러시 스트로크의 시간적 일관성을 유지하기 위한 모션 맵 생성)

  • Park Youngs-Up;Yoon Kyung-Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.8
    • /
    • pp.536-546
    • /
    • 2006
  • Painterly animation is a method that expresses painterly images with a hand-painted appearance from a video, and the most crucial element for it is the temporal coherence of brush strokes between frames. A motion map is proposed in this paper as a solution to the issue of maintaining the temporal coherence in the brush strokes between the frames. A motion map is the region that frame-to-frame motions have occurred. Namely, this map refers to the region frame-to-frame edges move by the motion information with the motion occurred edges as a starting point. In this paper, we employ the optical flow method and block-based method to estimate the motion information. The method that yielded the biggest PSNR using the motion information (the directions and magnitudes) acquired by various methods of motion estimation has been chosen as the final motion information to form a motion map. The created motion map determine the part of the frame that should be re-painted. In order to express painterly images with a hand- painted appearance and maintain the temporal coherence of brush strokes, the motion information was applied to only the strong edges that determine the directions of the brush strokes. Also, this paper seek to reduce the flickering phenomenon between the frames by using the multiple exposure method and the difference map created by the difference between images of the source and the canvas. Maintenance of the coherence in the direction of the brush strokes was also attempted by a local gradient interpolation to maintain the structural coherence.

Contents Based Partial Encryption of GIS Vector Map (GIS 벡터맵의 콘텐츠 기반 선택적 암호화 기술)

  • Jang, Bong-Joo;Lee, Suk-Hwan;Moon, Kwang-Seok;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.5
    • /
    • pp.88-98
    • /
    • 2011
  • Recently, according as the importance of GIS(geography information system) database security is embossed, much researches had been achieved about GIS network security. But most such researches are weak against sourceful illegal reproductions and distributions of GIS vector data map. In this paper, we proposed an efficient layer unit contents based partial encryption technique in the vector map compression domain to prevent illegal distributions and unauthorized accesses. This method achieves a partial encryption about each central coordinate and directional parameters of a MCA(minimum coding attribute) that is created at the vector map compression processing in the vector space. First, the position encryption is applied as permutating randomly the center coordinate of each record that is minimum unit of vector map shape. And second, the direction encryption that changing shapes of vector map topography is applied as encrypting the direction of vertices's coordinates of each record. In experimental results, we confirmed that our proposed method can encipher the large volumed vector map data effectively in low computational complexity. Also, we could minimize the decline of compression efficiency that occurred by conventional contents based encryption schemes using AES or DES algorithms.