• Journal of the Korean Society of Propulsion Engineers
• /
• v.14 no.3
• /
• pp.16-22
• /
• 2010

The gas turbine engine performance relies greatly on its component performance characteristics. Generally, engine manufacturers do not provide engine purchasers the component performance characteristics which can be obtained by lots of experimental tests at various operating conditions and big amount of expenses. In previous works the component maps have mostly been generated by scaling from a similar component map. However this scaling method has large error at off design points, specially in high altitude operation. Therefore this work proposes an inverse modeling method that can generate components maps of PT6A-67A turboprop engine using performance data provided by the engine manufacturer. In addition, evaluation can be made through comparison between performance analysis results using the performance simulation program including the generated compressor map and performance data.

• Journal of Korean Library and Information Science Society
• /
• v.36 no.4
• /
• pp.77-98
• /
• 2005

The purpose of this research is to propose a powerful alternative in designing knowledge portals using Topic Maps(TM). To demonstrate the power of TM In constructing knowledge portals. we designed a TM-based korean folk music(pansori) site, tested It with an existing pansoree site (pansoree.com ) employing diverse query patterns : simple, advanced, associative, and cross referential Queries. The results show that the TM-based site outperforms the pansoree.com in searching time and steps. The TM-based site also provide novice users who do not know pansori domain with easy access to Information that they need.

• Journal of KIISE:Software and Applications
• /
• v.35 no.8
• /
• pp.522-528
• /
• 2008

Topic map typically provide information to user through the selection of topics, that is using only topic, association, occurrence on the first topicmap which is made by domain expert without regard to individual interests or context, for the purpose of supplementation for the weakness which is providing personalized topic map information, personalization has been studied for supporting user preference through preseting of customize, filtering, scope, etc in topic map. Nevertheless, personalization in current topicmap is not enough to user so far. In this paper, we propose a design of PTRS(personalized topicmap ranking system) & algorithm, using both user profile(click through data) and basic element of topic map(topic, association) on knowledge layer in specific domain topicmap, therefore User has strong point that is improvement of personal facilities to user through representation of ranked topicmap information in consideration of user preference using PTRS.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.7-9
• /
• 2021

본 논문은 Detectron2 [1]에서 지원하는 객체 검출 임무 수행 네트워크의 과정 중에서 추출한 피쳐 맵을 신경망 기반으로 압축하는 방법을 제안한다. 이를 위해, 신경 망 기반 영상 압축을 지원하는 공개 소프트웨어인 CompressAI [2] 모델 중 하나인 bmshj2018-hyperprior 의 압축 네트워크를 활용하여 임무 수행 네트워크의 과정 중 스탬 레이어(stem layer)에서 추출된 피쳐 맵을 압축하도록 학습시켰다. 또한, 압축 네트워크의 입력 피쳐 맵의 너비와 높이 크기가 64 의 배수가 되도록 객체 검출 네트워크의 입력 영상 보간 값을 조정하는 방법도 제안한다. 제안하는 신경망 기반 피쳐 맵 압축 방법은 피쳐 맵을 최근 표준이 완료된 차세대 압축 표준 방법인 VVC(Versatile Video Coding, [3])로 압축한 결과에 비해 큰 성능 향상을 보이고, VCM 앵커와 유사한 성능을 보인다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.1256-1257
• /
• 2022

분할 맵 기반 얼굴 합성 분야의 기존 연구들은 피부 영역을 하나의 라벨로 취급한다. 이는 피부 내 미세한 요소를 표현하지 못하며 고해상도 영상 합성 성능 부족이라는 결과를 초래한다. 본 논문에서는 이러한 문제점을 극복하고자 분할 맵에 주름, 모공, 홍조와 같은 피부 요소를 추가하여 이로부터 얼굴 영상을 합성하는 기법을 제안한다. 기존 분할 맵 기반 영상 합성 연구에 제안하는 기법을 적용하여 정량적 및 정성적 비교를 통해 성능이 개선됨을 보인다.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.524-530
• /
• 2016

The desire to access data faster and the growth of next-generation memories such as non-volatile memories, contribute to the development of research on memory file systems. It is recommended that memory mapped file I/O, which has less overhead than read-write I/O, is utilized in a high-performance memory file system. Memory mapped file I/O, however, brings a page table overhead, which becomes one of the big overheads that needs to be resolved in the entire file I/O performance. We find that same overheads occur unnecessarily, because a page table of a file is removed whenever a file is opened after being closed. To remove the duplicated overhead, we propose the mapping cache, a technique that does not delete a page table of a file but saves the page table to be reused when the mapping of the file is released. We demonstrate that mapping cache improves the performance of traditional file I/O by 2.8x and web server performance by 12%.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.507-512
• /
• 2001

Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.68-79
• /
• 2009

A variance map can be used to detect and distinguish texts from background in images. However, previous variance maps work at one level and they suffer a limitation in dealing with varieties in text size, slant, orientation, translation, and color. We present a method for robustly segmenting text regions in complex color Web images using two-level variance maps. The two-level variance maps work hierarchically. The first level finds the approximate locations of text regions using global horizontal and vertical color variances with the specific mask sizes. The second level then segments each text region using intensity variance with a local mask size, which is determined adaptively. By the second process, backgrounds tend to disappear in each region and segmentation can be accurate. Highly promising experimental results have established the effectiveness of our approach.

• Spatial Information Research
• /
• v.23 no.3
• /
• pp.1-10
• /
• 2015

Due to recent improvement of various sensor technologies, indoor positioning becomes available. However, Indoor positioning technologies by Wi-Fi radio map and acceleration sensor and digital campus still have a certain level of errors and a number of researches have been done to increase the positioning accuracy of the indoor positioning. If we could provide a room level accuracy, indoor location based services with current indoor positioning methods such as Wi-Fi radio map and acceleration sensors would be possible. In this paper, we propose an indoor map matching method to provide a room level accuracy based on hidden markov model.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.933-944
• /
• 2012

In this paper, we propose a new method to convert a low-resolution depth map into its high-resolution one called distance transform-based bilateral upsampling. Since the proposed method controls the spatial domain weighting function based on distance transform values of the depth map, it increases the input depth map resolution while preserving edge sharpness. The proposed method is composed of three main steps: distance transform, spatial weighting control, and image interpolation. Experimental results show that our method outperforms the conventional bilateral upsampling in terms of the quality of output depth maps.