The paper proposes a technique aimed at reducing the number of calculations required to carry out an exhaustive template matching process based on the Normalized Cross Correlation (NCC). The technique deploys an effective sufficient condition, relying on the recently introduced concept of bounded partial correlation, that allows rapid elimination of the points that can not provide a better cross-correlation score with respect to the current best candidate. In this paper we devise a novel sufficient condition based on the Cauchy-Schwarz inequality and compare the experimental results with those attained using the standard NCC-based template matching algorithm and the already known sufficient condition based on the Jensen inequality
In this work we discuss the problems of template matching and we propose some solutions. Those prob...
This paper proposes a novel algorithm aimed at speeding-up template matching based on the Lp norm. T...
Conference Name:6th International Symposium on Instrumentation and Control Technology. Conference Ad...
The paper proposes a technique aimed at reducing the number of calculations required to carry out an...
This work proposes a novel technique aimed at improving the performance of exhaustive template match...
This paper proposes an algorithm for efficient and exhaustive template matching based on the Zero me...
This paper describes a novel, fast template-matching technique, referred to as bounded partial corre...
We propose a novel algorithm, referred to as enhanced bounded correlation (EBC), that significantly...
This paper describes a class of algorithms enabling efficient and exhaustive matching of a template ...
[[abstract]]©2008 IEEE-In this paper, we propose a fast pattern matching algorithm based on the norm...
[[abstract]]In this paper we propose an efficient normalized cross correlation (NCC) algorithm for p...
This paper describes the mapping of a recently introduced template matching algorithm based on the N...
[[abstract]]In this paper we propose a fast normalized cross correlation (NCC) algorithm for pattern...
This paper presents a method that reduces the computational cost of template matching based on the ...
In this work we discuss the problems of template matching and we propose some solutions. Those prob...
This paper proposes a novel algorithm aimed at speeding-up template matching based on the Lp norm. T...
Conference Name:6th International Symposium on Instrumentation and Control Technology. Conference Ad...
The paper proposes a technique aimed at reducing the number of calculations required to carry out an...
This work proposes a novel technique aimed at improving the performance of exhaustive template match...
This paper proposes an algorithm for efficient and exhaustive template matching based on the Zero me...
This paper describes a novel, fast template-matching technique, referred to as bounded partial corre...
We propose a novel algorithm, referred to as enhanced bounded correlation (EBC), that significantly...
This paper describes a class of algorithms enabling efficient and exhaustive matching of a template ...
[[abstract]]©2008 IEEE-In this paper, we propose a fast pattern matching algorithm based on the norm...
[[abstract]]In this paper we propose an efficient normalized cross correlation (NCC) algorithm for p...
This paper describes the mapping of a recently introduced template matching algorithm based on the N...
[[abstract]]In this paper we propose a fast normalized cross correlation (NCC) algorithm for pattern...
This paper presents a method that reduces the computational cost of template matching based on the ...
In this work we discuss the problems of template matching and we propose some solutions. Those prob...
This paper proposes a novel algorithm aimed at speeding-up template matching based on the Lp norm. T...
Conference Name:6th International Symposium on Instrumentation and Control Technology. Conference Ad...