Fast Template Matching Algorithm on GPU
碩士 === 國立清華大學 === 資訊工程學系所 === 105 === Template Matching is a technique to identify the parts on an image or subsequences of a sequence to match a predened template. It can be used in digital image processing. There are many variations of the template matching problem. In this thesis, we have present...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63g888 |
| Summary: | 碩士 === 國立清華大學 === 資訊工程學系所 === 105 === Template Matching is a technique to identify the parts on an image or subsequences
of a sequence to match a predened template. It can be used in digital image
processing. There are many variations of the template matching problem.
In this thesis, we have presented a matrix-based template matching algorithm. The
algorithm utilizes a hash function to transform an image into a 2-D matrix. The
hash function is rotation and re
ection invariance. Then check the image blocks
that have the same hash values to identify all the exact same templates between
two images. And the method has implemented on GPU. The experimental results
show that the performance on GPU is accelerated approximately 25 times than the
CPU version.
|
|---|