• Investigative Magnetic Resonance Imaging
• /
• v.3 no.2
• /
• pp.179-187
• /
• 1999

Purpose : This paper introduces a computationally inexpensive context-dependent classification of multi-echo MRI with Bayes compound decision model. In order to produce accurate region segmentation especially in homogeneous area and along boundaries of the regions, we propose a classification method that uses contextual information of local enighborhood system in the image. Material and Methods : The performance of the context free classifier over a statistically heterogeneous image can be improved if the local stationary regions in the image are disassociated from each other through the mechanism of the interaction parameters defined at he local neighborhood level. In order to improve the classification accuracy, we use the contextual information which resolves ambiguities in the class assignment of a pattern based on the labels of the neighboring patterns in classifying the image. Since the data immediately surrounding a given pixel is intimately associated with this given pixel., then if the true nature of the surrounding pixel is known this can be used to extract the true nature of the given pixel. The proposed context-dependent compound decision model uses the compound Bayes decision rule with the contextual information. As for the contextual information in the model, the directional transition probabilities estimated from the local neighborhood system are used for the interaction parameters. Results : The context-dependent classification paradigm with compound Bayesian model for multi-echo MR images is developed. Compared to context free classification which does not consider contextual information, context-dependent classifier show improved classification results especially in homogeneous and along boundaries of regions since contextual information is used during the classification. Conclusion : We introduce a new paradigm to classify multi-echo MRI using clustering analysis and Bayesian compound decision model to improve the classification results.

• The Korean Journal of Applied Statistics
• /
• v.22 no.4
• /
• pp.723-733
• /
• 2009

The crucial problems of K-means clustering are deciding the number of clusters and initial centroids of clusters. Hence, the steps of K-means clustering are generally consisted of two-stage clustering procedure. The first stage is to run hierarchical clusters to obtain the number of clusters and cluster centroids and second stage is to run nonhierarchical K-means clustering using the results of first stage. Here we provide automated K-means clustering procedure to be useful to obtain initial centroids of clusters which can also be useful for large data sets, and provide software program implemented using R.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.6
• /
• pp.805-814
• /
• 2013

This paper proposes a robust hand segmentation method using view-invariant characteristic of a wrist-mounted camera, and deals with a hand shape recognition system based on segmented hand information. We actively utilize the advantage of the proposed camera device that provides view-invariant images physically, and segment hand region using a Bayesian rule based on adaptive histograms. We construct HSV histograms from RGB histograms, and update HSV histograms using hand region information from a current image. We also propose a user adaptation method by which hand models gradually approach user-dependent models from user-independent models as the user uses the system. The proposed method was evaluated using 16 Korean manual alphabet, and we obtained increases of 27.91% in recognition success rate.

• Journal of Intelligence and Information Systems
• /
• v.10 no.2
• /
• pp.79-89
• /
• 2004

Since the amount of E-mail messages has increased , we need a new technique for efficient e-mail classification. E-mail classifications are grouped into two classes: binary classification, multi-classification. The current binary classification methods are mostly spm mail classification methods which are based on rule driven, bayesian, SVM, etc. The current multi- classification methods are based on clustering which groups e-mails by similarity. In this paper, we propose a novel method for e-mail classification. It combines the automatic category generation method based on the vector model and the dynamic category hierarchy construction method. This method can multi-classify e-mail automatically and manage a large amount of e-mail efficiently. In addition, this method increases the search accuracy by dynamic reclassification of e-mails.

• Journal of KIISE:Software and Applications
• /
• v.37 no.5
• /
• pp.378-385
• /
• 2010

The explosive increase in the use of email has made to need email classification efficiently and accurately. Current work on the email classification method have mainly been focused on a binary classification that filters out spam-mails. This methods are based on Support Vector Machines, Bayesian classifiers, rule-based classifiers. Such supervised methods, in the sense that the user is required to manually describe the rules and keyword list that is used to recognize the relevant email. Other unsupervised method using clustering techniques for the multi-category classification is created a category labels from a set of incoming messages. In this paper, we propose a new automatic email multi-category classification method using NMF for automatic category label construction method and dynamic category hierarchy method for the reorganization of email messages in the category labels. The proposed method in this paper, a large number of emails are managed efficiently by classifying multi-category email automatically, email messages in their category are reorganized for enhancing accuracy whenever users want to classify all their email messages.

• Journal of Advanced Navigation Technology
• /
• v.13 no.3
• /
• pp.419-425
• /
• 2009

The amount of incoming e-mails is increasing rapidly due to the wide usage of Internet. Therefore, it is more required to classify incoming e-mails efficiently and accurately. Currently, the e-mail classification techniques are focused on two way classification to filter spam mails from normal ones based mainly on Bayesian and Rule. The clustering method has been used for the multi-way classification of e-mails. But it has a disadvantage of low accuracy of classification and no category labels. The classification methods have a disadvantage of training and setting of category labels by user. In this paper, we propose a novel multi-way e-mail hierarchy classification method that uses PCA for automatic category generation and dynamic category hierarchy for high accuracy of classification. It classifies a huge amount of incoming e-mails automatically, efficiently, and accurately.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.259-266
• /
• 2006

As the volume of spam has increased to extreme levels, many anti-spam filtering techniques have been proposed. Among these techniques, the machine-Loaming filtering technique is one of the most popular filtering techniques. In this paper, we propose a machine-learning spam filtering technique based on the neural network, the genetic algorithm and the $X^2$-statistic. This proposed filtering technique is designed to overcome the problems in existing filtering techniques, and to achieve high spam filtering accuracy. It is able to classify spam and legitimate emil with 95.25 percent and 95.31 percent accuracy. This accuracy of the sum filtering is 7.75 percent and the 12.44 percent higher than rule-based filtering and the Bayesian filtering technique, respectively.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.73-81
• /
• 2015

The paper proposes a prototype selection method and evaluates the generalization performance of standard algorithms and prototype based classification learning. The proposed prototype classifier defines multidimensional spheres with variable radii within class areas and generates a small set of training data. The nearest-neighbor classifier uses the new training set for predicting the class of test data. By decomposing bias and variance of the mean expected error value, we compare the generalization errors of k-nearest neighbor, Bayesian classifier, prototype selection using fixed radius and the proposed prototype selection method. In experiments, the bias-variance changing trends of the proposed prototype classifier are similar to those of nearest neighbor classifiers with all training data and the prototype selection rates are under 27.0% on average.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.853-862
• /
• 2003

Many more use e-mail purely on a personal basis and the pool of e-mail users is growing daily. Also, the amount of mails, which are transmitted in electronic commerce, is getting more and more. Because of its convenience, a mass of spam mails is flooding everyday. And yet automated techniques for learning to filter e-mail have yet to significantly affect the e-mail market. This paper suggests Web Mail Filtering Agent for Personalized Classification, which automatically manages mails adjusting to the user. It is based on web mail, which can be logged in any time, any place and has no limitation in any system. In case new mails are received, it first makes some personal rules in use of the result of observation ; and based on the personal rules, it automatically classifies the mails into categories according to the contents of mails and saves the classified mails in the relevant folders or deletes the unnecessary mails and spam mails. And, we applied Bayesian Algorithm using Dynamic Threshold for our system's accuracy.

• Korean Journal of Remote Sensing
• /
• v.19 no.6
• /
• pp.465-478
• /
• 2003

This paper presents two methods for automatic estimation of threshold values in unsupervised change detection of multi-temporal remote sensing images. The proposed methods consist of two analytical steps. The first step is to compute the parameters of a 3-component Gaussian mixture model from difference or ratio images. The second step is to determine a threshold value using Bayesian rule for minimum error. The first method which is an extended version of Bruzzone and Prieto' method (2000) is to apply an Expectation-Maximization algorithm for estimation of the parameters of the Gaussian mixture model. The second method is based on an iterative thresholding algorithm that successively employs thresholding and estimation of the model parameters. The effectiveness and applicability of the methods proposed here were illustrated by two experiments and one case study including the synthetic data sets and KOMPSAT-1 EOC images. The experiments demonstrate that the proposed methods can effectively estimate the model parameters and the threshold value determined shows the minimum overall error.