• Title/Summary/Keyword: Distance Map

Search Result 708, Processing Time 0.026 seconds

GIS Based Sinkhole Susceptibility Analysisin Karst Terrain: A Case Study of Samcheok-si (GIS를 활용한 카르스트 지역의 싱크홀 민감성 분석: 삼척시를 중심으로)

  • Ahn, Sejin;Sung, Hyo Hyun
    • Journal of The Geomorphological Association of Korea
    • /
    • v.24 no.4
    • /
    • pp.75-89
    • /
    • 2017
  • Sinkholes are key karst landforms that primarily evolve through the dissolution of limestone, and it posing a significant threat to roads, buildings, and other man-made structures. This study aims to analyze the area susceptible to sinkhole development using GIS and to identify potential danger area from sinkholes. Eight sinkhole related factors (slope angle, distance to caves, distance to faults, bedrock lithology, soil depth, drainage class, distance to mines, and distance to traffic routes) were constructed as spatial databases with sinkhole inventory. Based on the spatial database, sinkhole susceptibility maps were produced using nearest neighbor distance and frequency ratio models. The maps were verified with prediction rate curve and area under curve. The result indicates that the nearest neighbor distance and frequency ratio models predicted 95.3% and 94.4% of possible sinkhole locations respectively. Furthermore, to identify potential sinkhole danger area, the susceptibility map was compared with population distribution and land use map. It has been found that very highly susceptible areas are along Osipcheon and southeast southwest part of Hajang-myeon and south part of Gagok-myeon of Samcheok-si. Among those areas, it has been identified that potential sinkhole danger areas are Gyo-dong, Seongnae-dong, Jeongna-dong, Namyang-dong and Dogye-eup. These results can be useful in the aspects of land use planning and hazard prevention and management.

A study on the Development of Noise map for quiet environment of urban areas (정온한 도시환경을 위한 소음지도 개발 및 응용연구)

  • 박상규;박인선
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.05a
    • /
    • pp.1182-1186
    • /
    • 2003
  • Noise map is becoming an increasingly important tool supporting noise policy. In order to main am a quiet environment of urban areas, noise map was developed by using GIS technique which combines geographic and noise informations with a database management system. By evaluating various methods of the spatial anal: sis, it was concluded that the inverse distance weighted method gave the best results and was applied to develope the noise maps of road noise.

  • PDF

Three-Dimensional Image Registration using a Locally Weighted-3D Distance Map (지역적 가중치 거리맵을 이용한 3차원 영상 정합)

  • Lee, Ho;Hong, Helen;Shin, Yeong-Gil
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.7
    • /
    • pp.939-948
    • /
    • 2004
  • In this paper. we Propose a robust and fast image registration technique for motion correction in brain CT-CT angiography obtained from same patient to be taken at different time. First, the feature points of two images are respectively extracted by 3D edge detection technique, and they are converted to locally weighted 3D distance map in reference image. Second, we search the optimal location whore the cross-correlation of two edges is maximized while floating image is transformed rigidly to reference image. This optimal location is determined when the maximum value of cross-correlation does't change any more and iterates over constant number. Finally, two images are registered at optimal location by transforming floating image. In the experiment, we evaluate an accuracy and robustness using artificial image and give a visual inspection using clinical brain CT-CT angiography dataset. Our proposed method shows that two images can be registered at optimal location without converging at local maximum location robustly and rapidly by using locally weighted 3D distance map, even though we use a few number of feature points in those images.

Construction of a linkage Map in Capsicum annuum L. Using RAPD Markers and Identification of Two QTLs.

  • Yang, Tae-Jin;Kim, Yong-Jae;Park, Hyo-Guen
    • Journal of Plant Biotechnology
    • /
    • v.1 no.2
    • /
    • pp.109-115
    • /
    • 1999
  • A linkage map of Capsicum annuum L. was constructed by random amplified polymorphic DNA (RAPD) markers followed in a backcross population of an intraspecific cross between cultivars HDA210 and Yatsufusa. A total of 420 random primers were tested and 311 polymorphic bands were generated by 158 random primers. Among them, 86 Yatsufusa specific bands generated by 52 primers were examined for mapping. Most bands except three segregated in Mendelian fashion fitting the expected 1:1 ratio. The total length of the map was 533 cM distributed in 15 linkage groups. The map distance between adjacent markers ranged 0 to 32.8 cM, with an average distance of 9.1 cM (63 markers). Some markers were clustered and this may be due to the amplification of a repetitive sequence by the RAPDs. Primer pairs for a sequence characterized amplified region (SCAR) were developed and the segregation scores by the SCAR primers were in accordance with the RAPD data. Two QTL markers for number of axillary shoots and for early flowering were developed. One QTL for early flowering located in the linkage group 3 and explained 61 "io of the phenotypic variation. The other QTL for the number of axillary shoots located in the linkage group 4 explained 55 % of the phenotypic variation.tion.

  • PDF

Turbo Trellis Coded Modulation with Multiple Symbol Detection (다중심벌 검파를 사용한 터보 트렐리스 부호화 변조)

  • Kim Chong Il
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.2
    • /
    • pp.105-114
    • /
    • 2000
  • In this paper, we propose a bandwidth-efficient channel coding scheme using the turbo trellis-coded modulation with multiple symbol detection. The turbo code can achieve good bit error rates (BER) at low SNR. That comprises two binary component codes and an interleaver. TCM codes combine modulation and coding by optimizing the euclidean distance between codewords. This can be decoded with the Viterbi or the symbol-by- symbol MAP algorithm. But we present the MAP algorithm with branch metrics of the Euclidean distance of the first phase difference as well as the Lth phase difference. The study shows that the turbo trellis-coded modulation with multiple symbol detection can improve the BER performance at the same SNR.

  • PDF

Suitability Analysis of Eco-corridor for Korean Water Deer (Hydropotes Inermis) based on GIS and Fuzzy Function - A Case Study of Chuncheon City - (GIS와 퍼지함수(Fuzzy function)를 활용한 고라니의 생태통로 적지분석 - 춘천시를 대상으로 -)

  • Lee, Do-Hyung;Kil, Sung-Ho;Jeon, Seong-Woo
    • Journal of KIBIM
    • /
    • v.8 no.4
    • /
    • pp.72-79
    • /
    • 2018
  • Rapid developments around the world have resulted in urban expansion, habitat destruction, habitat fragmentation, and pollution problems, which are the main reasons for the decline in biological diversity. The United Nations warns that many animals and plants will die out in the near future if this continues. This study was performed to propose a map of eco-corridor suitability analysis of Korean water deer(Hydropotes Inermis) to enhance biodiversity in Chuncheon city. Eight factors affecting habitat suitability were elevation, aspect, slope, forest type, distance to the road, distance to the stream, land use and green connectivity. Previous study analysis on the mobility behaviour of the Korean water deer(Hydropotes Inermis) produced a habitat suitability map by determining the threshold and assigning a value between 0 and 1 depending on the habitat suitability using the fuzzy function. A method of analysis was proposed for a number of eco-corridor through comparative analysis of the data from the produced habitat suitability map and the road-kill point. The previous studies were focused on Backdudaegan region and national parks except for urban cities. The potential habitat map of Korean water deer could be helpful as a way to prevent habitat disconnection and increase species diversity in urban areas.

Multimodal Brain Image Registration based on Surface Distance and Surface Curvature Optimization (표면거리 및 표면곡률 최적화 기반 다중모달리티 뇌영상 정합)

  • Park Ji-Young;Choi Yoo-Joo;Kim Min-Jeong;Tae Woo-Suk;Hong Seung-Bong;Kim Myoung-Hee
    • The KIPS Transactions:PartA
    • /
    • v.11A no.5
    • /
    • pp.391-400
    • /
    • 2004
  • Within multimodal medical image registration techniques, which correlate different images and Provide integrated information, surface registration methods generally minimize the surface distance between two modalities. However, the features of two modalities acquired from one subject are similar. So, it can improve the accuracy of registration result to match two images based on optimization of both surface distance and shape feature. This research proposes a registration method which optimizes surface distance and surface curvature of two brain modalities. The registration process has two steps. First, surface information is extracted from the reference images and the test images. Next, the optimization process is performed. In the former step, the surface boundaries of regions of interest are extracted from the two modalities. And for the boundary of reference volume image, distance map and curvature map are generated. In the optimization step, a transformation minimizing both surface distance and surface curvature difference is determined by a cost function referring to the distance map and curvature map. The applying of the result transformation makes test volume be registered to reference volume. The suggested cost function makes possible a more robust and accurate registration result than that of the cost function using the surface distance only. Also, this research provides an efficient means for image analysis through volume visualization of the registration result.

Z-map Model Using Triangular Grids (삼각 격자를 이용한 Z-map 모델)

  • Park, Pae-Yong;Ahn, Jeong-Ho
    • Proceedings of the KSME Conference
    • /
    • 2000.11a
    • /
    • pp.824-828
    • /
    • 2000
  • Prior to the downloading of the NC codes to a machining center, the NC tool-path can be verified in a computer. The Z-map is one of the tools for the verification of NC tool-path. The Z-map is a two dimensional array in which the height values of the Z-axis direction vectors are stored. The Z-axis direction vectors are arranged in a rectangular grid pattern on the XY plane. The accuracy of the simulation comes from the grid interval. In the rectangular Z-map, the distances between the grid points are different. The distance in diagonal direction is larger than those in X or Y axis directions. For the rendering of the Z-map, a rectangular grid is divided into two triangular facets. Depending on the selection of a diagonal, there are two different cases. In this paper, triangular Z-map, in which the Z-axis direction vectors are arranged in a triangular grid pattern on XY plane, is proposed. In the triangular Z-map, the distances between grid points are equal. There is no ambiguity to make triangular facets for the rendering.

  • PDF

A Study on New Map Construction and Path Planning Method for Mobile Robot Navigation (이동 로봇의 주행을 위한 새로운 지도 구성 방법 및 경로 계획에 관한 연구)

  • O, Jun-Seop;Park, Jin-Bae;Choe, Yun-Ho
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.9
    • /
    • pp.538-545
    • /
    • 2000
  • In this paper we proposed a new map construction and path planning method for mobile robot. In our proposed method first we introduced triangular representation map that mobile robot can navigate through shorter path and flexible motion instead of grid representation map for mobile robot navigation. method in which robot can navigate complete space through as short path as possible in unknown environment is proposed. Finally we proposed new path planning method in a quadtree representation map. To evaluate the performance of our proposed new path planning method in a quadtree representation map. To evaluate the performance of our proposed triangular representation map it was compared with the existing distance transform path planning method. And we considered complete coverage navigation and new path planning method through several examples.

  • PDF

Adaptive MAP Selection Method in HMIPv6 (계층적 Mobile IPv6에서의 적응적 MAP 선택방안)

  • Lee, Sang-Gun;Yu, Ji-Eun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.808-811
    • /
    • 2008
  • HMIPv6는 핸드오버시 시그널링 오버헤드와 패킷 손실을 감소시키는데 목적이 있다. 그러나 HMIPv6는 성능 평가면에서 기존의 MIPv6보다 우수하지 못하다. HMIPv6 환경하에서 새로운 도메인에 진입한 MN이 MAP 선택시 최상위 MAP을 선택하여 CN과 통신할 경우 최상위 MAP에 부하가 집중되고 MN이 빈번하게 이동하거나 대용량서비스를 이용하게 되면 성능이 저하되고, 반대로 MN이 최하위 MAP을 선택하여 CN과 통신할 경우에는 HA나 CN에 대한 Binding Update 시그널 증가로 성능이 저하된다. 이에 본 논문에서는 MN이 MAP 선택시 Distance, 노드사용율 및 대역폭 사용율을 바탕으로 MAP을 선택하는 적응적 MAP을 선택하는 방안에 대해서 논하고자 한다.