Scale-free network model for template matching based on kernel histogram

A novel method to build a scale-free network model for template matching is proposed. The scale-free network model of the template is produced by a kernel histogram. Moreover, those special points that have much larger effects than other points can be selected by a matching algorithm. Based on the scale-free network model, the matching is implemented by minimising the sum of absolute differences. The proposed algorithm can match the potential object of varying scale in a clutter background. To the best of the authors´ knowledge, this is the first template matching algorithm which uses the scale-free complex network to model template matching.