• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.1
• /
• pp.22-31
• /
• 2004

This paper deals with the dynamic hand gesture recognition based on computer vision using neural networks. This paper proposes a global search method and a local search method to recognize the hand gesture. The global search recognizes a hand among the hand candidates through the entire image search, and the local search recognizes and tracks only the hand through the block search. Dynamic hand gesture recognition method is based on the skin-color and shape analysis with the invariant moment and direction information. Starting point and ending point of the dynamic hand gesture are obtained from hand shape. Experiments have been conducted for hand extraction, hand recognition and dynamic hand gesture recognition. Experimental results show the validity of the proposed method.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.6
• /
• pp.757-772
• /
• 2019

The purpose of this paper is to measure the clustering change and analyze empirical results, and choose the clustering ports for Busan, Incheon, and Gwangyang ports by using Artificial Neural Network, Social Network, and Tabu Search models on 38 Asian container ports over the period 2007-2016. The models consider number of cranes, depth, birth length, and total area as inputs and container throughput as output. Followings are the main empirical results. First, the variables ranking order which affects the clustering according to artificial neural network are TEU, birth length, depth, total area, and number of cranes. Second, social network analysis shows the same clustering in the benevolent and aggressive models. Third, the efficiency of domestic ports are worsened after clustering using social network analysis and tabu search models. Forth, social network and tabu search models can increase the efficiency by 37% compared to that of the general CCR model. Fifth, according to the social network analysis and tabu search models, 3 Korean ports could be clustered with Asian ports like Busan Port(Kobe, Osaka, Port Klang, Tanjung Pelepas, and Manila), Incheon Port(Shahid Rajaee, and Gwangyang), and Gwangyang Port(Aqaba, Port Sulatan Qaboos, Dammam, Khor Fakkan, and Incheon). Korean seaport authority should introduce port improvement plans by using the methods used in this paper.

• Journal of Korea Multimedia Society
• /
• v.19 no.11
• /
• pp.1878-1890
• /
• 2016

Web 2.0 has features produced the content through the user of the participation and share. The content production activities have became active since social network service appear. The social bookmark, one of social network service, is service that lets users to store useful content and share bookmarked contents between personal users. Unlike Internet search engines such as Google and Naver, the content stored on social bookmark is searched based on tag keyword information and unnecessary information can be excluded. Social bookmark can make users access to selected content. However, quick access to content that users want is difficult job because of the user of the participation and share. Our paper suggests a method recommending search word to be able to access quickly to content. A method is suggested by using Collaborative Filtering and Jaccard similarity coefficient. The performance of suggested system is verified with experiments that compare by 'Delicious' and "Feeltering' with our system.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.4
• /
• pp.331-338
• /
• 2005

In this paper, an improved maintenance scheduling approach suitable for the competitive environment is proposed by taking account of profits and costs of generation companies and the formulated combinatorial optimization problem is solved by using Reactive Tabu search (RTS). In competitive power markets, electricity prices are determined by the balance between demand and supply through electric power exchanges or by bilateral contracts. Therefore, in decision makings, it is essential for system operation planners and market participants to take the volatility of electricity price into consideration. In the proposed maintenance scheduling approach, firstly, electricity prices over the targeted period are forecasted based on Artificial Neural Network (ANN) and also a newly proposed aggregated bidding curve. Secondary, the maintenance scheduling is formulated as a combinatorial optimization problem with a novel objective function by which the most profitable maintenance schedule would be attained. As an objective function, Opportunity Loss by Maintenance (OLM) is adopted to maximize the profit of generation companies (GENCOS). Thirdly, the combinatorial optimization maintenance scheduling problem is solved by using Reactive Tabu Search in the light of the objective functions and forecasted electricity prices. Finally, the proposed maintenance scheduling is applied to a practical test power system to verify the advantages and practicability of the proposed method.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.3
• /
• pp.65-73
• /
• 2017

The fifth generation(5G) of wireless networks will connect not only smart phone but also unimaginable things. Therefore, 5G cellular network is facing the soaring traffic demand of numerous user devices. To solve this problem, a huge amount of 5G base stations will need to be installed. The base station positioning problem is an NP-hard problem that does not know how long it will take to solve the problem. Because, it can not find an answer other than to check the number of all cases. In this paper, to solve the NP hard problem, we compare the tabu search and the genetic algorithm using real maps for optimal cell planning. We also perform Monte Carlo simulations to study the performance of the Tabu search and Genetic algorithm for 5G cell planning. As a results, Tabu search required 2.95 times less computation time than Genetic algorithm and showed accuracy difference of 2dBm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.1
• /
• pp.89-95
• /
• 2006

Planning distributed manufacturing logistics is one of main issues in supply chain management. This paper proposes a hybrid heuristic approach for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network. MLCLSP corresponds to a mixed integer programming (MIP) problem. With integer variable solutions determined by heuristic search, this MIP problem becomes linear program (LP). By repeatedly solving the relaxed MIP problems with a heuristic search method in a hybrid manner, this proposed approach allocates finite manufacturing resources fur each distributed facilities and generates feasible production plans. Meta heuristic search algorithm is presented to solve the MIP problems. The experimental test evaluates the computational performance under a variety of problem scenarios.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.599-602
• /
• 2014

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. With regard to procedures of proposal algorithm, duplicated agents were transferred to the point, where the second, third, and fourth cells were created in order, after the first cell was made, and the agents were engineered to search the shortest path to each cell, and then find the most efficient element through competition.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.5
• /
• pp.80-87
• /
• 2003

Network reconfiguration in distribution systems is realized by changing the status of sectiona1izing switches, and is usually done for loss minimization or load balancing in the system This parer presents an approach for loss minization in distribution systems using reactive tabu search. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. Reactive tabu search can give convergence property by using reaction and escape mechanism. Therefore, it can find global optimal solution regardless of initial system configuration. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the 32 bus system models.

• Spatial Information Research
• /
• v.21 no.4
• /
• pp.7-14
• /
• 2013

Recently, R&D(Research and Development) is processing actively on range search in the road network environments. However, the existing representative range search techniques have shortcomings in that the greater the number of POI's, the more increased storage space or the more increased search time due to inefficient search process. Accordingly, In this paper, we proposed a range search technique using QRMP(QR-tree using Middle Point) to solve the problems of conventional range search techniques. In addition, we made a formula to obtain the total size of the storage space for QRMP and proved the excellence of the range search technique proposed in this paper through the experiment using actual road networks and POI data.