• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1531-1536
• /
• 2016

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to its tremendous computational amount of for full search algorithm, efforts for reducing computations in motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate at once to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors. By doing that, we can estimate the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as full search.

• Convergence Security Journal
• /
• v.10 no.1
• /
• pp.49-53
• /
• 2010

Recently multimedia has been formed, provided, and shared enough not to compare with the past, due to the proliferation of Internet and the development of hardware relating to multimedia. Accordingly to internationally give a proper expression to metadata of multimedia, the standard of MPEG-7 has been established, and researches for image search among various data of multimedia using MPEG-7 are going on. Thus there are meaning-based search. In the former there is a merit that search speed is fast, but technology and accuracy by technical knowledge on the image. In the latter the accuracy of search is decreasing because of not understanding the meaning about image and the internet of users. In this study to solve these problems a search system has been designed by combining the two methods. Also the search and manage image data by handheld devices such as portable PDA or smart phone, a system. Once this is used, multimedia data can be efficiently searched and utilized by handheld devices.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2012

The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

• Journal of Digital Convergence
• /
• v.16 no.12
• /
• pp.207-215
• /
• 2018

This study started from the point that the most important SMEs in the economic growth engine of Korea are prepared to grow through innovation. This study focuses on the fact that existing studies have focused on the open innovation of SMEs has been continued since the external knowledge search became an important concept, but mainly focused on the enterprise performance. The purpose of this study is to examine the moderating effect of innovation speed focusing on exports to Korean SMEs. The hypothesis suggests the depth and breadth of external knowledge search, which is the two methods of open innovation emphasized in the previous studies, and then shows the innovation speed on export performance as a moderating effect. Robust regression analysis was used for the analysis and the sample used for the analysis was valid 1,357 SMEs data. The hypothesis test for the moderation effect was performed by comparing the F-values between models. The proposed hypothesis was adopted and the moderation effect was verified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.364-370
• /
• 2002

In this paper, we propose a VLSI array architecture for high speed processing of FBMA. First of all, the sequential FBMA is transformed into a single assignment code by using the index space expansion, and then the dependance graph is obtained from it. The two dimensional VLSI array is derived by projecting the dependance graph along the optimal direction. Since the candidate blocks in the search range are overlapped with columns as well as rows, the processing elements of the VLSI array are designed to reuse the overlapped data. As the results, the number of data inputs is reduced so that the processing performance is improved. The proposed VLSI array has (N$^2$+1)${\times}$(2p+1) processing elements and (N+2p) input ports where N is the block size and p is the maximum search range. The computation time of the rat reference block is (N$^2$+2(p+1)N+6p), and the block pipeline period is (3N+4p-1).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.21-31
• /
• 2015

The Internet users want to get real-time services for various multi-media applications. Network traffic rate has been rapidly increased, and data amounts that the Internet has to carry have been exponentially increased. A packet is the basic unit in transferring data at the Internet, and packet classification is one of the most challenging functionalities that routers should perform at wire-speed. Among various known packet classification algorithms, area-based quad-trie (AQT) algorithm is one of the efficient algorithms which can lookup five header fields simultaneously. As a representative space decomposition algorithm, the AQT requires a small amount of memory in storing classification rules, but it does not provide high-speed classification performance. In this paper, we propose a new packet classification algorithm by applying a binary search for the codewords of the AQT to overcome the issue of the AQT. Throughout simulation, it is shown that the proposed algorithm provides a better performance than the AQT in the number of rule comparisons with each input packet.

• Journal of Mechanical Science and Technology
• /
• v.16 no.8
• /
• pp.1033-1038
• /
• 2002

Genetic alsorithm (GA) , compared to the gradient-based optimization, has advantages of convergence to a global optimized solution. The genetic algorithm requires so many number of analyses that may cause high computational cost for genetic search. This paper proposes a personal computer network programming based on TCP/IP protocol and client-server model using socket, to improve processing speed of the genetic algorithm for optimization of composite laminated structures. By distributed processing for the generated population, improvement in processing speed has been obtained. Consequently, usage of network-based genetic algorithm with the faster network communication speed will be a very valuable tool for the discrete optimization of large scale and complex structures requiring high computational cost.

• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.404-408
• /
• 2001

This paper deals with speed control of induction motors with a gain tuning based on simple Genetic Algorithms, which are search algorithms based on the mechanics of natual selection and genetics. Based on the designed control system structure, the indirect vector control system of induction motors is simulated. The simulation results show that the system has a strong robust to the parameter variation and is insensitive to the load disturbance. Thus, the proposed PI controller based on genetic algorithms is superior to manually tuned classical PI controller in improving the speed control performance of induction motors.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.163-168
• /
• 2005

It is one of the most important things to determinate optimized cutting conditions which satisfy productivity and cost simultaneously in production and CAPP systems. These days many researchers have figured out the optimizing way for solutions of multi-object function to find the approach methods using algorithm such as genetic algorithm or tabu search, etc., instead of mathematical methods. The main creation of objective function is proposed by empirical method but which is difficult to set it up and to analysis. In this paper, an optimization method of cutting condition is shown using the ANN and GA for the multi-objective function in high speed machining.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.1
• /
• pp.140-147
• /
• 2012

Vehicle routing problem is one of the traveling salesman problems with various conditions such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area. In this research hourly vehicle moving speeds information in a typical metropolitan area are analyzed to use the results in the design procedure of VRP heuristic. Quality initial vehicle routing solutions can be obtained with adaption of the analysed results of the time periods with no vehicle speed changes. This strategy makes complicated time dependent vehicle speed simple to solve. Time dependent vehicle speeds are too important to ignore to obtain optimum vehicle routing search for real life logistics systems.