• Journal of KIISE
• /
• v.41 no.11
• /
• pp.943-957
• /
• 2014

Removing noise, called denoising, is an essential factor for the more intuitive and more accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of partial noise embedded in boundary images. To solve this problem, we first define partial denoising time-series which can be generated from an original image time-series by removing a variety of partial noises and propose an efficient mechanism that quickly obtains those partial denoising time-series in the time-series domain rather than the image domain. We next present the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and we use this partial denoising distance as a similarity measure in boundary image matching. Using the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. To solve this problem, we derive a tight lower bound for the partial denoising distance and formally prove its correctness. We also propose range and k-NN search algorithms exploiting the partial denoising distance in boundary image matching. Through extensive experiments, we finally show that our lower bound-based approach improves search performance by up to an order of magnitude in partial denoising-based boundary image matching.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.5
• /
• pp.35-40
• /
• 2019

In this paper, we design and implement a partial denoising boundary matching system using indexing techniques. Converting boundary images to time-series makes it feasible to perform a fast search using indexes even on a very large image database. Thus, using this converting method we develop a client-server system based on the previous partial denoising research in the GUI(graphical user interface) environment. The client first converts a query image given by a user to a time-series and sends denoising parameters and the tolerance with this time-series to the server. The server identifies similar images from the index by evaluating a range query, which is constructed using inputs given from the client and sends the resulting images to the client. Experimental results show that our system provides many intuitive and accurate matching results.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.51-63
• /
• 2008

Jeju-Mainland demand for air passenger is variated by the season because most of the demands stem from the leisure travel. This research is to estimate the econometrics demand models(A simple time series model and the partial adjustment model) and elasticities of each models for the Jeju-Mainland domestic routes air travel market using the time series aggregate data between the year 1996 and 2005. As the result of estimating, income elasticity was evaluated to be elastic(1.55) and fare elasticity was inelastic(-0.49${\sim}$-0.59) for A simple time series models. In the partial adjustment model's case, income elasticity was evaluated to be inelastic(0.51) in short-run whereas it was evaluated to be elastic(1.88) in long-run. Fare elasticity was evaluated to be inelastic in short-run(high-demand season: -0.13, slack season: -0.20) and long-run(high-demand season: -0.48, slack season: -0.72).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.11
• /
• pp.1343-1350
• /
• 2019

Converting boundary images to time-series makes it feasible to perform boundary matching even on a very large image database, which is very important for interactive and fast matching. In recent research, there has been an attempt to perform fast matching considering partial denoising by converting the boundary image into time series. In this paper, to improve performance, we propose an index-building method considering all possible arbitrary denoising parameters for removing arbitrary partial noises. This is a challenging problem since the partial denoising boundary matching must be considered for all possible denoising parameters. We propose an efficient single index-building algorithm by constructing a minimum bounding rectangle(MBR) according to all possible denoising parameters. The results of extensive experiments conducted show that our index-based matching method improves the search performance up to 46.6 ~ 4023.6 times.

• The Korean Journal of Applied Statistics
• /
• v.23 no.5
• /
• pp.813-822
• /
• 2010

We investigate a possible achievement in dimension reduction of time series via partially quantified principal component. Partial quantification technique allows us in modeling to accommodate artificial variable(s) of practical importance which is defined subjectively by the data analyst. Suggested procedures are described and in turn illustrated in detail by analyzing monthly unemployment rates in Korea.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.91-99
• /
• 2019

In this paper, we propose partial denoising boundary matching based on an index for faster matching in very large image databases. Attempts have recently been made to convert boundary images to time-series with the objective of solving the partial denoising problem in boundary matching. In this paper, we deal with the disk I/O overhead problem of boundary matching to support partial denoising in a large image database. Although the solution to the problem superficially appears trivial as it only applies indexing techniques to boundary matching, it is not trivial since multiple indexes are required for every possible denoising parameters. Our solution is an efficient index-based approach to partial denoising using $R^*-tree$ in boundary matching. The results of experiments conducted show that our index-based matching methods improve search performance by orders of magnitude.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.6
• /
• pp.167-174
• /
• 1998

The ultrasonic test is recognized for its significance as a non-destructive testing method to detect volume defects such as porosity and incomplete penetration which reduce strength in the weld zone. This paper illustrates the defect detection in the weld zone of ferritic carbon steel using ultrasonic wave and the evaluation of pattern recognition by chaotic feature extraction using time series signal of detected defects as data. Shown in the time series data were that the time delay was 4 and the embedding dimension was 6 which indicate the geometric dimension of the subject system and the extent of information correlation. Based on fractal dimension and lyapunov exponent in quantitative chaotic feature extraction, feature value of 2.15, 0.47 is presented for porosity and 2.24, 0.51 for incomplete penetration The precision rate of the pattern recognition is enhanced with these values on the total waveform of defect signal in the weld zone. Therefore, we think that the ultrasonic pattern recognition method of weld zone defects of ferritic carbon steel by ultrasonic-chaotic feature extraction proposed in this paper can boost precision rate further than the existing method applying only partial waveform.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.01a
• /
• pp.45-48
• /
• 2022

IoT 기술의 발전 및 확산으로 다양한 도메인에서 서로 다른 특성의 시계열 데이터가 수집되고 있다. 이에 따라 단일 목적으로 수집된 시계열 데이터만 아니라, 다른 목적으로 수집된 시계열 데이터들 또한 통합하여 분석활용하려는 수요 또한 높아지고 있다. 본 논문은 파편화된 시계열 데이터들을 선택하여 통합한 후 딥러닝 모델을 생성하고 활용할 수 있는 해시함수 기반 학습 모델 관리 플랫폼을 설계하고 구현하였다. 특정되지 않은 데이터들을 기반하여 모델을 학습하고 활용할 경우 생성 모델이 개별적으로 어떤 데이터로 어떻게 생성되었는지 기술되어야 향후 활용에 용이하다. 특히 시계열 데이터의 경우 학습 데이터의 시간 정보에 의존적일 수밖에 없으므로 해당 정보의 관리도 필요하다. 본 논문에서는 이러한 문제를 해결하기 위해 해시 함수를 이용해서 생성된 모델을 계층적으로 저장하여 원하는 모델을 쉽게 검색하고 활용할 수 있도록 하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.9
• /
• pp.4455-4461
• /
• 2013

This paper investigates the diagnosis performance of Artificial Neural Network (ANN) depending on the structure and the input vector type of ANN, which has been used to detect the partial discharge to lead to the electric machinery deterioration. The diagnosis performance of one hidden layer and two hidden layer in ANN are compared. The performance using the 2048 time-series data and the performance using the feature input vector are compared. For measuring the partial discharge signal, the tip-to-plate, the sphere-to-sphere, the tip-to-tip, the tip-to-sphere and the sphere-to-plate electrodes are used respectively. For ANN's learning, Matlab and C-code program are used. For evaluating the diagnosis performance of ANNs, the simulation studies are performed.

• Journal of the Optical Society of Korea
• /
• v.16 no.1
• /
• pp.57-62
• /
• 2012

Using continuous wave near-infrared spectroscopy, we measured time-resolved concentration changes of oxy-hemoglobin and deoxy-hemoglobin from the primary motor cortex following finger tapping tasks. These data were processed using partial least squares-discriminant analysis (PLS-DA) to develop a prediction model for a brain-computer interface. The tasks were composed of a series of finger tapping for 15 sec and relaxation for 45 sec. The location of the motor cortex was confirmed by the anti-phasic behavior of the oxy- and deoxy-hemoglobin changes. The results were compared with those obtained using the hidden Markov model (HMM) which has been known to produce the best prediction model. Our data imply that PLS-DA makes better judgments in determining the onset of the events than HMM.