• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.4
• /
• pp.7-14
• /
• 2010

Stable-state behaviors of asynchronous sequential machines represented as finite state machines can be corrected by feedback control schemes. In this paper, we propose a state feedback control scheme for input/state asynchronous machines with uncertain transitions. The considered asynchronous machine is deterministic, but its state transition function is partially known due to model uncertainty or inner logic errors. The control objective is to compensate the behavior of the closed-loop system so that it matches a sub-behavior of a prescribed model despite uncertain transitions. Furthermore, during the execution of corrective action, the controller reflects the exact knowledge of transitions into the next step, i.e., the range of the behavior of the closed-loop system can be enlarged through learning. The design procedure for the proposed controller is described in a case study.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.53-60
• /
• 2012

In this paper, we proposes a new document summarization method using the expanded query by wikipedia and the semantic feature representing inherent structure of document set. The proposed method can expand the query from user's initial query using the relevance feedback based on wikipedia in order to reflect the user require. It can well represent the inherent structure of documents using the semantic feature by the non-negative matrix factorization (NMF). In addition, it can reduce the semantic gap between the user require and the result of document summarization to extract the meaningful sentences using the expanded query and semantic features. The experimental results demonstrate that the proposed method achieves better performance than the other methods to summary document.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.54-62
• /
• 2007

In this paper, we significantly reduces the amount of computation for intra 16$\times$16 mode decision in H.264 by applying the fast algorithm, which obtains the transformed prediction residual with fewer computations. By extending the existing intra 4$\times$4 mode decision, we propose the new algorithm for fast intra 16$\times$16 mode decision. The proposed algorithm uses partial transform coefficients which consist of one DC and three adjacent AC coefficients after 4$\times$4 transform in the intra 16$\times$16 mode decision. Theoretical analysis and experimental results show that the proposed algorithm can reduce computations up to 50% in the intra 16$\times$16 mode decision process with unnoticeable degradation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.84-92
• /
• 2007

The gait recognition is presented for human identification from a sequence of noisy silhouettes segmented from video by capturing at a distance. The proposed gait recognition algorithm gives better performance than the baseline algorithm because of segmentation of the object by using multiple modules; i) motion detection, ii) object region detection, iii) head detection, and iv) active shape models, which solve the baseline algorithm#s problems to make background, to remove shadow, and to be better recognition rates. For the experiment, we used the HumanID Gait Challenge data set, which is the largest gait benchmarking data set with 122 objects, For realistic simulation we use various values for the following parameters; i) viewpoint, ii) shoe, iii) surface, iv) carrying condition, and v) time.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.32 no.4
• /
• pp.28-38
• /
• 2004

Korean goral (Nemorhaedus caudatus raddeanus) is one of the endangered species in Korea, and the rugged terrain of the Soraksan National Park (373㎢) is a critical habitat for the species. But the goral population is threatened by habitat fragmentation caused by roads and hiking trails. The objective of this study was to develop a potential habitat suitability model for Korean goral in the park, and the model was based on the concepts of fuzzy set theory and multi-criteria evaluation. The process of the suitability modeling could be divided into three steps. First, data for the modeling was collected by using field work and a literature survey. Collected data included 204 points of GPS data obtained through a goral trace survey and through the number of daily visitors to each hiking trail during the peak season of the park. Second, fuzzy set theory was employed for building a GIS data base related to environmental factors affecting the suitability of the goral habitat. Finally, a multiple-criteria evaluation was performed as the final step towards a goral habitat suitability model. The results of the study were as follows. First, characteristics of suitable habitats were the proximity to rock cliffs, scattered pine (Pinus densiflora) patches, ridges, the elevation of 700∼800m, and the aspect of south and southeast. Second, the habitat suitability model had a high classification accuracy of 93.9％ for the analysis site, and 95.7％ for the validation site at a cut off value of 0.5. Finally, 11.7％ of habitatwith more than 0.5 of habitat suitability index was affected by roads and hiking trails in the park.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.38 no.3
• /
• pp.211-217
• /
• 2014

This study analyzes the nonlinear interaction between two different vortex shedding frequencies from a cylinder with two diameters. In particular, two different vortex shedding frequencies are generated by preparing a cylinder having two diameters artificially. Flow velocity fluctuations behind the cylinder are measured three-dimensionally. Additionally, we fabricated a hole and placed a pressure transducer for measuring the pressure on the cylinder surface. The pressure signal from the pressure transducer is used as basic signal. A TSC(Trans Spectrum Coherence) is used for checking the strength of the nonlinear interaction between two different vortex shedding frequencies. As a result, the following are clarified: i) frequency distribution behind the cylinder, ii) three-dimensional flow state behind the cylinder through calculation of ensemble average, and iii) close relationship between the vertical vortex and change of low frequency by nonlinear interaction between two different vortex shedding frequencies from the cylinder with two diameters.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.193-201
• /
• 2014

This paper suggests a facial expression recognition system using face detection, face alignment, facial unit extraction, and training and testing algorithms based on AdaBoost classifiers. First, we find face region by a face detector. From the results, face alignment algorithm extracts feature points. The facial units are from a subset of action units generated by combining the obtained feature points. The facial units are generally more effective for smaller-sized databases, and are able to represent the facial expressions more efficiently and reduce the computation time, and hence can be applied to real-time scenarios. Experimental results in real scenarios showed that the proposed system has an excellent performance over 90% recognition rates.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.9-16
• /
• 2008

For the efficient routing on a Sensor Network, one may consider a deployment problem to interconnect the sensor nodes optimally. There is an analogous theoretic problem: the Steiner Tree problem of finding the tree that interconnects given points on a plane optimally. One may use the approximation algorithm for the problem to find out the deployment that interconnects the sensor nodes almost optimally. However, the Steiner Tree problem is to interconnect mathematical set of points on a Euclidean plane, and so involves particular cases that do not occur on Sensor Networks. Thus the approach of using the algorithm does not make a proper way of analysis. Differently from the randomly given locations of mathematical points on a Euclidean plane, the locations of sensors on Sensor Networks are assumed to be physically dispersed over some moderate distance with each other. By designing an approximation algorithm for the Sensor Networks in terms of that physical property, one may produce the execution time and the approximation ratio to the optimality that are appropriate for the problem of interconnecting Sensor Networks.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.5
• /
• pp.1-10
• /
• 2000

In this paper, we propose a Fuzzy Classifier System(FCS) makes the classifier system be able to carry out the mapping from continuous inputs to outputs. The FCS is based on the fuzzy controller system combined with machine learning. Therefore the antecedent and consequent of a classifier in FCS are the same as those of a fuzzy rule. In this paper, the FCS modifies input message to fuzzified message and stores those in the message list. The FCS constructs rule-base through matching between messages of message list and classifiers of fuzzy classifier list. The FCS verifies the effectiveness of classifiers using Bucket Brigade algorithm. Also the FCS employs the Genetic Algorithms to generate new rules and modify rules when performance of the system needs to be improved. Then the FCS finds the set of the effective rules. We will verify the effectiveness of the poposed FCS by applying it to Autonomous Mobile Robot avoiding the obstacle and reaching the goal.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.627-629
• /
• 2017

There are a lot of research results on the problem of finding the union and intersection of n rectangles on a plane. Lipski와 Preparata(1981) presented a sequential algorithm with O(nlogn) time and O(nlogn) space for the problem of finding the union of rectangles whose sides are parallel to the coordinate axes[1]. Alevizos(2013) presented an improved O(nlogn) time and O(n) space algorithm for the same problem[2]. In this paper, we consider the problem of finding the union of iso-oriented rectangles such that the intersection of them is not an empty set. In this case, the union of the rectangles becomes a connected area, that is, an orthogonal polygon. In this paper, we propose a parallel algorithm that solves this problem in constant time in a reconfigurable mesh(in short, RMESH) model.