Motion estimation using learning automata

Block-matching algorithms (BMAs) are widely employed for motion estimation. BMAs divide input frames into several blocks and minimize an error function for each block to calculate motion vectors. Afterward, each motion vector is applicable for all of the pixels within the block. Since computing the error functions is resource intensive, many fast-search motion estimation algorithms have been suggested to reduce the computational cost. These fast algorithms provide a significant reduction in computation but often converge to a local minimum. A learning automaton is an adaptive decision-making unit that learns the optimal action through repeated interactions with its environment. Learning automata (LA) have been applied successfully to a wide range of applications including pattern recognition, dynamic channel assignment, and social network analysis. In this paper, we apply LA to motion estimation problem, which is one of the basic problems in computer vision. We compare the accuracy and performance of the suggested algorithms with other well-known BMAs. Interestingly, the obtained results indicate high efficiency and accuracy of the proposed methods. The results suggest that simplicity, efficiency, parallel nature, and accuracy of LA-based methods make them a good candidate to solve computer vision problems.