• Journal of Korean Society for Quality Management
• /
• v.33 no.4
• /
• pp.55-74
• /
• 2005

This study tries to examine the competitive strategy of service quality in Korean financial market. the purpose of this study is to find out the strategic implication of Korean commercial banks throughout the service level of experienced customers and the services positioning map. Especially, taking the advantage of a customer's service perception and request attributes make the service positioning map The findings from this research are as follows; the characteristic of each customer is derived from income and investment. and the service positioning map is derived from the characteristic of each customer.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.3 s.180
• /
• pp.94-101
• /
• 2006

A global path planning method using self-organizing feature map which is a method among a number of neural network is presented. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector On the other hand, the modified method in this research uses a predetermined initial weight vectors of 1-dimensional string and 2-dimensional mesh, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1855-1862
• /
• 2010

In virtual reality, there are increasing qualitative development in service technologies for realtime interaction system development, 3- dimensional contents, 3D TV and augment reality services. These services experience difficulties to generate depth value that is essential to recover 3D space to form solidity on existing contents. Hence, research for the generation of effective depth-map using 2D is necessary. This thesis will describe a shortcoming of an existing depth-map generation for the recovery of 3D space using 2D image and will propose an enhanced depth-map generation algorithm that complements a shortcoming of existing algorithms and utilizes the definition of depth direction based on the vanishing point within image.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.793-806
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data. and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• 한국신재생에너지학회:학술대회논문집
• /
• 2009.06a
• /
• pp.458-459
• /
• 2009

This global case study pursues diversification and intensification for an application system of the national wind map which has been developed to support national strategy building and promotion of wind energy dissemination. We chose nine counties' national wind maps and compared their map area, extraction height, temporal and spatial resolution, download services, etc. to derive a best practice for the Korea wind map application system. Therefore, the application system are designed to offer high resolution height information of which covers wind turbine rotor sweeping area and time-series dataset which can be downloaded for further analysis by users. It is anticipated that the system would contribute greatly to wind energy policy, business and research sectors once the derived ideas have been implemented to the application system

• Proceedings of the Korean DIstribution Association Conference
• /
• 2003.05a
• /
• pp.55-70
• /
• 2003

The most transport companies are placing increasing emphasis on powerful new techniques for planning their vehicle operations. They have tried to improve their vehicle control and customer service capability by adopting tile advanced information technology, such as GPS(Global Position System) and Using Digital Map. But researches on the VRSP(vehicle routing St schedule problem) in this situation were very few. The purpose of this research is to develop vehicle scheduling heuristics for making a real-time dynamic VRSP under the situation that GPS and using Digital Map are equipped to the transport company. Modified savings techniques are suggested for the heuristic method and an insertion technique is suggested for the dynamic VRSP. The urgent vehicle schedule is based on the regular vehicle schedule. This study suggest on VRSP system using GPS and Digital Map and the performance of the suggested heuristics is illustrated through an real case example.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.12
• /
• pp.1246-1253
• /
• 2009

To be high efficient for a navigation of unmanned ground vehicle, it must be able to distinguish between safe and hazardous regions in its immediate environment. We present an advanced method using laser range finder for building global 2D digital maps that include environment information. Laser range finder is used for mapping of obstacles and driving environment in the 2D laser plane. Rotary encoders are used for localization of UGV. The main contributions of this research are the development of an algorithm for global 2D map building and it will turn a UGV navigation based on map matching into a possibility. In this paper, a map building algorithm will be introduced and an assessment of algorithm reliability is judged at an each environment.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.207-218
• /
• 1994

To activate the use of GIS, it is required to support a reliable digi-tal map. A digital map could be the base for other forms of maps as well as for direct applications, In this paper, the structure of such a basic map is pro¬posed. The structure is designed on the consideration of generality and classifica¬tion. The map data files are all character files and classification codes are pro¬posed.

• Journal of Plant Biotechnology
• /
• v.4 no.2
• /
• pp.45-52
• /
• 2002

A lot of SSRs (simple sequence repeats) in peach and pear from enriched genomic libraries and in peach from a cDNA library were developed. These SSRs were applied to other related species, giving phenograms of 52 Prunes and 60 pear accessions. Apple SSRs could also be successfully used in Pyrus spp. Thirteen morphological traits were characterized on the basis of the linkage map obtained from an $F_2$ population of peach. This map was compiled with those morphological markers and 83 DNA markers, including SSR markers used as anchor loci, to compare different peach maps. Molecular markers tightly linked to new root-knot nematode resistance genes were also found. A linkage map including disease related genes, pear scab resistance and black spot susceptibility, in the Japanese pear Kinchaku were constructed using 118 RAPD markers. Another linkage map, of the European pear Bartlett, was also constructed with 226 markers, including 49 SSRs from pear, apple, peach and cherry. Maps of other Japanese pear cultivars, i.e., Kousui and Housui, were also constructed. These maps were the first results of pear species.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.44-46
• /
• 2012

Depth map를 구하는 방법 중 많이 사용되어지는 방법으로 stripe 패턴을 이용하는 방법이 존재한다. 이 방법은 Pro-Cam 시스템을 이용하며 프로젝터로 조사한 패턴을 카메라로 촬영하여 원래의 패턴과 촬영된 패턴간의 기하학적인 관계를 구하여 depth map를 구하는 방법이다. 본 논문에서는 이와 같이 구조광을 이용하여 depth map 획득 시스템을 효과적으로 multi-thread를 사용하여 실시간 처리하는 것을 제안한다. 일반적으로 자주 사용되는 multi-threading 기법에는 CPU의 thread를 이용하는 OpenMP와 GPU의 thread를 이용하는 CUDA가 있다. 이 두 가지 기법은 수행하는데 차이점이 존재하기 때문에 상황에 따라 OpenMP가 더 좋은 효율을 보이는 부분이 있고 CUDA가 더 좋은 효율을 보이는 부분이 있다. 때문에 우리는 이 두 가지에 대해서 각 부분의 특성에 맞게 더 좋은 효율을 보이는 multi-thread를 이용하였다. 결과적으로 우리는 $1280{\times}800$의 영상에 대해 25fps 이상의 depth map를 획득하였다.