A Counterexample in Cross-Correlation Template Matching
Sampling and quantization are standard practices in signal and image processing, but a theoretical understanding of their impact is incomplete. We consider discrete image registration when the underlying function is a one-dimensional spatially-limited piecewise constant function. For ideal noiseless sampling the number of samples from each region of the support of the function generally depends on the placement of the sampling grid. Therefore, if the samples of the function are noisy, then image registration requires alignment and segmentation of the data sequences. One popular strategy for aligning images is selecting the maximum from cross-correlation template matching. To motivate more robust and accurate approaches which also address segmentation, we provide an example of a one-dimensional spatially-limited piecewise constant function for which the cross-correlation technique can perform poorly on noisy samples. While earlier approaches to improve the method involve normalization, our example suggests a novel strategy in our setting. Difference sequences, thresholding, and dynamic programming are well-known techniques in image processing. We prove that they are tools to correctly align and segment noisy data sequences under some conditions on the noise. We also address some of the potential difficulties that could arise in a more general case.
Code (0)
등록된 구현이 없습니다.
Tasks
Image RegistrationQuantizationTemplate MatchingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
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 rot…
Template 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 MatchingDeep 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 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 via Densities on the Roto-Translation Group
We propose a template matching method for the detection of 2D image objects that are characterized by orientation patterns. Our method is based on data representations via orientation scores, which are functions on the s…
Template MatchingTranslation