Vision and Robotics Seminar
Inter-Disciplinary Center (IDC)
will speak on
Real Time Pattern Matching
Many applications in Image Processing and Computer Vision require finding a particular pattern in an image. This task is referred to as Pattern Matching and may appear in various forms. The task involves finding appearances of a
given pattern in an image under various transformations and at various locations. This process is of very high time complexity since a search must be implemented both in the transformation domain and the spatial domain. In this
presentation, we introduce an approach that reduces complexity of this task.
Our approach consists of two complementary processes:
(1) Reduce search in the transformation domain.
(2) Reduce search in the spatial domain.
Both processes are based on a rejection scheme where a large portion of the parameter domain (spatial or transformation) is rejected iteratively while the computational resources are exploited only in the relevant domain. This approach is shown to be highly efficient in terms of run time, reducing the complexity by three orders of magnitude, thus enabling pattern matching at video rate.
Joint work with Hagit Hel-Or, Haifa University.
The lecture will take place in the
Lecture Hall, Room 1, Ziskind Building
on Thursday, May 23, 2002