• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.953-964
• /
• 2003

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the cross pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the cross pattern, and then lastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed cross pattern and flat-hexagonal pattern search algorithm(CFHPS ) improves about 0.2-6.2% in terms of average number of search point per motion vector estimation and improves about 0.02-0.31dB in terms of PSNR(Peak Signal to Noise Ratio).

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.4
• /
• pp.267-275
• /
• 2011

This paper proposes a new quickly convergent pattern search quasi-Newton algorithm that employs the multi-step version of the Symmetric Rank One (SRI). The new algorithm works on the factorizations of the inverse Hessian approximations to make available a sequence of convergent positive bases required by the pattern search process. The algorithm, in principle, resembles that developed in [1] with multi-step methods dominating the dervation and with numerical improvements incurred, as shown by the numerical results presented herein.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.57-65
• /
• 2004

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).

• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3665-3674
• /
• 2021

One of the important parts of the in-core fuel management is loading pattern optimization (LPO). The loading pattern optimization as a reasonable design of the in-core fuel management can improve both economic and safe aspects of the nuclear reactor. This work proposes the hybrid of fuzzy logic controller with harmony search algorithm (HS) for loading pattern optimization in a pressurized water reactor. The music improvisation process to find a pleasing harmony is inspiring the harmony search algorithm. In this work, the adjustment of the harmony search algorithm parameters such as the bandwidth and the pitch adjustment rate are increasing performance of the proposed algorithm which is done through a fuzzy logic controller. Hence, membership functions and fuzzy rules are designed to improve the performance of the HS algorithm and achieve optimal results. The objective of the method is finding an optimum core arrangement according to safety and economic aspects such as reduction of power peaking factor (PPF) and increase of effective multiplication factor (Keff). The proposed approach effectiveness has been tried in two cases, Michalewicz's bivariate function problem and NEACRP LWR core. The results show that by using fuzzy harmony search algorithm the value of the fitness function is improved by 15.35%. Finally, with regard to the new solutions proposed in this research it could be used as a trustworthy method for other optimization issues of engineering field.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.57-65
• /
• 2007

In the fast block matching algorithm. search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image qualify. In this paper, we propose a new fast block matching algorithm using the flat-hexagon search pattern that ate solved disadvantages of the diamond pattern search algorithm(DS) and the hexagon-based search algorithm(HEXBS). Our proposed algorithm finds mainly the motion vectors that not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the DS and HEXBS, the proposed f)at-hexagon search algorithm(FHS) improves about $0.4{\sim}21.3%$ in terms of average number of search point per motion vector estimation and improves about $0.009{\sim}0.531dB$ in terms of PSNR(Peak Signal to Noise Ratio).

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.6A
• /
• pp.369-378
• /
• 2012

In this study, direct-search based optimization methods are applied for blade shape optimization of wind turbines and the optimization performances of several methods including conventional genetic algorithm, micro genetic algorithm and pattern search method are compared to propose a more efficient method. For this purpose, the currently available version of HARP_Opt (Horizontal Axis Rotor Performance Optimizer) code is enhanced to rationally evaluate the annual energy production value according to control strategies and to optimize the blade shape using pattern search method as well as genetic algorithm. The enhanced HARP_Opt code is applied to obtain the optimal turbine blade shape for 1MW class wind turbines. The results from pattern search method are compared with the results from conventional genetic algorithm and also micro genetic algorithm and it is found that the pattern search method has a better performance in achieving higher annual energy production and consistent optimal shapes and the micro genetic algorithm is better for reducing the calculation time.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.339-342
• /
• 2005

We present an efficient block-based motion estimation algorithm with motion analysis. The motion analysis determines a size of search pattern and a maximum repeated count of search pattern. In case of large movement in large image, we reduce search points and the local minimum which caused by low performance. The proposed algorithm employs with searching step of 2. The first step determines an initial search point with neighbor block vector and a size of initial search pattern. The second step determines a size of search pattern and a maximum repeated count with motion analysis. We improve motion prediction accuracy while reducing required computational complexity compared to other fast block-based motion estimation algorithms.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.731-740
• /
• 2003

Since motion estimation remove the redundant data to employ the temporal correlations between adjacent frames in a video sequence, it plays an important role in digital video coding. And in the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the small-cross search pattern and the block-based gradient descent search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the small-cross search pattern, and then quickly finds the other motion vectors that are not close to the center of search window using the block-based gradient descent search pattern. Through experiments, compared with the block-based gradient descent search algorithm(BBGDS), the proposed search algorithm improves as high as 26-40% in terms of average number of search point per motion vector estimation.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.357-371
• /
• 2005

In this Paper, we propose a new motion search algorithm called CDTS (Cross-Diamond-Triangle Search algorithm) that uses optimal search pattern according to the position of a search area to improve the performance of CDS(Cross-Diamond Search algorithm) as well as CDHSs(Cross-Diamond-Hexagonal Searches algorithms). We analyze motion distributions in various test video sequences to apply optimal search pattern according to a position of search area. Based on the result of this analysis, we propose a new triangle-shaped search pattern whose structure is asymmetric while previous search patterns are generally symmetric in conventional algorithms. In CDTS, we apply cross- and diamond-shaped search patterns to central search areas, and triangle- and diamond-shaped patterns to the other areas. Applying CDTS to test video sequences, the proposed scheme can reduce search points more than CDS and CDHSs by 16.22$\%$ and 3.09$\%$, respectively, without any visual quality degradation.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.24 no.1
• /
• pp.63-68
• /
• 2015

Pattern layout design is very important to the automation of apparel industry. Until now, the genetic algorithm and Tabu search method have been applied to layout design automation. With the genetic algorithm and Tabu search method, the obtained values are not always consistent depending on the initial conditions, number of iterations, and scheduling. In addition, the selection of various parameters for these methods is not easy. This paper presents a hybrid search method that uses a neural network and simulated annealing to solve these problems. The layout of pattern elements was optimized to verify the potential application of the suggested method to apparel pattern layout design.