• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.9
• /
• pp.377-384
• /
• 2015

In this paper we propose a visualization tool for distortion-free time-series matching. Supporting distortion-free is a very important factor in time-series matching to get more accurate matching results. In this paper, we visualize the result of time-series matching, which removes various time-series distortions such as noise, offset translation, amplitude scaling, and linear trend by using moving average, normalization, linear detrending transformations, respectively. The proposed visualization tool works as a client-server model. The client sends a user-selected time-series, of which distortions are removed, to the server and visualizes the matching results. The server efficiently performs the distortion-free time-series matching on the multi-dimensional R*-tree index. By visualizing the matching result as five different charts, we can more easily and more intuitively understand the matching result.

• Journal of Internet Computing and Services
• /
• v.20 no.5
• /
• pp.37-47
• /
• 2019

The purpose of this paper is to construct a system that matches the patient's image disease information with the medical image viewer in providing the medical image information to the medical staff. Currently, medical image information systems that are commercialized mostly provide only one image viewer with various image information of diseases or use incompatible exclusive viewers. For this reason, we designed and implemented a medical image information viewer matching system that integrates and provides specialized viewers that can be selected by diseases' image information. That is, it is a system to match and view medical image viewers based on disease information extracted from tag information stored as the metadata in DICOM file, which is medical image information standard, for disease-specific viewer matching. We analyzed the execution performances through our retrieval service of medical image information from our implementation system, and showed compatibility and control with various viewers.

• Spatial Information Research
• /
• v.23 no.4
• /
• pp.47-56
• /
• 2015

Recently, there has been an increase in the number of people who use the smart-phone navigation for using various latest functions such as group driving and location sharing. But smart-phone has a limited storage space for one application, since a lot of applications with different purposes are installed in the smart-phone. For this reason, road network data with a large space of memory used for map matching in the device for navigation cannot be stored in the smart-phone for this reason map matching is impossible. Besides, smart-phone which doesn't use the external GPS device, provides inaccurate GPS information, compared to the device for navigation. This is why the smart-phone navigation is hard to provide accurate location determination. Therefore, this study aims to help map matching that is more accurate than the existing device for navigation, by reducing the capacity of road network data used in the device for navigation through format design of a new road network and conversion and using a database of driver's driving patterns. In conclusion, more accurate map matching was possible in the smart-phone by using a storage space more than 80% less than existing device at the intersection where many roads cross, the building forest that a lot of GPS errors occur, the narrow roads close to the highway. It is considered that more accurate location-based service would be available not only in the navigation but also in various applications using GPS information and map in the future Navigation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.122-124
• /
• 2012

정보의 상호운용성 확보를 위해서 여러 형태로 정의되어 있는 스키마들을 매칭하는 것은 반드시 필요한 작업이다. 워드넷은 영어의 의미 어휘목록으로 유의어 집단과 어휘 목록사이의 다양한 의미관계를 기록하여 자동화된 본문 분석과 인공지능 응용에 활용할 수 있다. 본 논문에서는 워드넷을 이용하여 스키마 엘리먼트 이름의 의미 집합을 추출하고 대응하는 엘리먼트 의미 집합과의 유사도를 측정함으로써 스키마 엘리먼트를 매칭하는 시스템을 제안한다. 본 시스템은 다중매칭된 복잡한 관계를 간단한 방법으로 단일매칭화함으로써 사용자가 직관적이고 용이하게 사용할 수 있다. 이를 통하여 데이터 통합, 변환, 분산 검색 등 정보의 상호운용이 필요한 다양한 분야에서 활용될 수 있을 것으로 기대한다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.4
• /
• pp.115-123
• /
• 2016

The road name address system has been in effect in Korea since 2012. However, the existing address system is still being used in many fields because of the difference between the spatial awareness of people and the road name address system. For the spatial awareness based on the road name address system, various spatial datasets in daily life should be referenced by the road names. The goal of this paper is to link the road name address system with the wayfinding process, which is closely related to the spatial awareness. To achieve our goal, we designed and implemented a geometric matching method for spatial data sets. This method generates network neighborhoods from road objects in the 'road name address map' and the 'pedestrian network data'. Then it computes the geometric similarities between the neighborhoods to identify corresponding road name for each object in the network data. The performance by F0.5 was assessed at 0.936 and it was improved to 0.978 by the manual check for 10% of the test data selected by the similarity. By help of our method, the road name address system can be utilized in the wayfinding services, and further in the spatial awareness of people.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.145-148
• /
• 2007

생명과학분야에서 마이크로어레이 기술은 세포에서의 RNA 발현 프로파일을 관찰할 수 있도록 함으로써 생명현상의 규명 및 약물개발 둥에서 분자수준의 생명현상에 대한 관찰과 분석이 가능 해지고 있다. 마이크로어레이 데이터분석에서는 특정한 처리나 과정에서 현저한 특성을 보이는 유전자를 식별하기 위한 분석뿐만 아니라 유전자 전체인 게놈수준에서의 분석도 이루어진다. 최근 유전자의 발현이 다양한 조절, 신호전달 및 대사경로에 의해서 영향을 받고 있다는 관점에서 게놈수준의 분석에 관심이 증가하고 있다. 약물반응 실험에서는 약물에 대한 게놈수준의 발현 프로파일을 관찰하는 것도 많은 정보를 제공할 수 있다. 약물실험에서는 대조군과 실험군들간에 관심 있는 상대적인 발현특성을 갖는 유전자군을 전체적으로 추출하는 것이 필요한 경우가 있다. 예를 들면 정상군은 두개의 실험군에 대해서 중간청도의 발현정도를 갖는 유전자군을 식별하는 분석을 하는 경우, 생물학적인 데이터의 특성상 절대값을 비교하는 방법으로는 유용한 유전자들을 효과적으로 식별해 낼 수 없다. 이 논문에서는 정상군과 실험군들의 발현정도값의 경향을 판단하기 위해서 각 유전자에 대해서 집단별 대표값을 선정하여 퍼지집합으로 집단의 값의 범위를 결정하고, 이를 이용하여 특정 패턴을 갖는 유전자들을 식별해내는 방법을 제안하고, 실제 데이터를 통해서 실험한 결과를 보인다.

• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.89-99
• /
• 2011

The payload signature-based traffic classification system has to deal with large amount of traffic data, as the number of internet-based applications and network traffic continue to grow. While a number of pattern-matching algorithms have been proposed to improve processing speedin the literature, the performance of pattern matching algorithms is restrictive and depends on the features of its input data. In this paper, we studied how to optimize the search space in order to improve the processing speed of the payload signature-based traffic classification system. Also, the feasibility of our design choices was proved via experimental evaluation on our campus traffic trace.

• The Journal of the Acoustical Society of Korea
• /
• v.12 no.4
• /
• pp.47-56
• /
• 1993

본 논문은 다구간 등분할법과 퍼지추론으로 단어인식을 행하는 패턴매칭법을 제안한다. 패턴매칭시 발생되는 시간변동은 발성순서에 따라 등간격으로 다구간 분할함으로써 해결하고, 주파수변동은 구간의 차수별로 정해진 퍼지관계로부터 패턴간의 퍼지추론이 행해짐으로써 흡수한다. 추론에 사용된 삼각형 맴버쉽 함수의 중심값과 변동폭은 패턴의 평균값과 분산값으로 대응되도록 작성한다. 20대 남성 2인이 발성한 데이터를 사용하여, 제안된 방법으로 DDD지역명 28개를 구간수와 변동폭을 달리하여 인식실험한 결과, 8구간과 4배의 변동폭을 가질 때 92%의 인식을 얻었다.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.181-192
• /
• 2011

Information superiority is an essential factor in modern warfare and it can be archived by efficient information exchange between systems. Various computing systems are installed on the today's navy vessels. However, it is hard to improve interoperability and efficiency of information exchange since the configurations of installed systems are varying. The military standard and commercial standard are mix-used between systems. In this paper, we propose an information exchange architecture based on Pub/Sub model as a communication middleware to improve interoperability as well as enhancing scalability. We also propose a novel tree matching algorithm to improve a performance of PubSub broker. In the proposed algorithm, each tree nodes have information about predicates of subscription that can reduce event matching time. The performance evaluation results show our proposed algorithm reduces time for matching predicates compare with other algorithms.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.653-662
• /
• 2002

Fingerprint recognition is a task to find a matching pattern in a database for a specific persons fingerprint. To accomplish this task, preprocessing, classification, and matching steps are taken for a large-scale fingerprint database but only the matching step is taken without classification for a small-scale database. The primary matching method is based on minutiae (ridge ending point, bifurcation). This matching method, however, requires a very complex computation to extract minutiae and match minutiae-to-minutiae accurately due to translation, rotation, nonlinear deformation of fingerprint and occurrence of spurious minutiae. In addition, this method requires a laborious preprocessing step in order to improve the quality of fingerprint Images. This paper proposes a new simple method to eliminate these problems. With this method, Gabor variance is used instead of minutiae for fingerprint recognition. The Gabor variance is computed from Gabor features that result from filtering a fingerprint image through Gabor filter. In this paper, this method is described and its test result is shown, demonstrating the potential of using this new method for fingerprint recognition.