• Journal of the Korean Data and Information Science Society
• /
• v.12 no.1
• /
• pp.135-142
• /
• 2001

A multivariate statistic based on interdirection is proposed for detecting dependence among many vectors. The asymptotic distribution of the proposed statistic is derived under the null hypothesis of independence. Also we find the asymptotic distribution under the alternatives contiguous to the null hypothesis, which is needed for later use of computing relative efficiencies.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2004-2007
• /
• 2003

This paper describes a method of performance enhancement using Flatness Mesure(FM) for the Gaussian Mixture Model(GMM) face recognition systems. Using this measure we discard the frames having low information before training and test. As the result, the performance increases about 9％ in the lower mixtures and calculation burden is decreased. As well, the recognition error rate is decreased under the illumination change surroundings. We use the 2D DCT coefficients lot face feature vectors and experiments are carried out on the Olivetti Research Laboratory (ORL) face database.

• The Journal of the Acoustical Society of Korea
• /
• v.3 no.1
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.6
• /
• pp.515-520
• /
• 2004

Core-based system-on-a-chip (SoC) designs present a number of test challenges. Two major problems that are becoming increasingly important are long application time during manufacturing test and high volume of test data. Highly efficient compression techniques have been proposed to reduce storage and application time for high volume data by exploiting the repetitive nature of test vectors. This paper proposes a new test data compression technique for SoC testing. In the proposed technique, compression is achieved by partitioning the test vector set and removing repeating segment. This process has $O(n^{-2})$ time complexity for compression with a simple hardware decoding circuitry. It is shown that the efficiency of the proposed compression technique is comparable with sophisticated software compression techniques with the advantage of easy and fast decoding.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1183-1186
• /
• 2004

In the steel production line, the molten metal of a furnace is transformed into billet and then moves to the heating furnace of the hot rolling mill. This paper describes about the realtime billet characters recognition system in the steel production line. Normally, the billets are mixed at yard so that their identifications are very difficult and very important processing. The character recognition algorithm used in this paper is base on the subspace method by K-L transformation. With this method, we need no special feature extraction steps, which are usually error prone. So the gray character images are directly used as input vectors of the classifier. To train the classifier, we have extracted eigen vectors of each character used in the billet numbers, which consists of 10 arabia numbers and 26 alphabet aharacters, which are gathered from billet images of the production line. We have developed billet characters recognition system using this algorithm and tested this system in the steel production line during the 8-days. The recognition rate of our system in the field test has turned out to be 94.1% (98.6% if the corrupted characters are excluded). In the results, we confirmed that our recognition system has a good performance in the poor environments and ill-conditioned marking system like as steel production plant.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.47-61
• /
• 2001

Lazy loaming methods including CBR have relative advantages in comparison with eager loaming methods such as artificial neural networks and decision trees. However, they are very sensitive to irrelevant features. In other words, when there are irrelevant features, larry learning methods have difficulty in comparing cases. Therefore, their performance can be degraded significantly. To overcome this disadvantage, feature weighting methods for lazy loaming methods have been studied. Most of the existing researches, however, were focused on global feature weighting. In this research, we propose a new local feature weighting method, which we shall call CBDFW. CBDFW stores classification performance of randomly generated feature weight vectors. Then, given a new query case, CBDFW retrieves the successful feature weight vectors and designs a feature weight vector fur the query case. In the test on credit evaluation domain, CBDFW showed better classification accuracy when compared to the results of previous researches.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.12
• /
• pp.1220-1225
• /
• 2010

This paper proposes a novel active noise control (ANC) approach that uses an IIR filter and neural network techniques to effectively reduce interior noise. We construct a multiple-channel IIR filter module which is a linearly augmented framework with a generic IIR model to generate a primary control signal. A three-layer perceptron neural network is employed for establishing a secondary-path model to represent air channels among noise fields. Since the IIR module and neural network are connected in series, the output of an IIR filter is transferred forward to the neural model to generate a final ANC signal. A gradient descent optimization based learning algorithm is analytically derived for the optimal selection of the ANC parameter vectors. Moreover, re-estimation of partial parameter vectors in the ANC system is proposed for online learning. Lastly, we present the results of a numerical study to test our ANC methodology with realistic interior noise measurement obtained from Korean railway trains.

• Journal of Veterinary Clinics
• /
• v.29 no.1
• /
• pp.63-67
• /
• 2012

Mosquitoes are the vectors of a number of viral diseases in cattle, such as Akabane disease, bovine ephemeral fever, Ainovirus infection, Chuzan virus infection, and Ibaraki disease. These diseases are transmitted from an infected animal to a non-infected host via the blood feeding of the vector. In Korea, the National Veterinary Research and Quarantine Services, Ministry for Food, Agriculture, Forestry and Fisheries is responsible for planning, implementation, laboratory investigations and reporting the results of the national surveillance program for mosquito-borne bovine diseases (MBD). The surveillance program, which was started in 1993, focused to determine the seroprevalence of each disease in cattle herds in space and time. From the epidemiological point of view, more important component of the surveillance program is to monitor infection rates in vectors for specific pathogens because this information is essential for a more precise understanding the dynamics of these diseases in a given environment and for determining risk of transmission. The aim of this study was to describe and compare methods for estimation of vector infection rates using maximum likelihood (MLE) and minimum infection rate in pooled samples. Factors affecting MLE such as number of pools, pooling size and diagnostic test performance are also discussed, assuming some hypothetical sampling scenarios for MBD.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2002.05a
• /
• pp.195-200
• /
• 2002

ART (Adaptive Resonance Theory [1]) neural network and its variations perform non-hierarchical clustering by unsupervised learning. We propose a scheme "arboART" for hierarchical clustering by using several ART1.5-SSS networks. It classifies multidimensional vectors as a cluster tree, and finds features of clusters. The Basic idea of arboART is to use the prototype formed in an ART network as an input to other ART network that has looser distance criteria (Ishihara, et al., [2,3]). By sending prototype vectors made by ART to one after another, many small categories are combined into larger and more generalized categories. We can draw a dendrogram using classification records of sample and categories. We have confirmed its ability using standard test data commonly used in pattern recognition community. The clustering result is better than traditional computing methods, on separation of outliers, smaller error (diameter) of clusters and causes no chaining. This methodology is applied to Kansei evaluation experiment data analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4567-4587
• /
• 2017

With the growth of the Internet and the extensive applications of image editing software, it has become easier to manipulate digital images without leaving obvious traces. Copy-move is one of the most common techniques for image forgery. Image blind forensics is an effective technique for detecting tampered images. This paper proposes an improved copy-move forgery detection method based on the discrete cosine transform (DCT). The quantized DCT coefficients, which are feature representations of image blocks, are truncated using a truncation factor to reduce the feature dimensions. A method for judging whether two image blocks are similar is proposed to improve the accuracy of similarity judgments. The main transfer vectors whose frequencies exceed a threshold are found to locate the copied and pasted regions in forged images. Several experiments are conducted to test the practicability of the proposed algorithm using images from copy-move databases and to evaluate its robustness against post-processing methods such as additive white Gaussian noise (AWGN), Gaussian blurring, and JPEG compression. The results of experiments show that the proposed scheme effectively detects both copied region and pasted region of forged images and that it is robust to the post-processing methods mentioned above.