Parallel algorithms for combinatorial pattern matching

Abstract

In this talk we discuss on parallel computation approach to two-dimensional combinatorial pattern matching. The latter features numerous applications in pattern recognition, low level image processing, computer vision and, more recently, multimedia. After introducing some basic notions and concepts and recalling related key facts, we briefly discuss the basic steps of a parallel algorithm design, illustrating them by author's results on the problem of detecting all two-dimensional repetitions in a two-dimensional array. © 2014 Springer International Publishing.