• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.257-264
• /
• 2005

This paper suggests a heuristic algorithm for the clustering problem. Clustering involves grouping similar objects into a cluster. Clustering is used in a wide variety of fields including data mining, marketing, and biology. Until now there are a lot of approaches using Self-Organizing Feature Maps(SOFMs). But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of k output-layer nodes, if they want to make k clusters. This approach has problems to classify elaboratively. This paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We can find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. We use the well known IRIS data as an experimental data. Unsupervised clustering of IRIS data typically results in 15 - 17 clustering error. However, the proposed algorithm has only six clustering errors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.6
• /
• pp.819-826
• /
• 2002

Cellular neural networks(CNN) are neural networks that have locally connected characteristics and real-time image processing. Locally connected characteristics are suitable for VLSI implementation. It also has applications in such areas as image processing and pattern recognition. In this thesis cellular neural networks are used for feature detection in number recognition at the stage of re-processing. The four or six directional shadow detectors are used in numbers recognition. At the stage of classification, this result of feature detection was simulated by using a multi-layer back Propagation neural network. The experiments indicate that the CNN feature detectors capture good features for number recognition tasks.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.371-376
• /
• 2003

In this paper, we proposes a method for recognizing the facial expressions using ICA(Independent Component Analysis)-factorial representation method. Facial expression recognition consists of two stages. First, a method of Feature extraction transforms the high dimensional face space into a low dimensional feature space using PCA(Principal Component Analysis). And then, the feature vectors are extracted by using ICA-factorial representation method. The second recognition stage is performed by using the Euclidean distance measure based KNN(K-Nearest Neighbor) algorithm. We constructed the facial expression database for six basic expressions(happiness, sadness, angry, surprise, fear, dislike) and obtained a better performance than previous works.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.1-10
• /
• 2022

Nowadays software defect prediction (SDP) is most active research going on in software engineering. Early detection of defects lowers the cost of the software and also improves reliability. Machine learning techniques are widely used to create SDP models based on programming measures. The majority of defect prediction models in the literature have problems with class imbalance and high dimensionality. In this paper, we proposed Centroid and Nearest Neighbor based Class Imbalance Reduction (CNNCIR) technique that considers dataset distribution characteristics to generate symmetry between defective and non-defective records in imbalanced datasets. The proposed approach is compared with SMOTE (Synthetic Minority Oversampling Technique). The high-dimensionality problem is addressed using Ant Colony Optimization (ACO) technique by choosing relevant features. We used nine different classifiers to analyze six open-source software defect datasets from the PROMISE repository and seven performance measures are used to evaluate them. The results of the proposed CNNCIR method with ACO based feature selection reveals that it outperforms SMOTE in the majority of cases.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.5
• /
• pp.77-84
• /
• 2022

In this paper, we propose a novel unsupervised feature selection method. Conventional unsupervised feature selection method defines virtual label and uses a regression analysis that projects the given data to this label. However, since virtual labels are generated from data, they can be formed similarly in the space. Thus, in the conventional method, the features can be selected in only restricted space. To solve this problem, in this paper, features are selected using orthogonal projections and low-rank approximations. To solve this problem, in this paper, a virtual label is projected to orthogonal space and the given data set is also projected to this space. Through this process, effective features can be selected. In addition, projection matrix is restricted low-rank to allow more effective features to be selected in low-dimensional space. To achieve these objectives, a cost function is designed and an efficient optimization method is proposed. Experimental results for six data sets demonstrate that the proposed method outperforms existing conventional unsupervised feature selection methods in most cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2768-2787
• /
• 2023

As an important research direction of the application of computer science in the medical field, the automatic generation technology of radiology report has attracted wide attention in the academic community. Because the proportion of normal regions in radiology images is much larger than that of abnormal regions, words describing diseases are often masked by other words, resulting in significant feature loss during the calculation process, which affects the quality of generated reports. In addition, the huge difference between visual features and semantic features causes traditional multi-modal fusion method to fail to generate long narrative structures consisting of multiple sentences, which are required for medical reports. To address these challenges, we propose a multi-feature optimization Transformer (MFOT) for generating radiology reports. In detail, a multi-dimensional mapping attention (MDMA) module is designed to encode the visual grid features from different dimensions to reduce the loss of primary features in the encoding process; a feature pre-fusion (FP) module is constructed to enhance the interaction ability between multi-modal features, so as to generate a reasonably structured radiology report; a detail enhanced attention (DEA) module is proposed to enhance the extraction and utilization of key features and reduce the loss of key features. In conclusion, we evaluate the performance of our proposed model against prevailing mainstream models by utilizing widely-recognized radiology report datasets, namely IU X-Ray and MIMIC-CXR. The experimental outcomes demonstrate that our model achieves SOTA performance on both datasets, compared with the base model, the average improvement of six key indicators is 19.9% and 18.0% respectively. These findings substantiate the efficacy of our model in the domain of automated radiology report generation.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.3E
• /
• pp.12-21
• /
• 1998

In this paper, we describe the one channel five-way, V/U/M/N/S (Voice/Unvoice/Nasal/Silent), classification algorithm for automatically classifying speech. The decision making process is viewed as a pattern viewed as a pattern recognition problem. Two aspects of the algorithm are developed: feature selection and classifier type. The feature selection procedure is studied for identifying a set of features to make V/U/M/N/S classification. The classifiers used are a vector quantization (VQ), a neural network(NN), and a decision tree method. Actual five sentences spoken by six speakers, three male and three female, are tested with proposed classifiers. From a set of measurement tests, the proposed classifiers show fairly good accuracy for V/U/M/N/S decision.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.4
• /
• pp.277-282
• /
• 2015

Braincomputer interface (BCI) technology is making advances in the field of humancomputer interaction (HCI). To improve the BCI technology, we study the changes in the electroencephalogram (EEG) signals for six levels of grip strength: 10%, 20%, 40%, 50%, 70%, and 80% of the maximum voluntary contraction (MVC). The measured EEG data are categorized into three classes: Weak, Medium, and Strong. Features are then extracted using power spectrum analysis and multiclass-common spatial pattern (multiclass-CSP). Feature datasets are classified using a support vector machine (SVM). The accuracy rate is higher for the Strong class than the other classes.

• Speech Sciences
• /
• v.12 no.3
• /
• pp.201-209
• /
• 2005

This study was investigated developmental temporal features in Putonghua-speaking children. The total of 212 children between the ages 2;6 and 6;5 participated in Shanghai. Speech materials were constructed according to aspiration feature in stop sounds of Putonghua. Six words were selected in this study. A voice onset time was measured. Non-parametric procedures were employed for all the analyses. The VOT value across bilabial, alveolar, and velar stops was significantly differed between aspirated and unaspirated stops for each age group. Effect of age is. significant for unaspirated stops. It is clear that each of Putonghua stops showed decreasing mean and standard deviation. The overshoot phenomenon of VOT was apparent from the age of 2;6-2;11 to 4;6-4;11. There was high variability in the production of lag time for aspirated stops.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.117-123
• /
• 2006

Recently with the development of 3D modeling and digitizing tools, more and more models have been created, which leads to the necessity of the technique of 3D mode retrieval system. In this paper we investigate a new method for 3D model retrieval based on orthogonal projections. We assume that 3D models are composed of trigonal meshes. Algorithms process first by a normalization step in which the 3D models are transformed into the canonical coordinates. Then each model is orthogonally projected onto six surfaces of the projected cube which contains it. A following step is feature extraction of the projected images which is done by Moment Invariants and Polar Radius Fourier Transform. The feature vector of each 3D model is composed of the features extracted from projected images with different weights. Our System validates that this means can distinguish 3D models effectively. Experiments show that our method performs quit well.