• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.93-106
• /
• 2005

Recently, the web map services with standard interfaces have been developed to a high degree for the purpose of sharing of spatial data through the web. Among the various kinds of works related, the specification for the web map service released by Open Geospatial Consortium (OGC) is the most prominent, and is nearly adopted as international standard (ISO/DIS 19128) in developing the web map servers. The web map server of OGC, however, provides the insufficient capabilities for mobile applications. Unlike the wired applications, the mobile applications would require the map server to minimize of size of data transferred, because the size of data is very important factor in communication cost and the response time of map clients. And the mobile applications require different quality of map according to the screen size of mobile devices. The mobile application, also require some application specific queries. In this paper, We have Proposed the interfaces for mobile web map services (M-WMS) which fully comply with the standard interfaces proposed in OGC. And we have designed and implemented the web map server for mobile map services. This paper has contributed to construction and practical use of the web map servers in mobile applications, such as LBS and telematics.

• Electronics and Telecommunications Trends
• /
• v.32 no.4
• /
• pp.40-47
• /
• 2017

자율주행 맵은 도로의 주행환경 정보(차로, 도로 마크, 신호등의 위치 등)와 시간에 따라 변화하는 동적 주행환경 정보(장애물 출현, 일시적인 통행제한, 긴급한 도로 복구, 교차로 교통혼잡 등)로 구성된다. 자율주행 맵 생성 및 갱신 기술은 차로 구분선이나, 도로 교통과 관련된 실시간 갱신 주기 측면에서 더욱 세밀하고, 정확한 위치 정보가 요구되며, 또한, 최신성을 유지하는 기능을 가진다. 이러한 고정밀 지도의 세밀함과 정확성, 최신성은 자율주행 서비스를 위해 요구되는 필수적인 요소이다. 클라우드와 연계하여 생성되는 자율주행 맵은 차량 운행 시 수집되는 정보를 클라우드에 축적하여 가공함으로써, 시간과 인력 투입을 통해 데이터를 취득하고 지도를 구축하는 면에서 작업 품을 효과적으로 개선하는 데 도움이 된다. 유지와 보수 측면에서는 정기적으로 또는 신속하게 갱신하여 최신의 정보를 유지하는 장점이 있다. 본고에서는 자율주행 맵을 생성하고 갱신하는 클라우드 연계 플랫폼과 연구 결과 일부를 소개한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.8
• /
• pp.536-546
• /
• 2006

Painterly animation is a method that expresses painterly images with a hand-painted appearance from a video, and the most crucial element for it is the temporal coherence of brush strokes between frames. A motion map is proposed in this paper as a solution to the issue of maintaining the temporal coherence in the brush strokes between the frames. A motion map is the region that frame-to-frame motions have occurred. Namely, this map refers to the region frame-to-frame edges move by the motion information with the motion occurred edges as a starting point. In this paper, we employ the optical flow method and block-based method to estimate the motion information. The method that yielded the biggest PSNR using the motion information (the directions and magnitudes) acquired by various methods of motion estimation has been chosen as the final motion information to form a motion map. The created motion map determine the part of the frame that should be re-painted. In order to express painterly images with a hand- painted appearance and maintain the temporal coherence of brush strokes, the motion information was applied to only the strong edges that determine the directions of the brush strokes. Also, this paper seek to reduce the flickering phenomenon between the frames by using the multiple exposure method and the difference map created by the difference between images of the source and the canvas. Maintenance of the coherence in the direction of the brush strokes was also attempted by a local gradient interpolation to maintain the structural coherence.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.515-522
• /
• 2001

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 Map(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. 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. We implemented about k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.593-602
• /
• 2005

Need for machine-understandable web (Semantic web) is increasing in order for users to exactly understand Web information resources and currently there are two main approaches to solve the problem. One is the Topic map developed by the ISO/IEC JTC 1 and the other is the RDF (Resource Description Framework), one of W3C standards. Semantic web supports all of the metadata of the Web information resources, thus the necessity of interoperability between the Topic map and the RDF is required. To address this issue, several conversion methods have been proposed. However, these methods have some problems such as loss of meanings, complicated structure, unnecessary nodes, etc. In this paper, a new method is proposed to resolve some parts of those problems. The method proposed is called NOWL (NO structural Warp and semantics Loss). NOWL method gives several contributions such as maintenance of the original a Topic map instance structure and elimination of the unnecessary nodes compared with the previous researches.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.6
• /
• pp.86-96
• /
• 2010

In this paper, we propose stereo vision-based obstacle detection and vehicle verification methods using U-disparity map and bird's-eye view mapping. First, we extract a road feature using maximum frequent values in each row and column. And we extract obstacle areas on the road using the extracted road feature. To extract obstacle areas exactly we utilize U-disparity map. We can extract obstacle areas exactly on the U-disparity map using threshold value which consists of disparity value and camera parameter. But there are still multiple obstacles in the extracted obstacle areas. Thus, we perform another processing, namely segmentation. We convert the extracted obstacle areas into a bird's-eye view using camera modeling and parameters. We can segment obstacle areas on the bird's-eye view robustly because obstacles are represented on it according to ranges. Finally, we verify the obstacles whether those are vehicles or not using various vehicle features, namely road contacting, constant horizontal length, aspect ratio and texture information. We conduct experiments to prove the performance of our proposed algorithms in real traffic situations.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.01a
• /
• pp.365-368
• /
• 2023

본 논문에서는 타블렛을 이용해 사용자로부터 주름 스케치를 입력받아 피부 패턴을 고려한 사실적인 얼굴 주름을 생성 할 수 있는 인터페이스를 제안한다. 주름을 생성하고 싶은 모델의 normal map에 간단한 스케치를 하면 해당 모델의 피부 패턴을 고려해 스케치를 주름으로 생성해준다. 또한, 얼굴 부위별 주름 형태를 분석하여 부위별 생성되는 주름의 형태가 다르고, 나이 설정을 통해 나이에 맞는 잔주름 및 주름 형태를 변형 한다. 본 논문에서 제안하는 방법을 이용한 주름 생성 방식은 주름에 대한 자세한 지식이 없는 사용자라도 간단한 스케치만 한다면 자동 계산을 통해 실시간으로 주름을 생성해주며, 얼굴 패턴에 따른 사실적인 주름이 생성되는 결과를 보여준다.

• Journal of Practical Engineering Education
• /
• v.15 no.2
• /
• pp.509-517
• /
• 2023

The reactive web service provides a related word recommendation system using the TextRank algorithm and a word-based idea generation service selected by the user. In the related word recommendation system, the method of weighting each word using the TextRank algorithm and the probability output method using SoftMax are discussed. The idea generation service discusses the idea generation method and the artificial intelligence reinforce-learning method using mini-GPT. The reactive web discusses the linkage process between React, Spring Boot, and Flask, and describes the overall operation method. When the user enters the desired topic, it provides the associated word. The user constructs a mind map by selecting a related word or adding a desired word. When a user selects a word to combine from a constructed mind-map, it provides newly generated ideas and related patents. This web service can share generated ideas with other users, and improves artificial intelligence by receiving user feedback as a horoscope.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1307-1312
• /
• 2023

In this paper, we propose a hybrid camera system that combines cameras with different focal lengths and LiDAR (Light Detection and Ranging) sensors to address the core components of autonomous driving perception technology, which include object recognition and distance measurement. We extract objects within the scene and generate precise location and distance information for these objects using the proposed hybrid camera system. Initially, we employ the YOLO7 algorithm, widely utilized in the field of autonomous driving due to its advantages of fast computation, high accuracy, and real-time processing, for object recognition within the scene. Subsequently, we use multi-focal cameras to create depth maps to generate object positions and distance information. To enhance distance accuracy, we integrate the 3D distance information obtained from LiDAR sensors with the generated depth maps. In this paper, we introduce not only an autonomous vehicle platform capable of more accurately perceiving its surroundings during operation based on the proposed hybrid camera system, but also provide precise 3D spatial location and distance information. We anticipate that this will improve the safety and efficiency of autonomous vehicles.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.181-183
• /
• 2004

기존의 연관규칙을 생성하는 알고리즘의 문제점을 개선하기 위해 본 논문에서는 XML 문서 클러스터링을 이용하였다. XML 문서 클러스터링을 이용하여 데이터베이스 탐색 횟수 일 조인 개수를 줄여서 수행 속도를 향상시키고, 또한 클러스터링을 통해 얻은 클러스터에서 규칙을 찾기 때문에 기존의 연관규칙 생성 방법에서는 찾지 못했던 규칙들도 찾아낼 수 있다 본 논문에서 사용하는 클러스터링 방법은 XML문서 검색을 위한 3차원 비트맵 인덱싱인 xPlaneb를 사용하여 구현하였다.