• Title/Summary/Keyword: 레이어

Search Result 753, Processing Time 0.032 seconds

A Study on the Prediction of Groundwater Contamination using GIS (GIS를 이용한 지하수오염 예측에 관한 연구)

  • Jo, Si-Beom;Shon, Ho-Woong;Lee, Kang-Won
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.12 no.2 s.29
    • /
    • pp.17-28
    • /
    • 2004
  • This study has tried to develop the modified DRASTIC Model by supplying the parameters, such as structural lineament density and land-use, into conventional DRASTIC model, and to predict the potential of groundwater contamination using GIS in Hwanam 2 District, Gyeonggi Province, Korea. Since the aquifers in Korea is generally through the joints of rock-mass in hydrogeological environment, lineament density affects to the behavior of groundwater and contaminated plumes directly, and land-use reflect the effect of point or non-point source of contamination indirectly. For the statistical analysis, lattice-layers of each parameter were generated, and then level of confidence was assessed by analyzing each correlation coefficient. Groundwater contamination potential map was achieved as a final result by comparing modified DRASTIC potential and the amount of pollutant load logically. The result suggest the predictability of contamination potential in a specified area in the respects of hydrogeological aspect and water quality.

  • PDF

3D-GIS Network Modeling for Optimal Path Finding in Indoor Spaces (건물 내부공간의 최적경로 탐색을 위한 3차원 GIS 네트워크 모델링)

  • Park, In-Hye;Jun, Chul-Min;Choi, Yoon-Soo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.3
    • /
    • pp.27-32
    • /
    • 2007
  • 3D based information is demanded increasingly as cities grow three dimensionally and buildings become large and complex. The use of 3D GIS is also getting attention as fundamental data for ubiquitous computing applications such as location-based guidance, path finding and emergency escaping. However, most 3D modeling techniques are focused on the visualization of buildings or terrains and do not have topological structures required in spatial analyses. In this paper, we introduce a method to incorporate topological relationship into 3D models by combining 2D GIS layers and 3D model. We divide indoor spaces of a 3D model into discrete objects and then define the relationship with corresponding features in 2D GIS layers through database records. We also show how to construct hallways network in the 2D-3D integrated building model. Finally, we test different cases of route finding situations inside a building such as normal origin-destination path finding and emergency evacuation.

  • PDF

Application of Transmittance-Controlled Photomask Technology to ArF Lithography (투과율 조절 포토마스크 기술의 ArF 리소그래피 적용)

  • Lee, Dong-Gun;Park, Jong-Rak
    • Korean Journal of Optics and Photonics
    • /
    • v.18 no.1
    • /
    • pp.74-78
    • /
    • 2007
  • We report theoretical and experimental results for application of transmittance-controlled photomask technology to ArF lithography. The transmittance-controlled photomask technology is thought to be a promising technique fo critical dimension (CD) uniformity correction on a wafer by use of phase patterns on the backside of a photomask. We could theoretically reproduce experimental results for illumination intensity drop with respect to the variation of backside phase patterns by considering light propagation from the backside to the front side of a photomask at the ArF lithography wavelength. We applied the transmittance-controlled photomask technology to ArF lithography for a critical layer of DRAM (Dynamic Random Access Memory) having a 110-nm design rule and found that the in-field CD uniformity value was improved from 13.8 nm to 9.7 nm in $3{\sigma}$.

Development of a Web-based System for Raster Data Analysis Using Map Algebra (연구는 래스터 데이터의 지도대수 분석을 위한 GRASS 기반의 웹 시스템 개발)

  • Lee, In-Ji;Lee, Yang-Won;Suh, Yong-Cheol
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.18 no.4
    • /
    • pp.131-139
    • /
    • 2010
  • Recent spread of GIS and the increasing demand of spatial data have brought about the development of web GIS. In addition to sharing and mapping spatial data, web GIS is also required to provide spatial analytic functions on the web. The FOSS(free and open source software) can play an important role in developing such a system for web GIS. In this paper, we proposed a web-based system for raster data analysis using map algebra. We employed GRASS as an open source software and implemented the GRASS functionalities on the web using java methods for invocation of server-side commands. Map algebra and AHP were combined for the raster data analysis in our system. For a feasibility test, the landslide susceptibility in South Korea was calculated using rainfall, elevation, slope angle, slope aspect, and soil layers. It is anticipated that our system will be extensible to other web GIS for raster data analysis with GRASS.

Efficient Signal Filling Method Using Watershed Algorithm for MRC-based Image Compression (MRC 기반의 영상 부호화를 위한 분수령 알고리즘을 이용한 효과적인 신호 채움 기법)

  • Park, Sang-Hyo;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.2
    • /
    • pp.21-30
    • /
    • 2015
  • Image coding based on mixed raster content model generates don't care regions (DCR) in foreground and background layers, and its overall coding performance is greatly affected by region filling methods for DCRs. Most conventional methods for DCR filling fail in utilizing the local signal properties in hole regions and thus the high frequency components in non-DCR regions are reflected into DCR after signal filling. In addition, further high frequency components are induced to the filled signal because of signal discontinuities in the boundary of DCR. To solve this problem, a new DCR filling algorithm using the priority-based adaptive region growing is proposed in this paper. The proposed method uses the watershed algorithm and the flooding priority of each pixel for region filling is determined from the degree of smoothness in the neighborhood area. By growing the filled region into DCR based on the computed priority, the expansion of high-textured area can be minimized which can improve the overall coding performance. Experimental results show that the proposed method outperforms conventional algorithms.

Developing a Work Procedure for Efficient Map Generalization (효율적인 일반화 자료처리를 위한 작업공정 개발)

  • Choi, Seok-Keun;Kim, Myung-Ho;Hwang, Chang-Sup
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.6 no.3
    • /
    • pp.73-82
    • /
    • 2003
  • This paper proposes a work procedure for generalizing large-scale digital maps ver. 2.0(1/5,000) into a small-scale digital map(1/25,000). Unlike a existent digital map, the digital map ver. 2.0 has a variety of attribute data as well as graphic data. To perform an efficient map generalization with these structural properties, we establish a work procedure as follow; firstly, delete layers which don't exist in small-scale digital map's feature code, and secondly, generalize features which have been classified into 8 layers, and finally merge 8 layers which have been generalized into 1 layer. Therefore, we expect that a work procedure which is proposed in this paper will play a fundamental role in automated generalization system and will contribute to small-scale digital mapping and thematic mapping.

  • PDF

Fast Handoff Technique using Improved Cashing Agent and CoA Pool in Mobile IP (모바일 아이피에서 개선된 캐싱 에이전트와 CoA 풀을 사용한 빠른 핸드오프 기법)

  • Lee, Jang-Su;Kim, Sung-Chun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.75-82
    • /
    • 2008
  • Mobile IP was proposed to overcome identity problem of original IP address system caused by mobility of wireless mobile host. To complete its network handoff procedure, it must receive a mobile advertisement broadcasted by mobile agent. Generally, in a mobile IP system, mean time delay, 500ms, in a network handoff procedure is a critical problem of wireless service such as Voip, multimedia streaming. A caching agent caches a latest mobile advertisement, and replays it by receiving solicitation message from a mobile node finishing link layer detection. But, during the procedure of mobile registration, many packets from service provider to the mobile host would be lost and handoff time delay would be increased. In this thesis, we propose an unproved caching agent technique which can forward data packets while handoff procedure, and CoA pool for fast mobile IP registration.

Load-balanced multi-agent model for moving patient management in mobile distribution environment (모바일 분산 환경에서 이동형 환자관리를 위한 부하 균형 다중 에이전트 모델)

  • Lee, Mal-Rye;Kim, Eun-Gyung;Zang, Yu-Peng;Lee, Jae-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.809-816
    • /
    • 2010
  • This paper proposed about a load-balanced multi-agent model in mobile distribution environment to monitor moving patients and to deal with a situation of emergency. This model was designed to have a structure based on distribution framework by expanding a mobile system, and provides healthcare services based on real time situational information on moving patients. In order to overcome the limitation of middleware when we design system, we provided an abstract layer between applications and their base network infrastructure so that balance between QoS requests and network life can be maintained. In addition, clustering was used in cells for the efficient load distribution among multi-agents. By using Clustering FCM, we got optimal resources and had solve about transmission delay.

A Study on the Construction of 3D GIS DB by LiDAR (LiDAR에 의한 3차원 GIS DB 구축에 관한 연구)

  • Yoon, Hee-Cheon;Park, Joon-Kyu
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.10 no.2
    • /
    • pp.172-183
    • /
    • 2007
  • Recently geospatial information has used widely in many areas such as effective use and management of national land, establishment of city planning, managements of environments and disasters, etc. But present digital map is not suitable for nowadays because of delay of information renewal and changes of topography. In this study, GIS DB construction method was researched through the process of extracting main vector layers such as buildings, roads, contours, etc. from LiDAR data. In order to analyze accuracies of constructed data, the digital topographic maps of 1:1000 scale which were produced by Korea National Geographic Information Institute(NGI) and results of GPS survey were used. Effective DB construction method was suggested through comparing with existing GIS DB construction methods.

  • PDF

The Study on Simplification in Digital Map Generalization (수치지도 일반화에 있어서 단순화에 관한 연구)

  • 최병길
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.19 no.2
    • /
    • pp.199-208
    • /
    • 2001
  • The digital map in Korea has been producted and utilized independently according to scales such as 1:1,000, 1:5,000, and 1:25,000. Therefore, whenever we need to obtain the spatial data of other scales, we have to product the digital maps over and over again which it is time-consuming and ineconomic. To solve these problems, it has been accomplished many researches on map generalization to make digital maps in small scale from the master data of large scale. This paper aims to analyze the conversion characteristics of the large scale to the small scale by simplification of map generalization. For this purpose, it is proposed the algorithm for the simplification process of digital map and it is investigated the simplification characteristic of digital map through the experiment on the conversion of 1:5,000 scale into 1:25.000 scale. The results show that Area-Preservation algorithm indicates the good agreement with the original data in terms of the area and features of building layer compared to Douglas-Peucker algorithm and Reumann-Witkam algorithm.

  • PDF