.png){kind=icon}
.png){kind=icon}
Return
Fast template matching and object detection techniques using φ-correlation and binary circuits
.png){kind=icon}
OA
AI
DOI：10.1007/s11042-023-15564-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, two new accelerated and robust template matching and object detection algorithms are established. The algorithms retain the accuracy measures compared to relevant well-known standard and recent schemes, and remarkably accelerate the execution time simultaneously. Instead of dealing with images in the grayscale or color representations, the proposed methods are established by measuring resemblance on extracted binary images. The two different techniques are based on the f-correlation coefficient and logical circuits. Both techniques enhance the accuracy, compared to two classical and two recent methods, while giving very efficient running time. The algorithms are carried out on two different datasets used in state-of-the-art methods with performance and comparison analysis. Robustness of the proposed algorithms against normal and artificial noises is examined and assured as well.
Keywords:
Template matching
Bit-plane slices
Normalized correlation coefficient
phi-correlation coefficient
Boolean circuits
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W