Fast Normalized Cross-Correlation for Template Matching with Rotations
Normalized cross-correlation is the reference approach to carry out template matching on images. When it is computed in Fourier space, it can handle efficiently template translations but it cannot do so with template rotations. Including rotations requires sampling the whole space of rotations, repeating the computation of the correlation each time. This article develops an alternative mathematical theory to handle efficiently, at the same time, rotations and translations. Our proposal has a reduced computational complexity because it does not require to repeatedly sample the space of rotations. To do so, we integrate the information relative to all rotated versions of the template into a unique symmetric tensor template -which is computed only once per template-. Afterward, we demonstrate that the correlation between the image to be processed with the independent tensor components of the tensorial template contains enough information to recover template instance positions and rotations. Our proposed method has the potential to speed up conventional template matching computations by a factor of several magnitude orders for the case of 3D images.
Code (0)
등록된 구현이 없습니다.
Tasks
Template MatchingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Deep Learning Improves Template Matching by Normalized Cross Correlation
Template matching by normalized cross correlation (NCC) is widely used for finding image correspondences. We improve the robustness of this algorithm by preprocessing images with "siamese" convolutional networks trained …
Deep LearningTemplate MatchingTensorial template matching for fast cross-correlation with rotations and its application for tomography
Object detection is a main task in computer vision. Template matching is the reference method for detecting objects with arbitrary templates. However, template matching computational complexity depends on the rotation ac…
object-detectionObject DetectionTemplate MatchingFast Template Matching by Subsampled Circulant Matrix
Template matching is widely used for many applications in image and signal processing and usually is time-critical. Traditional methods usually focus on how to reduce the search locations by coarse-to-fine strategy or fu…
Template MatchingTemplate Matching Advances and Applications in Image Analysis
In most computer vision and image analysis problems, it is necessary to define a similarity measure between two or more different objects or images. Template matching is a classic and fundamental method used to score sim…
Decision MakingImage RegistrationMedical Image Analysisobject-detection+3Efficient Sliding Window Computation for NN-Based Template Matching
Template matching is a fundamental problem in computer vision, with many applications. Existing methods use sliding window computation for choosing an image-window that best matches the tem- plate. For classic algorithms…
Template Matching