• Title/Summary/Keyword: Paper Map

Search Result 4,973, Processing Time 0.029 seconds

Land Cover Classification Map of Northeast Asia Using GOCI Data

  • Son, Sanghun;Kim, Jinsoo
    • Korean Journal of Remote Sensing
    • /
    • v.35 no.1
    • /
    • pp.83-92
    • /
    • 2019
  • Land cover (LC) is an important factor in socioeconomic and environmental studies. According to various studies, a number of LC maps, including global land cover (GLC) datasets, are made using polar orbit satellite data. Due to the insufficiencies of reference datasets in Northeast Asia, several LC maps display discrepancies in that region. In this paper, we performed a feasibility assessment of LC mapping using Geostationary Ocean Color Imager (GOCI) data over Northeast Asia. To produce the LC map, the GOCI normalized difference vegetation index (NDVI) was used as an input dataset and a level-2 LC map of South Korea was used as a reference dataset to evaluate the LC map. In this paper, 7 LC types(urban, croplands, forest, grasslands, wetlands, barren, and water) were defined to reflect Northeast Asian LC. The LC map was produced via principal component analysis (PCA) with K-means clustering, and a sensitivity analysis was performed. The overall accuracy was calculated to be 77.94%. Furthermore, to assess the accuracy of the LC map not only in South Korea but also in Northeast Asia, 6 GLC datasets (IGBP, UMD, GLC2000, GlobCover2009, MCD12Q1, GlobeLand30) were used as comparison datasets. The accuracy scores for the 6 GLC datasets were calculated to be 59.41%, 56.82%, 60.97%, 51.71%, 70.24%, and 72.80%, respectively. Therefore, the first attempt to produce the LC map using geostationary satellite data is considered to be acceptable.

MAP Load Control and Route Optimization in HMIPv6 (HMIPv6에서의 MAP의 부하 제어 및 경로 최적화)

  • Nam, Sung-Hyun;Lee, Kyung-Geun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.120-127
    • /
    • 2008
  • HMIPv6 draws lots of attentions in recent years for providing an efficient handover and reducing the signaling overhead. HMIPv6 employs MAP(Mobility Anchor Point) in order to minimize a signaling overhead and a local mobility management. MAP completes an efficient mobility management in HMIPv6 network environment with frequent handover. However, HMIPv6 causes load concentration at a paricular MAP and may have unnecessary latency between HN(Mobile Node) and CN(Correspondent Node) within the same network. A MAP may also disturb the route optimization in HMIPv6 network because all packets must be transmitted through a MAP. In this paper, we propose a scheme to optimize the route in HMIPv6 networks according to MAP load. We configure a threshold in order to support the better service into MAP domain. The packets do not pass through MAP and are directly transmitted to AR(Access Router) if the number of current MNs attached to the MAP exceed the desired threshold. We simulate the performance of the proposed scheme and compare with HMIPv6. Resultly, the proposed scheme reduces signaling costs and mitigates concentration of a paticular MAP as well.

A Memory-Efficient Block-wise MAP Decoder Architecture

  • Kim, Sik;Hwang, Sun-Young;Kang, Moon-Jun
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.615-621
    • /
    • 2004
  • Next generation mobile communication system, such as IMT-2000, adopts Turbo codes due to their powerful error correction capability. This paper presents a block-wise maximum a posteriori (MAP) Turbo decoding structure with a low memory requirement. During this research, it has been observed that the training size and block size determine the amount of required memory and bit-error rate (BER) performance of the block-wise MAP decoder, and that comparable BER performance can be obtained with much shorter blocks when the training size is sufficient. Based on this observation, a new decoding structure is proposed and presented in this paper. The proposed block-wise decoder employs a decoding scheme for reducing the memory requirement by setting the training size to be N times the block size. The memory requirement for storing the branch and state metrics can be reduced 30% to 45%, and synthesis results show that the overall memory area can be reduced by 5.27% to 7.29%, when compared to previous MAP decoders. The decoder throughput can be maintained in the proposed scheme without degrading the BER performance.

  • PDF

Efficient Simplification of a Height Map (지형 데이터의 효율적 단순화)

  • Park, Sang-Chul;Kim, Jung-Hoon;Chung, Yong-Ho
    • Korean Journal of Computational Design and Engineering
    • /
    • v.17 no.2
    • /
    • pp.132-139
    • /
    • 2012
  • Presented in the paper is a procedure to extract simplified triangular mesh from a height map (terrain data). The proposed algorithm works directly on a height map that extracts a simplified triangular mesh. For the simplification, the paper employs an iterative method of edge contractions. To determine an edge to be contracted, the contraction cost of an edge is evaluated through the QEM method. Normally, an edge contraction will remove two triangles sharing the edge. Although the edge contraction can be implemented easily on a triangular mesh, it is not viable to implement the operation on a height map due to the irregular topology. To handle the irregular topology during the simplification procedure, a new algorithm is introduced.

A Study on the Map-Building of a Cleaning Robot Base upon the Optimal Cost Function (청소로봇의 최적비용함수를 고려한 지도 작성에 관한 연구)

  • Kang, Jin Gu
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.3
    • /
    • pp.39-45
    • /
    • 2009
  • In this paper we present a cleaning robot system for an autonomous mobile robot. Our robot performs goal reaching tasks into unknown indoor environments by using sensor fusion. The robot's operation objective is to clean floor or any other applicable surface and to build a map of the surrounding environment for some further purpose such as finding the shortest path available. Using its cleaning robot system for an autonomous mobile robot can move in various modes and perform dexterous tasks. Performance of the cleaning robot system is better than a fixed base redundant robot in avoiding singularity and obstacle. Sensor fusion using the clean robot improves the performance of the robot with redundant freedom in workspace and Map-Building. In this paper, Map-building of the cleaning robot has been studied using sensor fusion. A sequence of this alternating task execution scheme enables the clean robot to execute various tasks efficiently. The proposed algorithm is experimentally verified and discussed with a cleaning robot, KCCR.

Position Estimation Using Magnetic Field Map (자기장 지도를 이용한 위치 추정)

  • Kim, Han-Sol;Moon, Woo-Sung;Seo, Woo-Jin;Baek, Kwang-Ryul
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.4
    • /
    • pp.290-298
    • /
    • 2013
  • Geomagnetic is refracted by building's wall and pillar. Therefore refracted geomagnetic is able to be used as feature point. In a specific space, a mobile device that is equipped with magnetic sensor array measures 3-axis magnetic field for each point. Magnetic field map is acquired by collecting the every sample point in the magnetic field. The measured magnetic field must be calibrated, because each magnetic sensor has a distortion. For this reason, sensor distortion model and sensor calibration method are proposed in this paper. Magnetic field that is measured by mobile device matches magnetic field map. Result of the matching is used for position estimation. This paper implements hardware system for position estimation method using magnetic field map.

COMMON FIXED POINTS OF A LIMIT WEAK COMPATIBLE PAIR OF A MULTIVALUED MAPPING AND A SINGLE VALUED MAPPING IN D-METRIC SPACES

  • Singh, Bijendra;Jain, Shobha;jain, Shishir
    • East Asian mathematical journal
    • /
    • v.22 no.1
    • /
    • pp.35-51
    • /
    • 2006
  • This paper deals with a general contraction. Two fixed-point theorems for a limit weak-compatible pair of a multi-valued map and a self map on a D-metric space have been established. These results improve significantly, the main results of Dhage, Jennifer and Kang [5] by reducing its assumption and generalizing its contraction simultaneously. At the same time some results of Singh, Jain and Jain [12] are generalized from a self map to a pair of a set-valued and a self map. Theorems of Veerapandi and Rao [16] get generalized and improved by these results. All the results of this paper are new.

  • PDF

Development of Carbon Emission Casual Map Considering Variable Factors in Steel Erection Work (가변요인을 고려한 철골세우기 작업의 탄소배출 인과지도 개발)

  • Nam, Chulu;Lee, Dongyoun;Cho, Hunhee;Kang, Kyung-In
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2016.10a
    • /
    • pp.75-76
    • /
    • 2016
  • Because of variable factors in construction phase, measurement of carbon emission in construction industry is more difficult than in other industries. To enhance accuracy of the measurement, the impact of variable factors must be considered. In this paper, to understand the influence of variable factors in steel erection work, a carbon emission casual map was developed. The map demonstrates that the considerations of variable factors in measurement of carbon emission improves the accuracy. The results of this paper are expected to contribute to development of carbon emission casual map and carbon emission measurement model for the entire construction phase.

  • PDF

Digital Map Watermarking Using sakamoto algorithm (사카모토의 방법을 이용한 수치지도 워터마킹)

  • Park, Kyi-Tae;Kim, Kab-Il;Kang, Hwan-Il;Han, Seung-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2002.07d
    • /
    • pp.2797-2799
    • /
    • 2002
  • In this paper, the algorithm is suggested for inserting and extracting the watermark in the digital map of vector form. This kind of algorithm was first anounced by the sakamoto[1]. In order to use watermarking in the digital map, the map is analyzed and experimented to protect the map data. As for the vector watermarking, there are few references and need more research for the theoretical back ground. As for this, in this paper, experiment of the immunity against the noise is conducted for the selection of the proper immunity factor.

  • PDF

Probabilistic Map Building Using Ultrasonic Sensor for Autonomous Mobile Robot (초음파 센서를 이용한 자율이동로봇의 확률지도 작성)

  • Lee, Sang-Soo;Oh, Joon-Seop;Choi, Yoon-Ho;Park, Jin-Bae
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2840-2842
    • /
    • 2000
  • This paper describes sensor-based occupancy grid map construction method through complete coverage navigation algorithm in unknown environment. In this paper, we use the updated Baysian model for probabilistic grid map. For map construction, complete coverage navigation method in which mobile robot can navigate complete field through as short path as possible in unknown environment, is used. The computer simulations result show that map construction method using complete coverage algorithm is efficient.

  • PDF