• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.269-281
• /
• 2001

This thesis deals with a novel font-dependent Hangul recognition algorithm invariant to position translation, scaling, and rotation using circular pattern vectors. The proposed algorithm removes noise from input letters using binary morphology and generates the circular pattern vectors. The generated circular pattern vectors represent spatial distributions on several concentric circles from the center of gravity in a given letter. Then the algorithm selects the letter minimizing the distance between the reference vectors and the generated circular pattern vectors. In order to estimate performances of the proposed algorithm, the completed Batang Hangul 2,350 letters were used as test images with scaling and rotational transformations. Experimental results show that the proposed algorithm are better than conventional algorithm using the ring projection in the recognition rates of Hangul letters with scaling and rotational transformation.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.5
• /
• pp.16-23
• /
• 2010

This paper presents 6bit 250MS/s flash A/D converter which can be applied to wireless communication system. To solve the problem of large power consumption in flash A/D converter, control algorithm by input signal level is used in comparator stage. Also, input voltage range detector circuit is used in reference resistor array to minimize the dynamic power consumption in the comparator. Compared with the conventional A/D converter, the proposed A/D converter shows 4.3% increase of power consumption in analog and a seventh power consumption in digital, which leads to a half of power consumption in total. The A/D converter is implemented in a $0.18{\mu}m$ CMOS 1-poly 6-metal technology. The measured results show 106mW power dissipation with 1.8V supply voltage. It shows 4.1bit ENOB at sampling frequency 250MHz and 30.27MHz input frequency.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.104-113
• /
• 2000

In this study, we propose facial image recognition based on wavelet transform and neural network. This algorithm is proposed by following processes. First, two gray level images is captured in constant illumination and, after removing input image noise using a gaussian filter, differential image is obtained between background and face input image, and this image has a process of erosion and dilation. Second, a mask is made from dilation image and background and facial image is divided by projecting the mask into face input image Then, characteristic area of square shape that consists of eyes, a nose, a mouth, eyebrows and cheeks is detected by searching the edge of divided face image. Finally, after characteristic vectors are extracted from performing discrete wavelet transform(DWT) of this characteristic area and is normalized, normalized vectors become neural network input vectors. And recognition processing is performed based on neural network learning. Simulation results show recognition rate of 100 % about learned image and 92% about unlearned image.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.53-60
• /
• 1998

In this paper, we proposed a set of ANSI-Korean character patterns for handwriting recognition that can be used as an input method of mobile computers like PDA (Personal Digital Assistant). In the case of bilinguals, two kinds of alphabets are written alternatively So the method of input character mode change must be provided, and this cause discomfort of writing. Our proposed written character patterns have some constraint but permit ANSI-Korean mixed writing without mode change keeping original form of alphabets and can be recognized with simple algorithm relatively. For ANSI character we analysis Graffiti and propose new writing pattern, which is more similar to original form. There are many researches about input method of unpacking Korean character and writing patterns. But they are not widely used because it's excessively contrary to original form of Korean characters. To show our proposed writing patterns usefulness, we studied the satisfaction and easiness of writing and the recognition rates. Writers are divided into two groups; PDA users, familiar to Graffiti, and others. The results satisfy usefulness in the both groups.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.531-540
• /
• 2008

An Adaptive Random Testing(ART) is one of test case generation algorithms, which was designed to get better performance in terms of fault-detection capability than that of Random Testing(RT) algorithm by locating test cases in evenly spreaded area. Two ART algorithms, such as Distance-based ART(D-ART) and Restricted Random Testing(RRT), had been indicated that they have significant drawbacks in computations, i.e., consuming quadratic order of runtime. To reduce the amount of computations of D-ART and RRT, iterative partitioning of input domain strategy was proposed. They achieved, to some extent, the moderate computation cost with relatively high performance of fault detection. Those algorithms, however, have yet the patterns of non-uniform distribution in test cases, which obstructs the scalability. In this paper we analyze the distribution of test cases in an iterative partitioning strategy, and propose a new method of input domain enlargement which makes the test cases get much evenly distributed. The simulation results show that the proposed one has about 3 percent of improvement in terms of mean relative F-measure for 2-dimension input domain, and shows 10 percent improvement for 3-dimension space.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.213-223
• /
• 2004

In this paper, we propose a new face detection method for real-time applications. It is based on the template-matching and appearance-based method. At first, we apply Min-max normalization with histogram equalization to the input image according to the variation of intensity. By applying the PCA transform to both the input image and template, PC components are obtained and they are applied to the LDA transform. Then, we estimate the distances between the input image and template, and we select one region which has the smallest distance. SVM is used for final decision whether the candidate face region is a real face or not. Since we detect a face region not the full region but within the $\pm$12 search window, our method shows a good speed and detection rate. Through the experiments with 6 category input videos, our algorithm shows the better performance than the existing methods that use only the PCA transform. and the PCA and LDA transform.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.299-308
• /
• 2009

AAM(Active Appearance Model) is an algorithm to extract face feature points with statistical models of shape and texture information based on PCA(Principal Component Analysis). This method is widely used for face recognition, face modeling and expression recognition. However, the detection performance of AAM algorithm is sensitive to initial value and the AAM method has the problem that detection error is increased when an input image is quite different from training data. Especially, the algorithm shows high accuracy in case of closed lips but the detection error is increased in case of opened lips and deformed lips according to the facial expression of user. To solve these problems, we propose the improved AAM algorithm using lip feature points which is extracted based on a new lip detection algorithm. In this paper, we select a searching region based on the face feature points which are detected by AAM algorithm. And lip corner points are extracted by using Canny edge detection and histogram projection method in the selected searching region. Then, lip region is accurately detected by combining color and edge information of lip in the searching region which is adjusted based on the position of the detected lip corners. Based on that, the accuracy and processing speed of lip detection are improved. Experimental results showed that the RMS(Root Mean Square) error of the proposed method was reduced as much as 4.21 pixels compared to that only using AAM algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.1-11
• /
• 1998

This paper describes design and implementation of the system that is used to efficiently retrieve music information at a digital music library. Unlike typical music information retrieval systems, this system allows the user to sing a part of the melody through the microphone which he/she wants to find rather than using title, composer or the subject catalog to search. The system then recognizes the musical notes information through the signal processing of the sounds of the entered melody, and the intervals contour is created based on this information and used as a search pattern. By running the proposed notes string search algorithm that uses the musical notes information processed with the user input, and it produces the approximate search results. Therefore, users are able to retrieve and appreciate the music whenever he/she can sing any portion of the desired music.

• International Journal of Automotive Technology
• /
• v.7 no.4
• /
• pp.469-475
• /
• 2006

In this paper, an optimal suspension system with preview of the road input is synthesized for a half tracked vehicle. The main goal of this research is to improve the ride comfort characteristics of a fast moving tracked vehicle in order to maintain the driver's driving capability. Several different kinds of preview control algorithms are evaluated with active or semi-active suspension systems. The road information estimated from the motion of the 1st road-wheel is adequate to make the best use of the preview control algorithm for tracked vehicles. The ride-comfort characteristics of the tracked vehicle are more dependent on pitching angular acceleration than heaving acceleration. The pitching motion is reduced by the suspension system with hard outer suspensions and soft inner suspensions. Simulation results show that the performance of sky-hook algorithms for ride comfort nearly follow that of full state feedback algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.647-666
• /
• 2009

Multiple-input multiple-output (MIMO) multiplexing is an attractive technology that increases the channel capacity without requiring additional spectral resources. The design of low complexity and high performance detection algorithms capable of accurately demultiplexing the transmitted signals is challenging. In this technical survey, we introduce the state-of-the-art MIMO detection techniques. These techniques are divided into three categories, viz. linear detection (LD), decision-feedback detection (DFD), and tree-search detection (TSD). Also, we introduce the lattice basis reduction techniques that obtain a more orthogonal channel matrix over which the detection is done. Detailed discussions on the advantages and drawbacks of each detection algorithm are also introduced. Furthermore, several recent author contributions related to MIMO detection are revisited throughout this survey.