{"id":8233,"date":"2012-09-19T12:35:01","date_gmt":"2012-09-19T09:35:01","guid":{"rendered":"http:\/\/hgpu.org\/?p=8233"},"modified":"2012-09-19T12:35:01","modified_gmt":"2012-09-19T09:35:01","slug":"parallelization-of-a-block-matching-algorithm","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=8233","title":{"rendered":"Parallelization of a Block-Matching Algorithm"},"content":{"rendered":"<p>In this work we present a parallelization technique, together with its GPU implementation, for the full-search block-matching algorithm. This problem consists in finding the block that best matches a given reference template in terms of some photometric measure within a predefined search area. Block matching is a fundamental processing step for many signal-processing applications. Its high computational burden and relative easy definition naturally demand for efficient and possibly parallel implementations. We compare the execution time of a GPU and CPU implementation; experimental results prove the effectiveness of executing the block-matching algorithm on GPU.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this work we present a parallelization technique, together with its GPU implementation, for the full-search block-matching algorithm. This problem consists in finding the block that best matches a given reference template in terms of some photometric measure within a predefined search area. Block matching is a fundamental processing step for many signal-processing applications. Its [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[36,11,90,3],"tags":[1787,1782,20,453,1793],"class_list":["post-8233","post","type-post","status-publish","format-standard","hentry","category-algorithms","category-computer-science","category-opencl","category-paper","tag-algorithms","tag-computer-science","tag-nvidia","tag-nvidia-geforce-9400-m","tag-opencl"],"views":2953,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/8233","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=8233"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/8233\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=8233"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=8233"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=8233"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}