• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.22-33
• /
• 2005

In this paper, an efficient signal interference control technique to improve the high convergence speed of LMS algorithms is introduced in the adaptive transversal filter of DS/SS. The convergence characteristics of the proposed algorithm, whose coefficients are multiply adapted in a symbol time period by recycling the received data, is analyzed to prove theoretically the improvement of high convergence speed. According as the step-size parameter ${\mu}$ is increased, the rate of convergence of the algorithm is controlled. Also, an increase in the stop-size parameter ${\mu}$ has the effect of reducing the variation in the experimentally computed learning curve. Increasing the eigenvalue spread has the effect of controlling which is downed the rate of convergence of the adaptive equalizer. Increasing the steady-state value of the average squared error, proposed algorithm also demonstrate the superiority of signal interference control to the filter algorithm increasing convergence speed by (B+1) times due to the data-recycling LMS technique.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.161-169
• /
• 1996

This paper presents a new search region prediction method using vector quantization for the motion estimation. We find motion vectors using the full search BMA from two successive frame images first. Then the motion vectors are used for training a codebook. The trained codebook is the predicted search region. We used the unsupervised neural network for VQ encoding and codebook design. A major advantage of formulating VQ as neural networks is that the large number of adaptive training algorithm that are used for neural networks can be applied to VQ. The proposed method reduces the computation and reduce the bits required to represent the motion vectors because of the smaller search points. The computer simulation results show the increased PSNR as compared with the other block matching algorithms.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2003.10a
• /
• pp.125-130
• /
• 2003

This Paper describes a Nonlinear adoptive noise canceller using Neural Network for Machine Tools Controller System. Back-Propagation Learning Algorithm based MLP (Multi Layer Perceptron)is used an adaptive filters. In this Paper. it assume that the noise of primary input in the adaptive noise canceller is not the same characteristic as that of the reference input. Experimental results show that the neural network base noise canceller outperforms the linear noise canceller. Especially to make noise cancel close to realtime, Primary Input is divided by Unit and each divided pan is processed for very short time than all the processed data are unified to whole data.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.7
• /
• pp.103-108
• /
• 2007

Neural network is used in many fields of control systems currently. However, It is not easy to obtain input-output pattern when neural network is used for the system of a single feedback controller and it is difficult to get satisfied performance with neural network when load changes rapidly or disturbance is applied. To resolve these problems, this paper proposes a new mode to implement a neural network controller by installing a real object in place of activation function of Neural Network output node. As the Neural Network self adaptive control system is designed in simple structure neural network input-output pattern problem is solved naturally and real tin Loaming becomes possible through general back propagation algorithm. The effect of the proposed Neural Network self adaptive control algorithm was verified in a test of controlling the speed of a A.C. servo motor equipped with a high speed computing capable DSP (TMS320C32) on which the proposed algorithm was loaded.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1656-1666
• /
• 1999

The more complex and large digital circuits become, the more important delay test becomes which guarantees that circuits operate in time. In this paper, the proposed algorithm is developed, which enable the fast indirect implication for efficient test pattern generation in sequential circuits of standard scan environment. Static learning algorithm enables application of a new implication value using contrapositive proposition. The static learning procedure found structurally, analyzes the gate structure in the preprocessing phase and store the information of learning occurrence so that it can be used in the test pattern generation procedure if it satisfies the implication condition. If there exists a signal line which include all paths from some particular primary inputs, it is a partitioning point. If paths passing that point have the same partial path from primary input to the signal or from the signal to primary output, they will need the same primary input values which separated by the partitioning point. In this paper test pattern generation can be more effective by using this partitioning technique. Finally, an efficient delay fault test pattern generator using indirect implication is developed and the effectiveness of these algorithms is demonstrated by experiments.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.46-54
• /
• 2006

Recently, the important of a personal identification is increasing according to expansion using each on-line commercial transaction and personal ID-card. Although a personal ID-card embedded RFID(Radio Frequency Identification) tag is gradually increased, the way for a person's identification is deficiency. So we need automatic methods. Because RFID tag is vary small storage capacity of memory, it needs effective feature extraction method to store personal biometrics information. We need new recognition method to compare each feature. In this paper, we studied the face verification system using Hippocampal neuron modeling algorithm which can remodel the hippocampal neuron as a principle of a man's brain in engineering, then it can learn the feature vector of the face images very fast. and construct the optimized feature each image. The system is composed of two parts mainly. One is feature extraction using NMF(Non-negative Matrix Factorization) and LDA(Linear Discriminants Analysis) mixture algorithm and the other is hippocampal neuron modeling and recognition simulation experiments confirm the each recognition rate, that are face changes, pose changes and low-level quality image. The results of experiments, we can compare a feature extraction and learning method proposed in this paper of any other methods, and we can confirm that the proposed method is superior to the existing method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.95-102
• /
• 2005

In this paper, we propose a user friendly object-based image retrieval system using the interaction between cortex and hippocampus. Most existing ways of queries in content-based image retrieval rely on query by example or query by sketch. But these methods of queries are not adequate to needs of people's various queries because they are not easy for people to use and restrict. We propose a method of automatic color object extraction using CSB tree map(Color and Spatial based Binary をn map). Extracted objects were transformed to bit stream representing information such as color, size and location by region labelling algorithm and they are learned by the hippocampal neural network using the interplay between cortex and hippocampus. The cells of exciting at peculiar features in brain generate the special sign when people recognize some patterns. The existing neural networks treat each attribute of features evenly. Proposed hippocampal neural network makes an adaptive fast content-based image retrieval system using excitatory learning method that forwards important features to long-term memories and inhibitory teaming method that forwards unimportant features to short-term memories controlled by impression.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.254-257
• /
• 2014

Recently, various applications using real-time face detection have been developed as face recognition technology and hardware grows. While network service is developing and video instruments costs lower, it is needed that smart surveillance camera and service using network camera based on IP and face detection technology. However, videos should be compressed for reducing network bandwidth and storage capacity in surveillance system. As it requires high-level improvement of system performance when all the compressed frames are processed in a face detection program, fast face detection method is needed. In this paper, not only a fast way of algorithm using Haar like features and adaboost learning and motion information but also an application on broadcast system is suggested.

• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.264-272
• /
• 2010

Example-based super resolution is a method to restore a high resolution image from low resolution images through training and retrieval of image patches. It is not only good in its performance but also available for a single frame low-resolution image. However, its time complexity is very high because it requires lots of comparisons to retrieve image patches in restoration process. In order to improve the restoration speed, an efficient patch retrieval algorithm is essential. In this paper, we applied various high-dimensional feature retrieval methods, available for the patch retrieval, to a practical example-based super resolution system and compared their speed. As well, we propose to apply the multi-phase candidate reduction approach to the patch retrieval process, which was successfully applied in character recognition fields but not used for the super resolution. In the experiments, LSH was the fastest among conventional methods. The multi-phase candidate reduction method, proposed in this paper, was even faster than LSH: For $1024{\times}1024$ images, it was 3.12 times faster than LSH.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.06a
• /
• pp.200-203
• /
• 2016

최근 자율주행자동차에 대한 관심이 증가함에 따라 교통 상황을 인식하는 방법에 대한 연구도 활발하게 진행되고 있다. 특히 교통신호등의 인식은 치명적인 결과를 야기하는 교통사고와 밀접하게 연관된다는 점에서 중요성이 더욱 부각되고 있다. 본 논문에서는 컴퓨터 비전 시스템을 기반으로 한 교통신호등 인식 방법을 제안한다. 차선, 표지판 등과는 다르게 교통신호등은 빛을 발하는 특징이 있으며 그 모양과 형태 또한 규격화 되어 있다. 이러한 특징 중 색상과 형태 특징을 이용하여 두 단계의 추출과정을 거쳐 교통신호등을 인식한다. 먼저 HSV 색 공간에서 적색, 녹색, 주황색의 빛을 발하는 영역을 찾아낸 뒤, 신호의 원형 특징을 이용해 가로, 세로 사이즈와 크기로 신호의 후보를 추출한다. 다음, 신호등의 검은 박스 영역을 찾기 위해 추출한 신호 후보군의 주변부가 검정색인지를 확인한다. 최종적으로 신호등의 박스 부분을 검출하여 신호를 발하는 위치를 기반으로 신호를 인식한다. 실험결과 많은 계산량을 요구하는 기계학습을 사용하지 않고도 실시간 처리와 높은 인식률로 교통 신호를 인식할 수 있음을 확인하였다.