• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.477-486
• /
• 2016

This paper presents the area classification, identification, and tracking for multiple moving objects with the similar colors. To do this, first, we use the GMM(Gaussian Mixture Model)-based background modeling method to detect the moving objects. Second, we propose the use of the binary and morphology of image in order to eliminate the shadow and noise in case of detection of the moving object. Third, we recognize ROI(region of interest) of the moving object through labeling method. And, we propose the area classification method to remove the background from the detected moving objects and the novel method for identifying the classified moving area. Also, we propose the method for tracking the identified moving object using Kalman filter. To the end, we propose the effective tracking method when detecting the multiple objects with the similar colors. Finally, we demonstrate the feasibility and applicability of the proposed algorithms through some experiments.

• Journal of Information Processing Systems
• /
• v.14 no.3
• /
• pp.709-726
• /
• 2018

Database classification is an important preprocessing step for the multi-database mining (MDM). In fact, when a multi-branch company needs to explore its distributed data for decision making, it is imperative to classify these multiple databases into similar clusters before analyzing the data. To search for the best classification of a set of n databases, existing algorithms generate from 1 to ($n^2-n$)/2 candidate classifications. Although each candidate classification is included in the next one (i.e., clusters in the current classification are subsets of clusters in the next classification), existing algorithms generate each classification independently, that is, without taking into account the use of clusters from the previous classification. Consequently, existing algorithms are time consuming, especially when the number of candidate classifications increases. To overcome the latter problem, we propose in this paper an efficient approach that represents the problem of classifying the multiple databases as a problem of identifying the connected components of an undirected weighted graph. Theoretical analysis and experiments on public databases confirm the efficiency of our algorithm against existing works and that it overcomes the problem of increase in the execution time.

• Geotechnical Engineering
• /
• v.11 no.2
• /
• pp.71-78
• /
• 1995

In this paper, a study was performed on classifying a rock mass into multiple classes as in rock mass classification systems, such as RMR system and Q system etc. In a situation with only limited quantitative data available, it was sought to employ a way of incorporating qualitative data in a systematical and reasonable manner. It is based on the realm of Geostatistics. In particular, indicator kriging technique, which is one of non-parametric approaches, was used. As a selection criterion for an optimal classification, the cost of errors was adopted. As a result, the binary rock classification method developed before was extended and generalized for multiple rock classification with its total number of classes unlimited.

• MALSORI
• /
• no.66
• /
• pp.61-72
• /
• 2008

This paper proposes a method to improve pathological and normal voice classification performance by combining multiple features such as auditory-based and higher-order features. Their performances are measured by Gaussian mixture models (GMMs) and linear discriminant analysis (LDA). The combination of multiple features proposed by the frame-based LDA method is shown to be an effective method for pathological and normal voice classification, with a 87.0% classification rate. This is a noticeable improvement of 17.72% compared to the MFCC-based GMM algorithm in terms of error reduction.

• Communications for Statistical Applications and Methods
• /
• v.28 no.2
• /
• pp.135-150
• /
• 2021

We propose principal differential analysis based classification methods. Computations of squared multiple correlation function (RSQ) and principal differential analysis (PDA) scores are reviewed; in addition, we combine principal differential analysis results with the logistic regression for binary classification. In the numerical study, we compare the principal differential analysis based classification methods with functional principal component analysis based classification. Various scenarios are considered in a simulation study, and principal differential analysis based classification methods classify the functional data well. Gene expression data is considered for real data analysis. We observe that the PDA score based method also performs well.

• Korean Journal of Remote Sensing
• /
• v.28 no.5
• /
• pp.489-499
• /
• 2012

In this paper, a classifier ensemble framework for remote sensing data classification is presented that combines classification results generated from both different training sets and different classifiers. A core part of the presented framework is to increase a diversity between classification results by using both different training sets and classifiers to improve classification accuracy. First, different training sets that have different sampling densities are generated and used as inputs for supervised classification using different classifiers that show different discrimination capabilities. Then several preliminary classification results are combined via a majority voting scheme to generate a final classification result. A case study of land-cover classification using multi-temporal ENVISAT ASAR data sets is carried out to illustrate the potential of the presented classification framework. In the case study, nine classification results were combined that were generated by using three different training sets and three different classifiers including maximum likelihood classifier, multi-layer perceptron classifier, and support vector machine. The case study results showed that complementary information on the discrimination of land-cover classes of interest would be extracted within the proposed framework and the best classification accuracy was obtained. When comparing different combinations, to combine any classification results where the diversity of the classifiers is not great didn't show an improvement of classification accuracy. Thus, it is recommended to ensure the greater diversity between classifiers in the design of multiple classifier systems.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.9
• /
• pp.779-784
• /
• 2004

This paper describes a sonic polygonal multiple reflection range sensor (SPMRS), which uses multiple reflection properties usually ignored in ultrasonic sensors as disturbances or noises. Targets such as a plane, corner, edge, or cylinder in indoor environments can easily be detected by the multiple reflection patterns obtained with a SPMRS system. Target classification and feature data extraction, such as distance and azimuth to the target, are computed simultaneously by considering the geometrical relationships between the detected targets, and finally the environment model is generated by refining the detected targets. In addition, the narrow field of view of a sonar range sensor is increased and the scanning time is reduced by active motion of the SPMRS stepping servomechanism.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.830-835
• /
• 2003

This paper describes a sonic polygonal multiple reflection range sensor (SPMRS), which uses multiple reflection properties usually ignored in ultrasonic sensors as disturbances or noises. Targets such as a plane, corner, edge, or cylinder in indoor environments can easily be detected by the multiple reflection patterns obtained with a SPMRS system. Target classification and feature data extraction, such as distance and azimuth to the target, are computed simultaneously by considering the geometrical relationships between the detected targets, and finally the environment model is generated by refining the detected targets. In addition, the narrow field of view of a sonar range sensor is increased and the scanning time is reduced by active motion of the SPMRS stepping servomechanism.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.23-32
• /
• 2003

Since the data is collected from disparate sources in many actual data mining environments, it is common to have data values in different abstraction levels. This paper shows that such multiple abstraction levels of data can cause undesirable effects in decision tree classification. After explaining that equalizing abstraction levels by force cannot provide satisfactory solutions of this problem, it presents a method to utilize the data as it is. The proposed method accommodates the generalization/specialization relationship between data values in both of the construction and the class assignment phase of decision tree classification. The experimental results show that the proposed method reduces classification error rates significantly when multiple abstraction levels of data are involved.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.4
• /
• pp.332-339
• /
• 2014

Face classification has wide applications in security and surveillance. However, this technique presents various challenges caused by pose, illumination, and expression changes. Face recognition with long-distance images involves additional challenges, owing to focusing problems and motion blurring. Multiple frames under varying spatial or temporal settings can acquire additional information, which can be used to achieve improved classification performance. This study investigates the effectiveness of multi-frame decision-level fusion with photon-counting linear discriminant analysis. Multiple frames generate multiple scores for each class. The fusion process comprises three stages: score normalization, score validation, and score combination. Candidate scores are selected during the score validation process, after the scores are normalized. The score validation process removes bad scores that can degrade the final output. The selected candidate scores are combined using one of the following fusion rules: maximum, averaging, and majority voting. Degraded facial images are employed to demonstrate the robustness of multi-frame decision-level fusion in harsh environments. Out-of-focus and motion blurring point-spread functions are applied to the test images, to simulate long-distance acquisition. Experimental results with three facial data sets indicate the efficiency of the proposed decision-level fusion scheme.