• Journal of Integrative Natural Science
• /
• v.13 no.4
• /
• pp.147-151
• /
• 2020

In this paper, we propose a method to detect concept drift by applying Convolutional Neural Network (CNN) in a data stream environment. Since the conventional method compares only the final output value of the CNN and detects it as a concept drift if there is a difference, there is a problem in that the actual input value of the data stream reacts sensitively even if there is no significant difference and is incorrectly detected as a concept drift. Therefore, in this paper, in order to reduce such errors, not only the output value of CNN but also the probability vector are used. First, the data entered into the data stream is patterned to learn from the neural network model, and the difference between the output value and probability vector of the current data and the historical data of these learned neural network models is compared to detect the concept drift. The proposed method confirmed that only CNN output values could be used to reduce detection errors compared to how concept drift were detected.

• Honam Mathematical Journal
• /
• v.44 no.2
• /
• pp.259-270
• /
• 2022

This paper is devoted to the geometry of vector fields and timelike flows in terms of anholonomic coordinates in three dimensional Lorentzian space. We discuss eight parameters which are related by three partial differential equations. Then, it is seen that the curl of tangent vector field does not include any component in the direction of principal normal vector field. This implies the existence of a surface which contains both s - lines and b - lines. Moreover, we examine a normal congruence of timelike surfaces containing the s - lines and b - lines. Considering the compatibility conditions, we obtain the Gauss-Mainardi-Codazzi equations for this normal congruence of timelike surfaces in the case of the abnormality of normal vector field is zero. Intrinsic geometric properties of these normal congruence of timelike surfaces are obtained. We have dealt with important results on these geometric properties.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.816-839
• /
• 2023

In a random vector functional link (RVFL) network, shortcomings such as local optimal stagnation and decreased convergence performance cause a reduction in the accuracy of illumination correction by only inputting the weights and biases of hidden neurons. In this study, we proposed an improved regularized random vector functional link (RRVFL) network algorithm with an optimized grey wolf optimizer (GWO). Herein, we first proposed the moth-flame optimization (MFO) algorithm to provide a set of excellent initial populations to improve the convergence rate of GWO. Thereafter, the MFO-GWO algorithm simultaneously optimized the input feature, input weight, hidden node and bias of RRVFL, thereby avoiding local optimal stagnation. Finally, the MFO-GWO-RRVFL algorithm was applied to ameliorate the performance of illumination correction of various test images. The experimental results revealed that the MFO-GWO-RRVFL algorithm was stable, compatible, and exhibited a fast convergence rate.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.732-736
• /
• 1986

This paper propose a novel vector-quantized block truncation coder for image data compression. A data compression ratio of about 3-6 times larger than that of the BTC can be achieved by utilizign a vector quantizer with the BTC. A vector quantizer was realized by computer simulation. The compressed data rate of 0.7~1.0 bit/pel with intraframe coder and that of 0.3~0.5 bit/pel with interframe coder gives a good performance.

• The Korean Journal of Applied Statistics
• /
• v.21 no.1
• /
• pp.159-168
• /
• 2008

Since the term structure of interest rates (TSIR) has longitudinal data, we should consider as input variables both time left to maturity and time simultaneously to get a more useful and more efficient function estimation. However, since the resulting data set becomes very large, we need to develop a fast and reliable estimation method for large data set. Furthermore, it tends to overestimate TSIR because data are correlated. To solve these problems we propose a mixture of weighted least squares support vector machines. We recognize that the estimate is well smoothed and well explains effects of the third stock market crash in USA through applying the proposed method to the US Treasury bonds data.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.37-45
• /
• 2013

Context dependent fusion (CDF) is a fusion algorithm that combines multiple outputs from different classifiers to achieve better performance. CDF tries to divide the problem context into several homogeneous sub-contexts and to fuse data locally with respect to each sub-context. CDF showed better performance than existing methods, however, it is sensitive to noise due to the large number of parameters optimized and the innate linearity limits the application of CDF. In this paper, a variant of CDF using support vector machines (SVMs) for fusion and kernel principal component analysis (K-PCA) for context extraction is proposed to solve the problems in CDF, named CDF-SVM. Kernel PCA can shape irregular clusters including elliptical ones through the non-linear kernel transformation and SVM can draw a non-linear decision boundary. Regularization terms is also included in the objective function of CDF-SVM to mitigate the noise sensitivity in CDF. CDF-SVM showed better performance than CDF and its variants, which is demonstrated through the experiments with a landmine data set.

• Journal of the Korea Computer Industry Society
• /
• v.10 no.5
• /
• pp.227-234
• /
• 2009

The Paper introduces a new technique for block matching motion estimation. since the temporal correlation of a animation sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the scene change detection algorithm for block matching using the temporal correlation of the animation sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that the PSNR values are improved as high as 9~32% in terms of average number of search point per motion vector estimation and improved about 0.06~0.21dB on an average except the FS(full search) algorithm.

• Journal of Digital Contents Society
• /
• v.16 no.6
• /
• pp.909-916
• /
• 2015

This paper presents a method to display the 3D vector fields by analyzing phase space. This method is based on the connections between ordinary differential equations and the topology of vector fields. The phase space analysis should be geometric interpolation of an autonomous system of equation in the form of the phase space. Every solution of it system of equations corresponds not to a curve in a space, but the motion of a point along the curve. This analysis is the basis of this paper. This new method is required to decompose the hexahedral cell into five or six tetrahedral cells for 3D vector fields. The critical points can be easily found by solving a simple linear system for each tetrahedron. The tangent curves can be integrated by finding the intersection points of an integral curve traced out by the general solution of each tetrahedron and plane containing a face of the tetrahedron.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.5
• /
• pp.494-503
• /
• 2002

A motion vector re-estimation algorithm for image downscaling in discrete consine transform domain is presented. Kernel functions are difined using SAD (Aum of Absolute Difference) and edge information of a macroblock. The proposed method uses these kernel functions to re-estimate a new motion vector of the downscaled image. The motion vectors from the incoming bitstream of transcoder are reused to reduce computation burden of the block-matching motion estimation, and we also reuse the given motion vectors. Several experiments in this paper show that the computation efficiency and the PSNR (Peak Signal to Noise Ratio) and better than the previous methods.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.11
• /
• pp.868-877
• /
• 2018

In this paper, we propose a new beamforming algorithm for a conformal array antenna based on support vector regression(SVR). While the conventional least squares method(LSM) considers all sample errors, SVR considers errors beyond the given error bound to obtain the optimum weight vector, which has a sparse solution and the advantage of the minimization of the overfitting problem. To verify the performance of the proposed algorithm, we apply SVR to the experimentally measured active element patterns of the conformal array antenna and obtain the weights for beamforming. In addition, we compare the beamforming results of SVR and LSM.