8. The problem of template matching takes as input two nmatrices I[0 - 1,0 : n - 1] and T[0 m - 1,0: m - 1]. The output is a matrix C[0 :n – 1,0: n – 1], where т-1 m-1 C'i, j] = E £ I(i + k) mod n, (j +l) mod n]T[k, 1] k=0 1=0

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
8. The problem of template matching takes as input two matrices I[0 :
n - 1,0 n - 1] and T[0 m – 1,0 : m - 1]. The output is a matrix
C[0 :n - 1,0: n – 1], where
т-1 т-1
C[i, j] = E E I[(i + k) mod n, j+1) mod n]T[k, 1]
k=0 1=0
for 0 < i,j < n. Present an n²-processor hypercube algorithm for
template matching. Assume that each processor has O(m) memory.
What is the tinme bound of your algorithm?
Transcribed Image Text:8. The problem of template matching takes as input two matrices I[0 : n - 1,0 n - 1] and T[0 m – 1,0 : m - 1]. The output is a matrix C[0 :n - 1,0: n – 1], where т-1 т-1 C[i, j] = E E I[(i + k) mod n, j+1) mod n]T[k, 1] k=0 1=0 for 0 < i,j < n. Present an n²-processor hypercube algorithm for template matching. Assume that each processor has O(m) memory. What is the tinme bound of your algorithm?
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of trees
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education