Single-Dimension Perturbation Glowworm Swarm Optimization Algorithm for Block Motion Estimation

The glowworm swarm optimisation (GSO) algorithm is a novel algorithm with the simultaneous computation of multiple optima of multimodal functions. Data-clustering techniques are classification algorithms that have a wide range of applications. Since K-means algorithm is easy to fall into the local optimum by the selection of initial clustering centre, GSO algorithm is used for the telecom customers clustering. The customer consumption data is extracted by means of the recency frequency monetary (RFM) model and the standardised data is clustered automatically using the GSO algorithm's synchronous optimisation ability. In the clustering optimisation algorithm, adaptive step size is used instead of the original fixed step size to avoid local optimisation of the algorithm and obtain higher accuracy. Compared with K-means clustering algorithm, GSO approach can automatically generate the number of clusters and use RFM model to reduce effectively the size of the data processing. The results of the experiments demonstrate that the GSO-based clustering technique is a promising technique for the data clustering problems.

Glowworm Swarm Optimization (GSO) algorithm is a derivative-free, meta-heuristic algorithm and mimicking the glow behavior of glowworms which can efficiently capture all the maximum multimodal function. Nevertheless, there are several weaknesses to locate the global optimum solution for instance low calculation accuracy, simply falling into the local optimum, convergence rate of success and slow speed to converge. This paper reviews the exposition of a new method of swarm intelligence in solving optimization problems using GSO. Recently the GSO algorithm was used simultaneously to find solutions of multimodal function optimization problem in various fields in today industry such as science, engineering, network and robotic. From the paper review, we could conclude that the basic GSO algorithm, GSO with modification or improvement and GSO with hybridization are considered by previous researchers in order to solve the optimization problem. However, based on the literature review, many researchers applied basic GSO algorithm in their research rather than others.

In pharmacokinetics, the problem of solving parameters of pharmacokinetics requires algorithm to be high stability, accuracy and generality. This paper a novel swarm intelligence algorithm-glowworm swarm optimization algorithm is proposed for solving parameters of pharmacokinetics. The most important advantage of the algorithm is that it can dynamically divide into many subgroups to parallels search multiple local optima, so it is able to avoid being trapped into local optima effectively and enable the algorithm to acquire stable global optimum quickly. Compared with traditional methods, such as, artificial immune network, particle swarm optimization, the experiments result show that the run time and accuracy of algorithm is good, so the glowworm swarm optimization algorithm is a novel effective and feasible swarm intelligence algorithm for solving parameters of pharmacokinetics.

A nonlinear African vulture optimization algorithm combining Henon chaotic mapping theory and reverse learning competition strategy

In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.

Although advanced motion vector prediction (AMVP) modes based on motion estimation (ME) are selected significantly less due to the merge mode newly adopted in the high-efficiency video coding (HEVC), integer ME (IME) still occupies a large amount of computation in HEVC because the HEVC supports a highly flexible block partitioning structure. Introduction of the merge mode in HEVC substantially affects the optimal search algorithm of IME. Therefore, this gives a chance to reduce the computational complexity of ME with marginal drop of the compression efficiency. This paper proposes a new IME algorithm that significantly reduces its search ranges. Computational complexity of the proposed algorithm is reduced without serious degradation in coding efficiency by obtaining additional accurate motion vector predictors (MVPs) in a bottom-up order and searching narrow regions around multiple MVPs. These bottom-up MVPs are obtained from the prediction units (PUs) in the coding units (CUs) in the hierarchically lower level, which share the pixel area either completely or partially with the current PU. Although the encoder should perform the proposed IME in a bottom-up order from the smallest CUs to the larger CUs, several other processes, such as fractional ME and merges mode are performed in a top-down order to exploit several fast algorithms already adopted in the HEVC test model encoder. To keep compatibility with HEVC standard, the bottom-up MVPs are utilized for only IME. The bitstream is generated using standard AMVP. According to the simulation results, it is confirmed that the proposed algorithm improves the accuracy of MVPs, which leads to the reduction of IME computational complexity up to 81.95% on average with the Bjontegaard delta bitrate of 0.39%.

2-Chlorophenol is a kind of representative organic waste water. With the environmental pollution becoming increasingly serious, and the large amount of waste discharged and the increasing difficulty of treatment, the research on the kinetics of the oxidation of supercritical water of 2-chlorophenol has important significant. Aiming at the phenomenon that the Glowworm Swarm Optimization (GSO) algorithm has slow convergence, low precision and easy to get trapped into local optimum, this paper presents an improved version of the GSO based on the behavior of predator-prey and biological predator, and we call it dual population Glowworm Swarm Optimization (GSOPP). The algorithm accelerates the convergence speed by introducing strategies such as chase and escape and variation among populations, and can obtain a more accurate solution. Tested by three standard test functions, the results showed that the improved GSOPP algorithm had better performance than the basic GSO algorithm. Finally, the algorithm was applied to estimate the parameter estimation of the supercritical water oxidation kinetics of 2-chlorophenol, and satisfactory results were obtained.

Glowworm Swarm Optimization Algorithm (GSO) is one of new swarm intelligence optimization algorithms in recent years. Its main idea comes from the cooperative behavior source among individuals during the process of courtship and foraging. In this paper, in order to improve convergence speed in the late iteration, avoid the algorithm falling into local optimum, and reduce isolated nodes, the Adaptive Step Mechanism Glowworm Swarm Optimization (ASMGSO) is proposed. The main idea of ASMGSO algorithm is as follows: (1) On the basis of SMGSO algorithm, isolated nodes carry out bunching operator first, that is to say they are moving to the central position of the group. If the new position is not better than the current position, then isolated nodes perform mutation operation. (2) At the same time, the fixed step mechanism has been improved. Each individual has its step size which is adapted to itself in the iterative process. The step size is not only affected by the node's neighborhood density but also affected by the distance to the moving target node. The effectiveness of the proposed ASMGSO algorithm is verified through several classic test functions and application in Distance Vector-HOP.

The growing popularity of high resolution video and the continuously increasing demands for high quality video on mobile devices are producing stronger needs for more efficient video encoder. Concerning these desires, HEVC, a newest video coding standard, has been developed by a joint team formed by ISO/IEO MPEG and ITU/T VCEG. Its design goal is to achieve a 50% compression gain over its predecessor H.264 with an equal or even higher perceptual video quality. Motion Estimation (ME) being as one of the most critical module in video coding contributes almost 50%-70% of computational complexity in the video encoder. This high consumption of the computational resources puts a limit on the performance of encoders, especially for full HD or ultra HD videos, in terms of coding speed, bit-rate and video quality. Thus the major part of this work concentrates on the computational complexity reduction and improvement of timing performance of motion estimation algorithms for HEVC standard. First, a new strategy to calculate the SAD (Sum of Absolute Difference) for motion estimation is designed based on the statistics on property of pixel data of video sequences. This statistics demonstrates the size relationship between the sum of two sets of pixels has a determined connection with the distribution of the size relationship between individual pixels from the two sets. Taking the advantage of this observation, only a small proportion of pixels is necessary to be involved in the SAD calculation. Simulations show that the amount of computations required in the full search algorithm is reduced by about 58% on average and up to 70% in the best case. Secondly, from the scope of parallelization an enhanced TZ search for HEVC is proposed using novel schemes of multiple MVPs (motion vector predictor) and shared MVP. Specifically, resorting to multiple MVPs the initial search process is performed in parallel at multiple search centers, and the ME processing engine for PUs within one CU are parallelized based on the MVP sharing scheme on CU (coding unit) level. Moreover, the SAD module for ME engine is also parallelly implemented for PU size of 32×32. Experiments indicate it achieves an appreciable improvement on the throughput and coding efficiency of the HEVC video encoder. In addition, the other part of this thesis is contributed to the VLSI architecture design for finding the first W maximum/minimum values targeting towards high speed and low hardware cost. The architecture based on the novel bit-wise AND scheme has only half of the area of the best reference solution and its critical path delay is comparable with other implementations. While the FPCG (full parallel comparison grid) architecture, which utilizes the optimized comparator-based structure, achieves 3.6 times faster on average on the speed and even 5.2 times faster at best comparing with the reference architectures. Finally the architecture using the partial sorting strategy reaches a good balance on the timing performance and area, which has a slightly lower or comparable speed with FPCG architecture and a acceptable hardware cost

As an essential component in applications such as video coding, autonomous navigation, and surveillance cameras, efficient and robust motion estimation is always required. This paper proposes a robust block-matching algorithm consisting of a rough matching step and a fine matching step for motion estimation. In the coarse matching step, an improved adaptive rood pattern search strategy combined with an anti-interference similarity criterion is developed to improve the computational efficiency and robustness. In the fine matching step, after performing a subpixel estimation procedure, a bilateral verification scheme is demonstrated to decrease the motion estimation errors caused by environmental disturbances. Experiments are carried out over popular video and image sequences, and several measurement indexes are used to quantify the performance of the proposed method and other motion estimation methods. Comparative analysis and quantitative evaluation demonstrate that the proposed method exhibits strong robustness and can achieve a good balance between computational efficiency and complexity.

A novel quantum grasshopper optimization algorithm for feature selection

In this paper, a complexity-balancing algorithm is proposed for distributed video coding based on entropy coding. In order to reduce complexity of DVC-based decoders, the proposed method employs an entropy coder instead of channel coders and the complexity-balancing method is designed to improve RD performance with minimal computational complexity. The proposed method performs motion estimation in the decoder side and transmits the estimated motion vectors to the encoder. The proposed encoder can perform more accurate refinement using the transmitted motion vectors from the decoder. During the motion refinement, the optimal predicted motion vectors are decided by the received motion vector and the predicted motion vectors and complexity load of block is allocated by adjusting the search range based on the difference between the received motion vector and the predicted motion vectors. The computational complexity of the proposed encoder is decreased 11.9% compared to the H.264/AVC encoder and that of the proposed decoder are reduced 99% compared to the conventional DVC decoder.

This study introduces a hybridization of the Bird Mating Optimizer (BMO) with Differential Evolution (DE). The Bird Mating Optimizer exhibits certain limitations, such as a slow convergence rate and a tendency to become trapped in local optima. To address these issues, a new method, BMO-DE, is proposed to enhance the performance of the BMO swarm intelligence algorithm. BMO-DE is a versatile swarm intelligence algorithm applicable to various engineering problems. In this research, it is specifically employed in the optimization of welded beam design, a type of problem characterized by numerous constraints. The penalty function approach is used to handle the constraints associated with welded beam design. Comparative analysis indicates that the proposed BMO-DE method outperforms other swarm intelligence algorithms in tackling this category of problems. Notably, the method demonstrates efficacy in finding optimal solutions with a low number of objective function evaluations, making it a potent and promising approach for addressing such problems.

Peak-to-Average Power Ratio Reduction Using New Swarm Intelligence Algorithm in OFDM Systems

In this paper a new fast motion estimation method useful for video encoding in a noisy environment is presented. Motion estimation methods can broadly categorized as Block Matching (BM) methods, Pel Recursive (PR) methods, and Frequency Domain (FD) methods. Majority of the current fast motion estimation methods belong to block matching category. These methods typically achieve speedup by either reducing the number of search locations or by reducing the number of computations at each search location. Our proposed method is based on the pel recursive formulation. However, in order to achieve fast estimation, we operate on a block of pixels. To provide a robust behavior in a noisy environment we use a Total Least Squares (TLS) based estimation scheme which aims at estimating the true motion vectors. The simulation results indicate the speedup and robustness of the algorithm in noisy environment.