• Genomics & Informatics
• /
• v.17 no.4
• /
• pp.39.1-39.20
• /
• 2019

Analyzing patterns in data points embedded in linear and non-linear feature spaces is considered as one of the common research problems among different research areas, for example: data mining, machine learning, pattern recognition, and multivariate analysis. In this paper, data points are heterogeneous sets of biosequences (composite data points). A composite data point is a set of ordinary data points (e.g., set of feature vectors). We theoretically extend the derivation of the largest generalized eigenvalue-based distance metric D_ij(γ₁) in any linear and non-linear feature spaces. We prove that D_ij(γ₁) is a metric under any linear and non-linear feature transformation function. We show the sufficiency and efficiency of using the decision rule $\bar{{\delta}}_{{\Xi}i}$(i.e., mean of D_ij(γ₁)) in classification of heterogeneous sets of biosequences compared with the decision rules min_𝚵iand median_𝚵i. We analyze the impact of linear and non-linear transformation functions on classifying/clustering collections of heterogeneous sets of biosequences. The impact of the length of a sequence in a heterogeneous sequence-set generated by simulation on the classification and clustering results in linear and non-linear feature spaces is empirically shown in this paper. We propose a new concept: the limiting dispersion map of the existing clusters in heterogeneous sets of biosequences embedded in linear and nonlinear feature spaces, which is based on the limiting distribution of nucleotide compositions estimated from real data sets. Finally, the empirical conclusions and the scientific evidences are deduced from the experiments to support the theoretical side stated in this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.983-989
• /
• 2006

Current emigration and immigration control inspects passports by the naked eye, registers them by manual input, and compares them with items of database. In this paper, we propose the method to recognize information codes of passports. The proposed passport recognition method extracts character-rows of information codes by applying sobel operator, horizontal smearing, and contour tracking algorithm. The extracted letter-row regions is binarized. After a CDM mask is applied to them in order to recover the individual codes, the individual codes are extracted by applying vertical smearing. The recognizing of individual codes is performed by the RBF network whose hidden layer is applied by ART 2 algorithm and whose learning between the hidden layer and the output layer is applied by a generalized delta learning method. After a photo region is extracted from the reference of the starting point of the extracted character-rows of information codes, that region is verified by the information of luminance, edge, and hue. The verified photo region is certified by the classified features by the ART 2 algorithm. The comparing experiment with real passport images confirmed the good performance of the proposed method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.5
• /
• pp.561-566
• /
• 2021

The optimum kernel size for error-distribution estimation with given error samples cannot be used in the weight adjustment of minimum Euclidean distance between error distributions (MED) algorithms. In this paper, a new adaptive kernel estimation method for convergence enhancement of MED algorithms is proposed. The proposed method uses the average rate of change in error power with respect to a small interval of the kernel width for weight adjustment of the MED learning algorithm. The proposed kernel adjustment method is applied to experiments in communication channel compensation, and performance improvement is demonstrated. Unlike the conventional method yielding a very small kernel calculated through optimum estimation of error distribution, the proposed method converges to an appropriate kernel size for weight adjustment of the MED algorithm. The experimental results confirm that the proposed kernel estimation method for MED can be considered a method that can solve the sensitivity problem from choosing an appropriate kernel size for the MED algorithm.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.7
• /
• pp.53-57
• /
• 2006

PID controller is widely uesd as automatic equipment for industry. However when a system has various characters of intermittence or continuance, a new parameter decision for accurate control is a hard task. As method of solving this problem, in this paper, a Neural Network gain automatic regulator as PID controller functions is presented. A property feedback control gain of system is decided by a rule of Delta learning. The function of proposed automatic Neural Network gain regulator is verified by speed control experiment results of Induction Motor.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.46-49
• /
• 1998

In this paper, we introduce the notion of intelligent communication by introducing a novel intelligent receiver model. This receiver is continually evolving and learns and improves in performance as it compiles its experience over time. In digital communication context, in a typical training mode, it jearns the concept of "1" as is deteriorated by arbitrary (not necessarily additive as is typically assumed) disturbance and /or modulation. After learning "1", in test mode, it classifies the received signal "1" and "0" almost completely. The intelligent receiver as implemented is grounded on the recently introduced Stochastic Morphological Sampling Theorem(SMST), a distribution-free result which gives theoretical bounds on the sample complexity(training size) needed for the required performance parameters such as accuracy($\varepsilon$) and confidence($\delta$). Based on this theorem, we demonstrate --almost irrespective of channel and modulation model-- the number of samples needed to learn the concept of "1" is not too "large" and the resulting universal receiver structure, that corresponding to classical Nearest Neighbor rule in Pattern Recognition Theory, is trivial. We check the surprising efficiency and validity of this model through some simple simulations. and validity of this model through some simple simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3286-3300
• /
• 2016

High Efficiency Video Coding (HEVC) Standard, as the latest coding standard, introduces satisfying compression structures with respect to its predecessor Advanced Video Coding (H.264/AVC). The new coding standard can offer improved encoding performance compared with H.264/AVC. However, it also leads to enormous computational complexity that makes it considerably difficult to be implemented in real time application. In this paper, based on machine learning, a fast partitioning method is proposed, which can search for the best splitting structures for Intra-Prediction. In view of the video texture characteristics, we choose the entropy of Gray-Scale Difference Statistics (GDS) and the minimum of Sum of Absolute Transformed Difference (SATD) as two important features, which can make a balance between the computation complexity and classification performance. According to the selected features, adaptive decision trees can be built for the Coding Units (CU) with different size by offline training. Furthermore, by this way, the partition of CUs can be resolved as a binary classification problem. Experimental results have shown that the proposed algorithm can save over 34% encoding time on average, with a negligible Bjontegaard Delta (BD)-rate increase.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.36 no.2
• /
• pp.88-95
• /
• 1994

This paper is to evaluate the applicability of neural networks to the estimation of evapotranspiration. Two neural networks were developed to forecast daily evapotranspiration of the rice crop with back-propagation and counter-propagation algorithm. The neural network trained by back-propagation algorithm with delta learning rule is a three-layer network with input, hidden, and output layers. The other network with counter-propagation algorithm is a four-layer network with input, normalizing, competitive, and output layers. Training neural networks was conducted using daily actual evapotranspiration of rice crop and daily climatic data such as mean temperature, sunshine hours, solar radiation, relative humidity, and pan evaporation. During the training, neural network parameters were calibrated. The trained networks were applied to a set of field data not used in the training. The created response of the back-propagation network was in good agreement with desired values and showed better performances than the counter-propagation network did. Evaluating the neural network performance indicates that the back-propagation neural network may be applied to the estimation of evapotranspiration of the rice crop. This study does not provide with a conclusive statement as to the ability of a neural network to evapotranspiration estimating. More detailed study is required for better understanding and evaluating the behavior of neural networks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.2
• /
• pp.103-107
• /
• 2009

PI controller is widely used as voltage control system of generator. However when a generator system has various characters of continuance, a new PI parameter decision for accurate control is a hard task as method of solving this problem, in this paper, the method to generator voltage control using Neural Network self adaptive control is presented. A property continuous feedback control gain of voltage control system is decided by a rule of delta learning. The function of proposed control method is verified by voltage control experiment results of DC generator.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.1
• /
• pp.174-183
• /
• 2002

In this paper a control chart pattern recognition methodology based on the back propagation algorithm and Multi layer perceptron, a neural computing theory, is presented. This pattern recognition algorithm, suitable for real time statistical process control. evaluates observations routinely collected for control charting to determine whether a Pattern, such as a cycle. trend or shift, which is exists in the data. This approach is promising because of its flexible training and high speed computation with low-end workstation. The artificial neural network methodology is developed utilizing the delta learning rule, sigmoid activation function with two hidden layers. In a computer integrated manufacturing environment, the operator need not routinely monitor the control chart but, rather, can be alerted to patterns by a computer signal generated by the proposed system.

• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.147-158
• /
• 2021

Versatile Video Coding (VVC) is the latest video coding standard developed by Joint Video Exploration Team (JVET). In VVC, the quadtree plus multi-type tree (QT+MTT) structure of coding unit (CU) partition is adopted, and its computational complexity is considerably high due to the brute-force search for recursive rate-distortion (RD) optimization. In this paper, we aim to reduce the time complexity of inter-picture prediction mode since the inter prediction accounts for a large portion of the total encoding time. The problem can be defined as classifying the split mode of each CU. To classify the split mode effectively, a novel convolutional neural network (CNN) called multi-level tree (MLT-CNN) architecture is introduced. For boosting classification performance, we utilize additional information including inter-picture information while training the CNN. The overall algorithm including the MLT-CNN inference process is implemented on VVC Test Model (VTM) 11.0. The CUs of size 128×128 can be the inputs of the CNN. The sequences are encoded at the random access (RA) configuration with five QP values {22, 27, 32, 37, 42}. The experimental results show that the proposed algorithm can reduce the computational complexity by 11.53% on average, and 26.14% for the maximum with an average 1.01% of the increase in Bjøntegaard delta bit rate (BDBR). Especially, the proposed method shows higher performance on the sequences of the A and B classes, reducing 9.81%~26.14% of encoding time with 0.95%~3.28% of the BDBR increase.