• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.33-38
• /
• 2014

The FCM based hybrid RBF network is a heterogeneous learning network model that applies FCM algorithm between input and middle layer and applies Max_Min algorithm between middle layer and output. The Max-Min neural network uses winner nodes of the middle layer as input but shows inefficient learning in performance when the input vector consists of too many patterns. To overcome this problem, we propose a dynamic learning rate control based on fuzzy logic. The proposed method first classifies accurate/inaccurate class with respect to the difference between target value and output value with threshold and then fuzzy membership function and fuzzy decision logic is designed to control the learning rate dynamically. We apply this proposed RBF network to the character recognition problem and the efficacy of the proposed method is verified in the experiment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1630-1636
• /
• 2022

The results of current method of traffic sign detection gets hindered by environmental conditions and the traffic sign's condition as well. Therefore, in this paper, we propose a method of improving detection performance of damaged traffic signs by utilizing Hopfield Network and Fuzzy Max-Min Neural Network. In this proposed method, the characteristics of damaged traffic signs are analyzed and those characteristics are configured as the training pattern to be used by Fuzzy Max-Min Neural Network to initially classify the characteristics of the traffic signs. The images with initial characteristics that has been classified are restored by using Hopfield Network. The images restored with Hopfield Network are classified by the Fuzzy Max-Min Neural Network onces again to finally classify and detect the damaged traffic signs. 8 traffic signs with varying degrees of damage are used to evaluate the performance of the proposed method which resulted with an average of 38.76% improvement on classification performance than the Fuzzy Max-Min Neural Network.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.541-556
• /
• 2005

The memory access latency of the system has been a primary factor of performance degradation in single-processor system and multi-processor system. The remote memory access latency takes a lot of overhead over the local memory access latency especially in the distributed shared-memory system. To resolve this problem, the multi-level cache architecture that contains a remote cache in the multi-processor system has been proposed. In this paper, we propose a new cache replacement policy that improves the performance of the multi-processor system with the remote cache. If the multi-level cache keeps the multi-level inclusion(MLI) property and uses the LRU(Least Recently Used) cache replacement policy, the LRU information of the higher-level cache(a processor cache) would be different with that of the lower-level cache(a remote cache). In this situation, the replacement of a remote cache line can induce the exchange of a processor cache line that is used by the processor. It is a main factor of performance degradation in a whole system. To alleviate this disadvantage of the LRU replacement polity, the new policy analyses tht processor's remote memory access pattern of each node and uses this information to reduce the number of invalidations of the useful cache line in the higher-level cache. The new replacement policy of the remote cache can improve the performance by $3.5\%$ in maximum and $2.5\%$ in average on SPLASH-2 benchmarks, compared to the general LRU cache replacement policy.

• Journal of Digital Convergence
• /
• v.10 no.8
• /
• pp.173-178
• /
• 2012

In the generated model for the recognition vocabulary, tri-phones which is not make preparations are produced. Therefore this model does not generate an initial estimate of parameter words, and the system can not configure the model appear as disadvantages. As a result, the sophistication of the Gaussian model is fall will degrade recognition. In this system, we propose the error correction system using out-of vocabulary rejection algorithm. When the systems are creating a vocabulary recognition model, recognition rates are improved to refuse the vocabulary which is not registered. In addition, this system is seized the lexical analysis and meaning using probability distributions, and this system deactivates the string before phoneme change was applied. System analysis determine the rate of error correction using phoneme similarity rate and reliability, system performance comparison as a result of error correction rate improve represent 2.8% by method using error patterns, fault patterns, meaning patterns.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.748-753
• /
• 2012

In this paper, Face recognition algorithm is designed based on optimized pRBFNNs pattern classifier using three-dimensional scanner. Generally two-dimensional image-based face recognition system enables us to extract the facial features using gray-level of images. The environmental variation parameters such as natural sunlight, artificial light and face pose lead to the deterioration of the performance of the system. In this paper, the proposed face recognition algorithm is designed by using three-dimensional scanner to overcome the drawback of two-dimensional face recognition system. First face shape is scanned using three-dimensional scanner and then the pose of scanned face is converted to front image through pose compensation process. Secondly, data with face depth is extracted using point signature method. Finally, the recognition performance is confirmed by using the optimized pRBFNNs for solving high-dimensional pattern recognition problems.

• The Journal of Korean Institute of Information Technology
• /
• v.16 no.12
• /
• pp.75-83
• /
• 2018

Recently, autonomous vehicles have been actively studied. Pedestrian detection and recognition technology is important in autonomous vehicles. Pedestrian detection using CNN(Convolutional Neural Netwrok), which is mainly used recently, generally shows good performance, but there is a performance degradation depending on the environment of the image. In this paper, we propose a pedestrian detection system applying long-term memory structure of hippocampal neural network based on CNN network with LGP-FL (Local Gradient Pattern-Feature Layer) added. First, change the input image to a size of $227{\times}227$. Then, the feature is extracted through a total of 5 layers of convolution layer. In the process, LGP-FL adds the LGP feature pattern and stores the high-frequency pattern in the long-term memory. In the detection process, it is possible to detect the pedestrian more accurately by detecting using the LGP feature pattern information robust to brightness and color change. A comparison of the existing methods and the proposed method confirmed the increase of detection rate of about 1~4%.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.551-555
• /
• 2010

In protein 2-DE image analysis, the accuracy of spot-matching operation which identifies the spot of the same protein in each 2-DE gel image is intensively influenced by the errors caused by the various experimental conditions. This paper proposes an efficient method to find more accurate spot-matching patterns based on multiple reference gel images in spot-matching pattern analysis in protein 2-DE image analysis. Additionally, in order to improve the reduce the execution time which is increased exponentially along with the increasing number of gel images, a "partition then extension" framework is used to find spot-matching pattern of long length and of higher accuracy. In the experiments on real 2-DE images of human liver tissue are used to confirm the accuracy and the efficiency of the proposed algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.81-86
• /
• 2011

In one of the most impacting schemes proposed to address the TCP throughput problem over network coding, the network coding layer sends an acknowledgement if an innovative linear combination is received, even when a new packet is not decoded. Although this scheme is very effective, its implementation requires a limit on the coding window size. This limitation causes low TCP throughput in the presence of packet reordering. We argue that a TCP variant detecting a packet loss relying only on timers is effective in dealing with the packet reordering problem in network coding environments as well. Also we propose a new network coding layer to support such a TCP variant. Simulation results for a 2-path environment show that our proposed scheme improves TCP throughput by 19%.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.69-85
• /
• 2006

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile clients over a single or multiple channels. Conventional concurrency control protocols for mobile transactions are not suitable for the wireless broadcast environments due to the limited bandwidth of the up-link communication channel. In wireless broadcast environments, the server often broadcast different data items with different frequency to incorporate the data access patterns of mobile transactions. The previously proposed concurrency control protocols for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. However, these protocols perform poorly when the data access pattern of update mobile transaction are not uniform but skewed. The update mobile transactions with skewed data access patterns will be frequently aborted and restarted due 4o the update conflict of the same data items with a high access frequency. In this paper, we propose an energy-efficient concurrence control protocol for mobile transactions with skewed data access as well as uniform data access patterns. Our protocol use a random back-off technique to avoid the frequent abort and restart of update mobile transactions. We present in-depth experimental analysis of our method by comparing it with existing concurrency control protocols. Our performance analysis show that it significantly decrease the average response time, the amount of upstream and downstream bandwidth usage over existing protocols.

• Smart Media Journal
• /
• v.5 no.4
• /
• pp.18-25
• /
• 2016

Virtualized hardware resources provides efficiency in use and easy of management. Based on the benefits, virtualization techniques are used to build large server clusters and cloud systems. The performance of a virtualized system is significantly affected by the virtual machine scheduler. However, the existing virtual machine scheduler have a problem in that the I/O response is reduced in accordance with the scheduling delay becomes longer. In this paper, we introduce the Loan/Redemption mechanism of a virtual machine scheduler in order to improve the responsiveness to I/O events. The proposed scheme gives additional credits for to virtual machines and classifies the task characteristics of each virtual machine by analyzing the credit consumption pattern. When an I/O event arrives, the scheduling priority of a virtual machine is temporally increased based on the analysis. The evaluation based on the implementation shows that the proposed scheme improves the I/O response 60% and bandwidth of virtual machines 62% compared to those of the existing virtual machine scheduler.