• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1093-1102
• /
• 2003

As the use of internet is growing, the amount of information is increasing rapidly and XML that is a standard of the web data has the property of flexibility of data representation. Therefore electronic document systems based on web, such as EDMS (Electronic Document Management System), ebXML (e-business extensible Markup Language), have been adopting XML as the method for exchange and standard of documents. So research on the method which can manage and search structural XML documents in an effective wav is required. In this paper we propose the clustering method based on structural similarity among the many XML documents, using typical structures extracted from each document by sequential pattern mining in pre-clustering process. The proposed algorithm improves the accuracy of clustering by computing cost considering cluster cohesion and inter-cluster similarity.

• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.125-137
• /
• 2011

Recently the research on the system using images taken from camera phones as input is actively conducted. This paper proposed a system that shows wine pictures which are similar to the input wine label in order. For the calculation of the similarity of images, the representative color of each cell of the image, the recognized text color, background color and distribution of feature points are used as the features. In order to calculate the difference of the colors, RGB is converted into CIE-Lab and the feature points are extracted by using Harris Corner Detection Algorithm. The weights of representative color of each cell of image, text color and background color are applied. The image similarity is calculated by normalizing the difference of color similarity and distribution of feature points. After calculating the similarity between the input image and the images in the database, the images in Database are shown in the descent order of the similarity so that the effort of users to search for similar wine labels again from the searched result is reduced.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.739-745
• /
• 2017

This paper presents and discusses an implementation of the GPU shifted sorting method to find approximate k nearest neighbors which executes within "warp", the minimum execution unit in GPU parallel architecture. Also, this paper presents the comparison results with other two common nearest neighbor searching methods, GPU-based kd-tree and ANN (Approximate Nearest Neighbor) library. The proposed implementation focuses on the cases when k is small, i.e. 2, 4, 8, and 16, which are handled efficiently within warp to consider it is very common for applications to handle small k's. Also, this paper discusses optimization ways to implementation by improving memory management in a loop for the CUB open library and adopting CUDA commands which are supported by GPU hardware. The proposed implementation shows more than 16-fold speed-up against GPU-based other methods in the tests, implying that the improvement would become higher for more larger input data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1294-1301
• /
• 2014

In this paper, separate probabilistic distribution models for voiced and unvoiced speech are estimated and utilized to improve speaker recognition performance. Also, in addition to the conventional mel-frequency cepstral coefficient, skewness, kurtosis, and harmonic-to-noise ratio are extracted and used for voiced speech intervals. Two kinds of scores for voiced and unvoiced speech are linearly fused with the optimal weight found by exhaustive search. The performance of the proposed speaker recognizer is compared with that of the conventional recognizer which uses mel-frequency cepstral coefficient and a unified probabilistic distribution function based on the Gassian mixture model. Experimental results show that the lower the number of Gaussian mixture, the greater the performance improvement by the proposed algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.300-309
• /
• 2003

The Japanese developed the first Car navigation system in 1981 with the advent of Honda, which was known as the car inertial navigation system. Now days, It is possible to search the shortest route to and from places and arrival time using the internet via cell phone to the driver based on GIS and GPS. However, even with a good navigation system, it losses the shortest route when there is an average speed of the vehicle being between S-15 kilometers. Therefore, in order to improve the vehicle waiting time and average vehicle speed, we are suggesting an optimal green time algorithm using fuzzy adaptive control, where there are different traffic intersection lengths, and lanes. In this paper, to be able to assist the driver and forecast the optimal traffic information with regards to the road conditions; dangerous roads, construction work and estimation of arrival time at their destination using internet.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.131-137
• /
• 2006

In swarm robot systems, each robot must behaves by itself according to the its states and environments, and if necessary, must cooperates with other robots in order to carry out a given task. Therefore it is essential that each robot has both learning and evolution ability to adapt the dynamic environments. In this paper, the new learning and evolution method based on reinforcement learning having delayed reward ability and distributed genetic algorithms is proposed for behavior learning and evolution of collective autonomous mobile robots. Reinforcement learning having delayed reward is still useful even though when there is no immediate reward. And by distributed genetic algorithm exchanging the chromosome acquired under different environments by communication each robot can improve its behavior ability. Specially, in order to improve the performance of evolution, selective crossover using the characteristic of reinforcement learning is adopted in this paper. we verify the effectiveness of the proposed method by applying it to cooperative search problem.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.11 s.114
• /
• pp.1065-1072
• /
• 2006

An OFDM(Orthogonal Frequency Division Multiplexing) system has the problem of the PAPR(Peak-to-Average Power Ratio) due to the overlapping phenomena of many sub-carriers. The previously proposed GA-SPW(Genetic Sub-block Phase Weighting) method not only improved the reduction of PAPR as the number of sub-blocks increases in an OFDM symbol but also decreased the number of calculations involved in the iterative phase searching yields to depend on the number of population and generation by using genetic algorithm not on the number of sub-blocks and phase elements. In this paper, we propose the modified GA-SPW method in order to improve the performance and to decrease the complexity. It is shown that the proposed modified GA-SPW method achieves the significant performance and the reduction of search complexity comparing to the ordinary technique, iterative flipping and previously proposed GA-SPW by the experimental results and analysis.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.399-404
• /
• 2006

The container crane is one of the most important equipment in container terminal. If its working time in cycle could be reduced then container terminal efficiency and service level can be increased. So there are many efforts to reduce working time of container crane. It means how to design the controller with good performance which has small overshoot and swing motion of container crane. We, in this paper, present a state feedback controller not based on LQ theory but RCGA which means real-coded genetic algorithms. RCGA can search state feedback gains in given objective function. several cases of simulations are carried out in order to prove the control effectiveness of the proposed methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.174-180
• /
• 2007

In the tone reservation (TR) scheme, it is known that the set of randomly selected peak reduction tones (PRT's) performs better than the contiguous PRT set and the interleaved PRT set in the PAPR reduction of orthogonal frequency division multiplexing (OFDM). It is also known that finding the optimal PRT set corresponds to the secondary peak minimization problem in the TR scheme. However, the problem cannot be solved for the practical number of tones since it is NP-hard. In this paper, a new search algorithm for the near optimal PRT set is proposed based on the fact that the secondary peak value of the PRT set statistically tends to decrease asthe variance of the PRT set decreases.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.179-186
• /
• 2008

The converge of location-aware devices, GIS functionalities and the increasing accuracy and availability of positioning technologies pave the way to a range of new types of location-based services. The field of spatiotemporal data mining where relationships are defined by spatial and temporal aspect of data is encountering big challenges since the increased search space of knowledge. Therefore, we aim to propose algorithms for mining spatiotemporal patterns in mobile environment in this paper. Moving patterns are generated utilizing two algorithms called All_MOP and Max_MOP. The first one mines all frequent patterns and the other discovers only maximal frequent patterns. Our proposed approach is able to reduce consuming time through comparison with DFS_MINE algorithm. In addition, our approach is applicable to location-based services such as tourist service, traffic service, and so on.