Template matching is a computationally intensive problem aimed at locating a template within a image. When dealing with images having more than one channel, the computational burden becomes even more dramatic. For this reason, in this paper we investigate on a methodology to speed-up template matching on multi-channel images without deteriorating the outcome of the search. In particular, we propose a fast, exhaustive technique based on the Zero-mean Normalized Cross-Correlation (ZNCC) inspired from previous work related to grayscale images. Experimental testing performed over thousands of template matching instances demonstrates the efficiency of our proposal
In most computer vision and image analysis problems, it is necessary to define a similarity measure ...
Almost all Multiple-Point Statistic (MPS) methods use internally a template matching method to selec...
This paper presents a method that reduces the computational cost of template matching based on the ...
Template matching is a computationally intensive problem aimed at locating a template within a image...
none3This paper describes a class of algorithms enabling efficient and exhaustive matching of a temp...
This paper proposes an algorithm for efficient and exhaustive template matching based on the Zero me...
This work proposes a novel technique aimed at improving the performance of exhaustive template match...
Abstract—Template matching is one of the most basic techniques in computer vision, where the algorit...
Abstract—This paper describes the mapping of a recently introduced template matching algorithm based...
International audienceOne of the most popular methods to extract useful informations from an image s...
Template matching is a widely used pattern recognition method, especially in industrial inspection. ...
One important problem in image analysis is the localization of a template in a larger image. Applica...
none2noThis paper describes a novel, fast template-matching technique, referred to as bounded partia...
Template matching (TM) plays an important role in several image processing applications such as feat...
In this work we discuss the problems of template matching and we propose some solutions. Those prob...
In most computer vision and image analysis problems, it is necessary to define a similarity measure ...
Almost all Multiple-Point Statistic (MPS) methods use internally a template matching method to selec...
This paper presents a method that reduces the computational cost of template matching based on the ...
Template matching is a computationally intensive problem aimed at locating a template within a image...
none3This paper describes a class of algorithms enabling efficient and exhaustive matching of a temp...
This paper proposes an algorithm for efficient and exhaustive template matching based on the Zero me...
This work proposes a novel technique aimed at improving the performance of exhaustive template match...
Abstract—Template matching is one of the most basic techniques in computer vision, where the algorit...
Abstract—This paper describes the mapping of a recently introduced template matching algorithm based...
International audienceOne of the most popular methods to extract useful informations from an image s...
Template matching is a widely used pattern recognition method, especially in industrial inspection. ...
One important problem in image analysis is the localization of a template in a larger image. Applica...
none2noThis paper describes a novel, fast template-matching technique, referred to as bounded partia...
Template matching (TM) plays an important role in several image processing applications such as feat...
In this work we discuss the problems of template matching and we propose some solutions. Those prob...
In most computer vision and image analysis problems, it is necessary to define a similarity measure ...
Almost all Multiple-Point Statistic (MPS) methods use internally a template matching method to selec...
This paper presents a method that reduces the computational cost of template matching based on the ...