• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.899-902
• /
• 2003

무선 환경에서의 실시간 서비스의 확대와 노드의 이동성 증가에 따라 handover 시 발생되는 패킷 손실과 지연으로 인한 실시간 서비스의 중단이 해결해야 할 중요한 문제점이 되고 있다. 본 논문에서는 IETF (Internet Engineering Task Force)의 중요한 마이크로 이동성 프로토콜인 HMIPv6의 기본 동작을 설명하고, 여전히 문제점으로 남아있는 Inter-MAP (Mobility Anchor Point) handover의 성능을 향상시키기 위한 Dynamic MAP Switching handover 알고리듬을 제안한다. 제안한 알고리듬은 인접한 MAP 도메인을 중첩되게 설정하고 Inter-MAP handover가 발생되기 전에 미리 MAP을 switching한다. 따라서 Inter-MAP handover가 발생하지 않도록 함으로써 handover 시 발생하는 데이터의 손실 및 지연을 감소시킬 수 있다. 제안된 알고리듬의 성능 향상은 산술적 분석을 통하여 검증한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.533-536
• /
• 2005

MAP algorithm is known for optimal decoding algorithm of Turbo codes, but it has very large computational complexity and delay. Generally log-MAP algorithm is used in order to overcome the defect. In this paper we propose modified scheme of the state metric calculation block which can improve the computation speed in log-MAP decoder and simple linear offset unit without using LUT. The simulation results show that the operation speed of the proposed scheme is improved as compared with that of the past scheme.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.2
• /
• pp.61-72
• /
• 2020

Recently, researches that are using deep learning technology in various fields are being conducted. The fields include geographic map processing. In this paper, I propose a method to infer where the map area included in the image is. The proposed method generates and learns images including a map, detects map areas from input images, extracts character strings belonging to those map areas, and converts the extracted character strings into coordinates through geocoding to infer the coordinates of the input image. Faster R-CNN was used for learning and map detection. In the experiment, the difference between the center coordinate of the map on the test image and the center coordinate of the detected map is calculated. The median value of the results of the experiment is 0.00158 for longitude and 0.00090 for latitude. In terms of distance, the difference is 141m in the east-west direction and 100m in the north-south direction.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2005.10a
• /
• pp.94-95
• /
• 2005

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.97-110
• /
• 2005

Recently, many WMS(Web Map Services) and POI(Point of Interest) services come to be in service on the Internet using Web GIS(Geographic Information System) as Information Technology and computer H/W are evolved faster in its speed, network bandwidth and features. The Web GIS is, however, limited and constrained on the specification of its system configuration, the service class provided and the presentation methodology of a map. As the mobile Internet becomes popular in mobile service, Web GIS service on mobile environment is strongly required and to be provided by location based WMS(Web Map Service) on a mobile client such as PDA with location information of the user. In this paper, we made an effort to design and implement a GIS computing environment by thin client for mobile web map service. For implementing the thin client GIS computing environment. we were using NGII's(National Geographic Information Institute's) DXF map, representing the map by SVG(Scalable Vector Graphics) recommended by OGC(OpenGis Consortium), and adapting standard XML web service to provide the thin client GIS service on PDA by applying the location information of the user in realtime with GPS on mobile environment.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.207-215
• /
• 2009

Recently, the research of the analysis of the crime spatial is increased by using the computer information technology and GIS (Geometric Information System) in order to prevent the urban crime so as to increase the urbanization rate. In this paper, a probability map formed by the raster is organized by the quantification of crime risk per the cell using the region property of the urban spatial information in the static environment. Also, a map of the risk probability is constructed based on the relative risk by the region property, the relative risk by the facility, the relative risk by the woody plant and the river, and so on. And, this integrated risk probability map is calculated by averaging the individual cell risk applied to the climatic influence and the seasonal factor. And, a probability map of the overall risk is generated by the interpretation key of the crime occurrence relative risk index, and so, this information is applied to the probability map quantifying the occurrence crime pattern. And so, in this paper, a methodology of the modeling and the simulation that this crime risk probability map is modified according to the passage of time are proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.991-1000
• /
• 2010

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.

• Journal of Advanced Navigation Technology
• /
• v.13 no.1
• /
• pp.142-150
• /
• 2009

It is very important to generate a simplified model from a complex 3D character in computer game. We propose a new method of extracting feature lines from a 3D game character. Given an unstructured 3D character model containing texture information, we use model feature map (MFM), which is a 2D map that abstracts the variation of texture and curvature in the 3D character model. The MFM is created from both a texture map and a curvature map, which are produced separately by edge-detection to locate line features. The MFM can be edited interactively using standard image-processing tools. We demonstrate the technique on several data sets, including, but not limited to facial character.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.391-396
• /
• 2003

The digital map expresses natural topography and artificial things with 3D position coordinates in the computer such as the road, railway, building, river, mountain, paddy and dryland. Therefore, those should contribute to the information-oriented society by maintaining information and providing it to users quickly. However it is difficult to maintain the most recent topographic information all the time because of restricted budget and time. The purpose of this study is to investigate and analyze the updating area of the digital map using remotely sensed data, and to furnish the useful information reducing cost and time. To predict updating area of the digital map, we applied the urban changes analysis method to Landsat TM images from produced date of the digital map to up-to-date. Classification method for urban change analysis applied single band process algorithm. This study presents that updating area of the digital map is predicted by only the rate of 40% on total research area.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.275-276
• /
• 2008

IEEE802.16e-based OFDMA system called WiBro is being serviced commercially. In WiBro system, the base station sends downlink(DL)-MAP information to all mobile stations in each cell. The DL-MAP information is repeated six times, modulated by QPSK, and coded by Convolutional Turbo Coding(CTC) with 1/2 code rate [1],[2]. As the number of mobile stations increases, the DL-MAP size also increases. In this paper, We investigate methods of power allocation and interference cancelation to reduce overhead of the DL-MAP.