Block matching algorithm for motion estimation based on Artificial Bee Colony (ABC)

Block matching (BM) motion estimation plays a very important role in video coding. In a BM approach, image frames in a video sequence are divided into blocks. For each block in the current frame, the best matching block is identified inside a region of the previous frame, aiming to minimize the sum of absolute differences (SAD). Unfortunately, the SAD evaluation is computationally expensive and represents the most consuming operation in the BM process. Therefore, BM motion estimation can be approached as an optimization problem, where the goal is to find the best matching block within a search space. The simplest available BM method is the full search algorithm (FSA) which finds the most accurate motion vector through an exhaustive computation of SAD values for all elements of the search window. Recently, several fast BM algorithms have been proposed to reduce the number of SAD operations by calculating only a fixed subset of search locations at the price of poor accuracy. In this paper, a new algorithm based on Artificial Bee Colony (ABC) optimization is proposed to reduce the number of search locations in the BM process. In our algorithm, the computation of search locations is drastically reduced by considering a fitness calculation strategy which indicates when it is feasible to calculate or only estimate new search locations. Since the proposed algorithm does not consider any fixed search pattern or any other movement assumption as most of other BM approaches do, a high probability for finding the true minimum (accurate motion vector) is expected. Conducted simulations show that the proposed method achieves the best balance over other fast BM algorithms, in terms of both estimation accuracy and computational cost.Comment: 22 Pages. arXiv admin note: substantial text overlap with arXiv:1405.4721, arXiv:1406.448

An improved block matching algorithm for motion estimation invideo sequences and application in robotics

Block Matching is one of the most efficient techniques for motion estimation for video sequences. Metaheuristic algorithms have been used effectively for motion estimation. In this paper, we propose two hybrid algorithms: Artificial Bee Colony with Differential Evolution and Harmony Search with Differential Evolution based motion estimation algorithms. Extensive experiments are conducted using four standard video sequences. The video sequences utilized for experimentation have all essential features such as different formats, resolutions and number of frames which are generally required in input video sequences. We compare the performance of the proposed algorithms with other algorithms considering various parameters such as Structural Similarity, Peak Signal to Noise Ratio, Average Number of Search Points etc. The comparative results demonstrate that the proposed algorithms outperformed other algorithms

An improved block matching algorithm for motion estimation in video sequences and application in robotics

Block Matching is one of the most efficient techniques for motion estimation for video sequences. Metaheuristic algorithms have been used effectively for motion estimation. In this paper, we propose two hybrid algorithms: Artificial Bee Colony with Differential Evolution and Harmony Search with Differential Evolution based motion estimation algorithms. Extensive experiments are conducted using four standard video sequences. The video sequences utilized for experimentation have all essential features such as different formats, resolutions and number of frames which are generally required in input video sequences. We compare the performance of the proposed algorithms with other algorithms considering various parameters such as Structural Similarity, Peak Signal to Noise Ratio, Average Number of Search Points etc. The comparative results demonstrate that the proposed algorithms outperformed other algorithms

A Novel Search Technique of Motion Estimation for Video Compression

Video Compression is highly demanded now a days as due to the fact that in the field of entertainment, medicine and communication there is high demand for digital video technology. For the effective removal of temporal redundancy between the frames for better video compression Motion estimation techniques plays a major role. Block based motion estimation has been widely used for video coding. One such method is the Hierarchical Search Technique for BMA. By amalgamating the three different search algorithms like New three step search, New Full search and New Cross diamond search a novel hierarchical search methodology is proposed. Sub- sampling the original image into additional two levels is done and thereby the New Diamond search algorithm and a new three-step search algorithm are used in the bottom two levels and the Full Search is performed on the highest level where the complexity is relatively low. In terms of PSNR with reduced complexity this new proposed algorithm showed better performance

A Potential Heuristic-based Block Matching Algorithms for Motion Estimation in Video Compression

Motion estimation (ME) is one of the element keys in video compression that takes up to 60% in processing time. Block matching algorithm (BMA) is a technique that is used to reduce the computational complexity of ME algorithm due to its efficiency and good performance. Strategy of searching is one of the factors in developing motion estimation algorithm that has the potential to provide good performance. This study aims to implement several selected BMAs for achieving the least number of computations and to give better Peak Signal to Noise Ratio (PSNR) values using different video sequences. The proposed algorithms are modified based on the search strategy adapted from the standard algorithms approach. The results have proved that both modification algorithms (MDS and MARPS) have the potential in reducing the number of computations and achieved good PSNR values in all motion types as compared to DS and ARPS respectively. This work could be improved by using metaheuristic algorithms approach such as particle swarm optimization (PSO), artificial bee colony (ABC), tabu search (TS) and etc to provide the better result of PSNR values without increasing the number of computation

Soft computing applied to optimization, computer vision and medicine

Artificial intelligence has permeated almost every area of life in modern society, and its significance continues to grow. As a result, in recent years, Soft Computing has emerged as a powerful set of methodologies that propose innovative and robust solutions to a variety of complex problems. Soft Computing methods, because of their broad range of application, have the potential to significantly improve human living conditions. The motivation for the present research emerged from this background and possibility. This research aims to accomplish two main objectives: On the one hand, it endeavors to bridge the gap between Soft Computing techniques and their application to intricate problems. On the other hand, it explores the hypothetical benefits of Soft Computing methodologies as novel effective tools for such problems. This thesis synthesizes the results of extensive research on Soft Computing methods and their applications to optimization, Computer Vision, and medicine. This work is composed of several individual projects, which employ classical and new optimization algorithms. The manuscript presented here intends to provide an overview of the different aspects of Soft Computing methods in order to enable the reader to reach a global understanding of the field. Therefore, this document is assembled as a monograph that summarizes the outcomes of these projects across 12 chapters. The chapters are structured so that they can be read independently. The key focus of this work is the application and design of Soft Computing approaches for solving problems in the following: Block Matching, Pattern Detection, Thresholding, Corner Detection, Template Matching, Circle Detection, Color Segmentation, Leukocyte Detection, and Breast Thermogram Analysis. One of the outcomes presented in this thesis involves the development of two evolutionary approaches for global optimization. These were tested over complex benchmark datasets and showed promising results, thus opening the debate for future applications. Moreover, the applications for Computer Vision and medicine presented in this work have highlighted the utility of different Soft Computing methodologies in the solution of problems in such subjects. A milestone in this area is the translation of the Computer Vision and medical issues into optimization problems. Additionally, this work also strives to provide tools for combating public health issues by expanding the concepts to automated detection and diagnosis aid for pathologies such as Leukemia and breast cancer. The application of Soft Computing techniques in this field has attracted great interest worldwide due to the exponential growth of these diseases. Lastly, the use of Fuzzy Logic, Artificial Neural Networks, and Expert Systems in many everyday domestic appliances, such as washing machines, cookers, and refrigerators is now a reality. Many other industrial and commercial applications of Soft Computing have also been integrated into everyday use, and this is expected to increase within the next decade. Therefore, the research conducted here contributes an important piece for expanding these developments. The applications presented in this work are intended to serve as technological tools that can then be used in the development of new devices

Bee Shadow Recognition in Video Analysis of Omnidirectional Bee Traffic

Over a decade ago, beekeepers noticed that the bees were dying or disappearing without any prior health disorder. Colony Collapse Disorder (CCD) has been a major threat to bee colonies around the world which affects vital human crop pollination. Possible instigators of CCD include viral and fungal diseases, decreased genetic diversity, pesticides and a variety of other factors. The interaction among any of these potential facets may be resulting in immunity loss for honey bees and the increased likelihood of collapse. It is essential to rescue honey bees and improve the health of bee colony. Monitoring the traffic of bees helps to track the status of hive remotely. An Electronic beehive monitoring system extracts video, audio and temperature data without causing any interruption to the bee hives. This data could provide vital information on colony behavior and health. This research uses Artificial Intelligence and Computer Vision methodologies to develop and analyze technologies to monitor omnidirectional bee traffic of hives without disrupting the colony. Bee traffic means the number of bees moving in a given area in front of the hive over a given period of time. Forager traffic is the number of bees coming in and/or leaving the hive over a time. Forager traffic is a significant component in monitoring food availability and demand, colony age structure, impacts of pests and diseases, etc on hives. The goal of this research is to estimate and keep track of bee traffic by eliminating unnecessary information from video samples

Inter-Frame Video Compression based on Adaptive Fuzzy Inference System Compression of Multiple Frame Characteristics

Video compression is used for storage or bandwidth efficiency in clip video information. Video compression involves encoders and decoders. Video compression uses intra-frame, inter-frame, and block-based methods.  Video compression compresses nearby frame pairs into one compressed frame using inter-frame compression. This study defines odd and even neighboring frame pairings. Motion estimation, compensation, and frame difference underpin video compression methods. In this study, adaptive FIS (Fuzzy Inference System) compresses and decompresses each odd-even frame pair. First, adaptive FIS trained on all feature pairings of each odd-even frame pair. Video compression-decompression uses the taught adaptive FIS as a codec. The features utilized are "mean", "std (standard deviation)", "mad (mean absolute deviation)", and "mean (std)". This study uses all video frames' average DCT (Discrete Cosine Transform) components as a quality parameter. The adaptive FIS training feature and amount of odd-even frame pairings affect compression ratio variation. The proposed approach achieves CR=25.39% and P=80.13%. "Mean" performs best overall (P=87.15%). "Mean (mad)" has the best compression ratio (CR=24.68%) for storage efficiency. The "std" feature compresses the video without decompression since it has the lowest quality change (Q_dct=10.39%)