In this paper we propose an efficient fast block-matching algorithm for motion estimation. Two different patterns, 3×3 and 5×5 cross patterns alternative in inner ring, and three search strategies, including prediction, threshold, and hierarchy, are utilized to form the procedure of the proposed algorithm. The simulation results show that number of search points required in the proposed algorit...

Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show tha...

this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...

The searching for patterns and model construction in Data-mining is the important contribution. Previous works report that the component search (CS) algorithm is successful and effective for datamining. Conventional research in pattern search and modeling in data-mining only consider data in a static state. Studies data-mining in dynamic environments are scarce. The artificial neural network (A...

A Deep Web wrapper is a program that extracts contents from search results. We propose a new automatic wrapper generation algorithm which discovers a repetitive pattern from search results. The repetitive pattern is expressed by token sequences which consist of HTML tags, plain texts and wild-cards. The algorithm applies a string matching with mismatches to unify the variation from the template...

Motion estimation and compensation techniques are widely used for video coding applications but the real-time motion estimation is not easily achieved due to its enormous computations. In this paper, a new fast motion estimation algorithm based on line search is presented, in which computation complexity is greatly reduced by using the line search strategy and a parallel search pattern. Moreove...

We propose a fast motion estimation (FME) algorithm that performs comparably to the full search while having improved performance when compared to the best FME methods that are recommended for the JVT/H.264 standard despite having a much lower computational complexity than these methods. Our algorithm, called the predictive and adaptive rood pattern with large motion search, incorporates motion...

In recent years there has been much interest in the Monte Carlo tree search algorithm, a new, adaptive, randomized optimization algorithm. In fields as diverse as Artificial Intelligence, Operations Research, and High Energy Physics, research has established that Monte Carlo tree search can find good solutions without domain dependent heuristics. However, practice shows that reaching high perfo...

Ramasubramanian, V. and K.K. Paliwal, An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation, Pattern Recognition Letters 13 (1992) 471-480. An efficient approximation-elimination search algorithm for fast nearest-neighbour search is proposed based on a spherical distance coordinate formuTation, where a vector in K...

The nearest neighbour (NN) rule is widely used in pattern recognition tasks due to its simplicity and its good behaviour. Many fast NN search algorithms have been developed during last years. However, in some classification tasks an exact NN search is too slow, and a way to quicken the search is required. To face these tasks it is possible to use approximate NN search, which usually increases e...