• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.289-300
• /
• 2003

In this paper, we introduce an identification method in Fuzzy Relation-based Fuzzy Neural Networks (FRFNN) through a hybrid identification algorithm. The proposed FRFNN modeling implement system structure and parameter identification in the efficient form of "If...., then... " statements, and exploit the theory of system optimization and fuzzy rules. The FRFNN modeling and identification environment realizes parameter identification through a synergistic usage of genetic optimization and complex search method. The hybrid identification algorithm is carried out by combining both genetic optimization and the improved complex method in order to guarantee both global optimization and local convergence. An aggregate objective function with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. The proposed model is experimented with using two nonlinear data. The obtained experimental results reveal that the proposed networks exhibit high accuracy and generalization capabilities in comparison to other models.er models.

• Journal of Drive and Control
• /
• v.11 no.4
• /
• pp.32-38
• /
• 2014

The hydraulic fuse, which responds to the suddenly increased flow on rupture of a line and shuts off the fluid flow, would prevent large spillage of liquid. The quick-acting hydraulic fuse, which is mainly composed of a poppet, a seat, and a spring, must be designed to minimize the leaked flow and to prevent high collision speed between the poppet and seat during fuse operation on a line rupture. The optimal design parameters of a quick-acting hydraulic fuse were searched using the genetic algorithm and the complex method that are kinds of constrained direct search methods. The dynamic behavior of a quick-acting hydraulic fuse was researched using computer simulations that applied the obtained optimal design parameters.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.2
• /
• pp.97-102
• /
• 2015

In this paper, an extension of the standard common spatial pattern (CSP) algorithm using the strong uncorrelated transform (SUT) is used in order to extract the features for an accurate classification of the left- and right-hand motor imagery tasks. The algorithm is designed to analyze the complex data, which can preserve the additional information of the relationship between the two electroencephalogram (EEG) data from distant channels. This is based on the fact that distant regions of the brain are spatially distributed spatially and related, as in a network. The real-world left- and right-hand motor imagery EEG data was acquired through the Physionet database and the support vector machine (SVM) was used as a classifier to test the proposed method. The results showed that extracting the features of the pair-wise channel data using the strong uncorrelated transform complex common spatial pattern (SUTCCSP) provides a higher classification rate compared to the standard CSP algorithm.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.111-125
• /
• 2011

Clustering is a process of grouping similar or relevant documents into a cluster and assigning a meaningful concept to the cluster. By this process, clustering facilitates fast and correct search for the relevant documents by narrowing down the range of searching only to the collection of documents belonging to related clusters. For effective clustering, techniques are required for identifying similar documents and grouping them into a cluster, and discovering a concept that is most relevant to the cluster. One of the problems often appearing in this context is the detection of a complex concept that overlaps with several simple concepts at the same hierarchical level. Previous clustering methods were unable to identify and represent a complex concept that belongs to several different clusters at the same level in the concept hierarchy, and also could not validate the semantic hierarchical relationship between a complex concept and each of simple concepts. In order to solve these problems, this paper proposes a new clustering method that identifies and represents complex concepts efficiently. We developed the Hierarchical Overlapping Clustering (HOC) algorithm that modified the traditional Agglomerative Hierarchical Clustering algorithm to allow overlapped clusters at the same level in the concept hierarchy. The HOC algorithm represents the clustering result not by a tree but by a lattice to detect complex concepts. We developed a system that employs the HOC algorithm to carry out the goal of complex concept detection. This system operates in three phases; 1) the preprocessing of documents, 2) the clustering using the HOC algorithm, and 3) the validation of semantic hierarchical relationships among the concepts in the lattice obtained as a result of clustering. The preprocessing phase represents the documents as x-y coordinate values in a 2-dimensional space by considering the weights of terms appearing in the documents. First, it goes through some refinement process by applying stopwords removal and stemming to extract index terms. Then, each index term is assigned a TF-IDF weight value and the x-y coordinate value for each document is determined by combining the TF-IDF values of the terms in it. The clustering phase uses the HOC algorithm in which the similarity between the documents is calculated by applying the Euclidean distance method. Initially, a cluster is generated for each document by grouping those documents that are closest to it. Then, the distance between any two clusters is measured, grouping the closest clusters as a new cluster. This process is repeated until the root cluster is generated. In the validation phase, the feature selection method is applied to validate the appropriateness of the cluster concepts built by the HOC algorithm to see if they have meaningful hierarchical relationships. Feature selection is a method of extracting key features from a document by identifying and assigning weight values to important and representative terms in the document. In order to correctly select key features, a method is needed to determine how each term contributes to the class of the document. Among several methods achieving this goal, this paper adopted the $x^2$�� statistics, which measures the dependency degree of a term t to a class c, and represents the relationship between t and c by a numerical value. To demonstrate the effectiveness of the HOC algorithm, a series of performance evaluation is carried out by using a well-known Reuter-21578 news collection. The result of performance evaluation showed that the HOC algorithm greatly contributes to detecting and producing complex concepts by generating the concept hierarchy in a lattice structure.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.8
• /
• pp.746-751
• /
• 2006

In this paper, we present tracking algorithm for the indoor moving object. We research passive method using a camera and image processing. It had been researched to use dynamic based estimators, such as Kalman Filter, Extended Kalman Filter and Particle Filter for tracking moving object. These algorithm have a good performance on real-time tracking, but they have a limit. If the shape of object is changed or object is located on complex background, they will fail to track them. This problem will need the complicated image processing algorithm. Finally, a large algorithm is made from integration of dynamic based estimator and image processing algorithm. For eliminating this inefficiency problem, image based estimator, Mean-shift Algorithm is suggested. This algorithm is implemented by color histogram. In other words, it decide coordinate of object's center from using probability density of histogram in image. Although shape is changed, this is not disturbed by complex background and can track object. This paper shows the results in real camera system, and decides 3D coordinate using the data from mean-shift algorithm and relationship of real frame and camera frame.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.479-486
• /
• 2016

In this paper, the algorithm which can convert a 2D image into a 3D Model will be discussed. The 2D picture drawn by a user is scanned for image processing. The Canny algorithm is employed to find the contour. The waterfront algorithm is proposed to find foreground image area. The foreground area is segmented to decompose the complex shapes into simple shapes. Then, simple segmented foreground image is converted into 3D model to become a complex 3D model. The 3D conversion formular used in this paper is also discussed. The generated 3D model data will be useful for 3D animation and other 3D contents creation.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.41-44
• /
• 2000

In this paper, we present an efficient face detection algorithm for locating vertical views of human faces in complex scenes. The algorithm models the distribution of human skin color in YCbCr color space and find various ace candidate regions. Face candidate regions are found by thresholding with predetermined thresholds. For each of these face candidate regions, The sobel edge operator is used to find edge regions. For each edge region, we used an ellipse detection algorithm which is similar to hough transform to refine the candidate region. Finally if a substantial number of he facial features (eye, mouth) are found successfully in the candidate region, we determine he ace candidate region as a face region. e show empirically that the presented algorithm an find the face region very well in the complex scenes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.35-45
• /
• 1998

Scheduling problem in Flexible Manufacturing Systems(FMS) is complex because of various situation of Manufacturing Systems. Especially, in case of short-term scheduling demanding high efficiency, low cost at short-period, efficient scheduling is a serious problem. To solve this problem, many dispatching rules are developed. But, it leave much to be desired, because real situation in shop floor is complex and real-time scheduling is needed in real manufacturing shop floor. In this paper, search algorithm that allocate different dispatching rules to each machine is presented to complement lack of dispatching rule and develop practical real-time scheduling system. The search algorithm is described in detail. First, algorithm detect machine breakdown, evaluate each dispatching rule. dispatching rules for each machine meeting performance criteria are ranked. The algorithm selects new dispatching nile for bottleneck machine. The effectivenes and efficiency of the mixed dispatching rule and search algorithm is demonstrated.

• Journal of Auto-vehicle Safety Association
• /
• v.11 no.3
• /
• pp.19-29
• /
• 2019

Recently, autonomous vehicles have been studied actively. Autonomous vehicles can detect objects around them using their on board sensors, estimate collision probability and maneuver to avoid colliding with objects. Many algorithms are suggested to prevent collision avoidance. However there are limitations of complex and diverse environments because algorithm uses only the information of attached environmental sensors and mainly depends on TTC (time-to-Collision) parameter. In this paper, autonomous driving algorithm using I2V communication-based cooperative sensing information is developed to cope with complex and diverse environments through sensor fusion of objects information from infrastructure camera and object information from equipped sensors. The cooperative sensing based autonomous driving algorithm is implemented in autonomous shuttle bus and the proposed algorithm proved to be able to improve the autonomous navigation technology effectively.

• ETRI Journal
• /
• v.44 no.3
• /
• pp.379-388
• /
• 2022

This study proposes a novel low-complexity algorithm for computing inverse fast Fourier transform (IFFT)/fast Fourier transform (FFT) operations in binary phase shift keying-modulated orthogonal frequency division multiplexing (OFDM) communication systems without requiring any twiddle factor multiplications. The peak-to-average power ratio (PAPR) reduction capacity of an efficient PAPR reduction technique, that is, H-SLM method, is evaluated using the proposed IFFT algorithm without any complex multiplications, and the impact of oversampling factor for the accurate calculation of PAPR is analyzed. The power spectral density of an OFDM signal generated using the proposed multiplierless IFFT algorithm is also examined. Moreover, the bit-error-rate performance of the H-SLM technique with the proposed IFFT/FFT algorithm is compared with the classical methods. Simulation results show that the proposed IFFT/FFT algorithm used in the H-SLM method requires no complex multiplications, thereby minimizing power consumption as well as the area of IFFT/FFT processors used in OFDM communication systems.