• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.853-858
• /
• 2006

TMHMM(Tied Mixture Hidden Markov Model) is an important approach to reduce the number of free parameters in speech recognition. However, this model suffers from a degradation in recognition accuracy due to its GPDF (Gaussian Probability Density Function) clustering error. This paper proposes a clustering algorithm, called HCNN(Homogeneous Centroid Neural network), to cluster acoustic feature vectors in TMHMM. Moreover, the HCNN uses the heterogeneous distance measure to allocate more code vectors in the heterogeneous areas where probability densities of different states overlap each other. When applied to Korean digit isolated word recognition, the HCNN reduces the error rate by 9.39% over CNN clustering, and 14.63% over the traditional K-means clustering.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.861-866
• /
• 2007

A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1946-1952
• /
• 1999

A new image compression method to preserve edge characteristics in reconstructed images using an unsupervised learning neural is proposed in this paper. By the unsupervised competitive learning which generalizes previously proposed Centroid Neural Network(CNN) algorithm with the geometric characteristics of edge area and statistical characteristics of image data, more codevectors are allocated in the edge areas to provide the more accurate edges in reconstructed image. Experimental results show that the proposed method gives improved edge in reconstructed images when compared with SOM, Modified SOM and M/R-CNN.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.156-165
• /
• 2021

In this paper, we propose an histogram weighted centroid based Siamese region proposal network for object tracking. The original Siamese region proposal network uses two identical artificial neural networks which take two different images as the inputs and decide whether the same object exist in both input images based on a similarity measure. However, as the Siamese network is pre-trained offline, it experiences many difficulties in the adaptation to various online environments. Therefore, in this paper we propose to incorporate the histogram weighted centroid feature into the Siamese network method to enhance the accuracy of the object tracking. The proposed method uses both the histogram information and the weighted centroid location of the top 10 color regions to decide which of the proposed region should become the next predicted object region.

• Journal of IKEEE
• /
• v.17 no.3
• /
• pp.254-259
• /
• 2013

The choice of labeled data in semi-supervised learning algorithm can result in effects on the performance of the resultant classifier. In order to select labeled data required for the training of a semi-supervised learning algorithm, VCNN(Vector Centroid Neural Network) is proposed in this paper. The proposed selection method of label data is evaluated on UCI dataset and caltech dataset. Experiments and results show that the proposed selection method outperforms conventional methods in terms of classification accuracy and minimum error rate.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.639-647
• /
• 2011

In this paper, we introduce a design methodology of data-centroid Radial Basis Function neural networks with extended polynomial function. The two underlying design mechanisms of such networks involve K-means clustering method and Particle Swarm Optimization(PSO). The proposed algorithm is based on K-means clustering method for efficient processing of data and the optimization of model was carried out using PSO. In this paper, as the connection weight of RBF neural networks, we are able to use four types of polynomials such as simplified, linear, quadratic, and modified quadratic. Using K-means clustering, the center values of Gaussian function as activation function are selected. And the PSO-based RBF neural networks results in a structurally optimized structure and comes with a higher level of flexibility than the one encountered in the conventional RBF neural networks. The PSO-based design procedure being applied at each node of RBF neural networks leads to the selection of preferred parameters with specific local characteristics (such as the number of input variables, a specific set of input variables, and the distribution constant value in activation function) available within the RBF neural networks. To evaluate the performance of the proposed data-centroid RBF neural network with extended polynomial function, the model is experimented with using the nonlinear process data(2-Dimensional synthetic data and Mackey-Glass time series process data) and the Machine Learning dataset(NOx emission process data in gas turbine plant, Automobile Miles per Gallon(MPG) data, and Boston housing data). For the characteristic analysis of the given entire dataset with non-linearity as well as the efficient construction and evaluation of the dynamic network model, the partition of the given entire dataset distinguishes between two cases of Division I(training dataset and testing dataset) and Division II(training dataset, validation dataset, and testing dataset). A comparative analysis shows that the proposed RBF neural networks produces model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• The KIPS Transactions:PartB
• /
• v.12B no.6 s.102
• /
• pp.715-720
• /
• 2005

This paper presents a hybrid recognition method of first moment of face image and principal component analysis(PCA). First moment is applied to reduce the dimension by shifting to the centroid of image, which is to exclude the needless backgrounds in the face recognitions. PCA is implemented by single layer neural network which has a teaming rule of Foldiak algorithm. It has been used as an alternative method for numerical PCA. PCA is to derive an orthonormal basis which directly leads to dimensionality reduction and possibly to feature extraction of face image. The proposed method has been applied to the problems for recognizing the 48 face images(12 Persons $\ast$ 4 scenes) of 64$\ast$64 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate). The negative angle has been relatively achieved more an accurate similarity than city-block or Euclidean.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1857-1866
• /
• 1989

In this paper, an algorithm to update a codebook using a neural network in consecutive images, is proposed. With the Kohonen's self-organizing feature map, we adopt the iterative technique to update a centroid of each cluster instead of the unsupervised learning technique. Because the performance of this neural model is comparable to that of the LBG algorithm, it is possible to update the codebooks of consecutive frames sequentially in TV and to realize the hardwadre on the real-time implementation basis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.691-696
• /
• 2008

A new vocoder of Code Excited Linear Predictive (CELP) based on Adaptive Multi Rate (AMR) 7.4kbit/s mode is proposed in this paper. The proposed vocoder achieves a better compression rate in an environment of Speaker Dependent Coding System (SDSC) and is efficiently used for systems, such as OGM(Outgoing message) and TTS(Text To Speech), which needs only one person's speech. In order to enhance the compression rate of a coder, a new Line Spectral Pairs(LSP) code-book is employed by using Centroid Neural Network (CNN) algorithm. In comparison with original(traditional) AMR 7.4 Kbit/s coder, the new coder shows 27% higher compression rate while preserving synthesized speech quality in terms of Mean Opinion Score(MOS).

• International Journal of Computer Science & Network Security
• /
• v.23 no.8
• /
• pp.95-100
• /
• 2023

Due to Traffic accidents people faces health and economical casualties around the world. As the population increases vehicles on road increase which leads to congestion in cities. Congestion can lead to increasing accident risks due to the expansion in transportation systems. Modern cities are adopting various technologies to minimize traffic accidents by predicting mathematically. Traffic accidents cause economical casualties and potential death. Therefore, to ensure people's safety, the concept of the smart city makes sense. In a smart city, traffic accident factors like road condition, light condition, weather condition etcetera are important to consider to predict traffic accident severity. Several machine learning models can significantly be employed to determine and predict traffic accident severity. This research paper illustrated the performance of a hybridized neural network and compared it with other machine learning models in order to measure the accuracy of predicting traffic accident severity. Dataset of city Leeds, UK is being used to train and test the model. Then the results are being compared with each other. Particle Swarm optimization with artificial neural network (PSO-ANN) gave promising results compared to other machine learning models like Random Forest, Naïve Bayes, Nearest Centroid, K Nearest Neighbor Classification. PSO- ANN model can be adopted in the transportation system to counter traffic accident issues. The nearest centroid model gave the lowest accuracy score whereas PSO-ANN gave the highest accuracy score. All the test results and findings obtained in our study can provide valuable information on reducing traffic accidents.