Parallel Bacterial Foraging Optimization for Video Compression

Parallel Bacterial Foraging Optimization (PBFO), a new evolutionary soft computing tool, has been proposed for real time video compression. The convergence of BFO is very slow and its performance heavily degraded for real time processing. In BFO, best optimum value is updated after each fitness function evaluations but in PBFO best optimum value is updated after fitness function evaluations all bacteria. The PBFO is used to reduce computational time of motion estimation in video compression. In the proposed technique, the parallel computation of fitness function ensures the convergence of the optimum solution is very fast. The adaptive step size with prediction, zero motion vector and Von Neumann neighborhood topology implemented in PBFO ensures the best matching block in current frame computationally very fast. The chemotaxis and swimming step can be varied to save computational time and to enhance peak signal to noise ratio. The presented method saves computational time up to 96.59 % when compared with other published methods. The proposed method is new and computationally efficient and suitable for any real time applications.

[1]  Shen Li,et al.  A novel fast motion estimation method based on genetic algorithm , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[2]  Jianhua Lu,et al.  A simple and efficient search algorithm for block-matching motion estimation , 1997, IEEE Trans. Circuits Syst. Video Technol..

[3]  Shyam S. Pattnaik,et al.  Bacterial foraging optimization technique to calculate resonant frequency of rectangular microstrip antenna , 2008 .

[4]  Sanjit K. Mitra,et al.  Fast motion estimation for H.264 , 2009, Signal Process. Image Commun..

[5]  Bing Zeng,et al.  A new three-step search algorithm for block motion estimation , 1994, IEEE Trans. Circuits Syst. Video Technol..

[6]  Kai-Kuang Ma,et al.  Adaptive rood pattern search for fast block-matching motion estimation , 2002, IEEE Trans. Image Process..

[7]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[8]  Lai-Man Po,et al.  A novel four-step search algorithm for fast block motion estimation , 1996, IEEE Trans. Circuits Syst. Video Technol..

[9]  Kai-Kuang Ma,et al.  A new diamond search algorithm for fast block-matching motion estimation , 2000, IEEE Trans. Image Process..

[10]  Malay Kishore Dutta,et al.  PARTICLE SWARM OPTIMIZATION TECHNIQUE A SOFT COMPUTING TOOL FOR DENOISING IMAGES , 2007 .

[11]  K. Passino,et al.  Biomimicry of Social Foraging Bacteria for Distributed Optimization: Models, Principles, and Emergent Behaviors , 2002 .