Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Counterexample in Cross-Correlation Template Matching

Published 24 Oct 2024 in cs.CV, cs.AI, and eess.IV | (2410.19085v1)

Abstract: 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.

Authors (1)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (7)
  1. X. Tong, Z. Ye, Y. Xu, S. Gao, H. Xie, Q. Du, S. Liu, X. Xu, S. Liu, K. Luan, and U. Stilla, “Image registration with Fourier-based image correlation: a comprehensive review of developments and applications,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 12(10), 4062-4081, Oct. 2019.
  2. S. A. Savari, “On image registration and subpixel estimation,” arXiv.org preprint, arXiv:2405.12927, May 2024.
  3. S. A. Savari, “A counterexample in image registration,” arXiv.org preprint, arXiv:2410.10725, October 2024.
  4. H. Nyquist, “Certain factors affecting telegraph speed,” Bell Sys. Tech. J. 3, 324, 1924.
  5. B. H. Savitzky, S. E. Zeltmann, L. A. Hughes, H. G. Brown, S. Zhao, P. M. Pelz, T. C. Pekin, E. S. Barnard, J. Donohue, L. R. DaCosta, E. Kennedy, Y. Xie, M. T. Janish, M. M. Schneider, P. Herring, C. Gopal, A. Anapolsky, R. Dhal, K. C. Bustillo, P. Ercius, M. C. Scott, J. Ciston, A. M. Minor, and C. Ophus, “py4DSTEM: a software package for four-dimensional scanning transmission electron microscopy data analysis,” Microscopy and Microanalysis, 27, 712-743, 2021.
  6. E. Mortensen, B. Morse, W. Barrett, abd J. Udupa, “Adaptive boundary detection using ‘live-wire’ two-dimensional dynamic programming,” IEEE Proceedings of Computers in Cardiology, 635-638, 1992.
  7. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Transactions on Information Theory, IT-13, 260-269, 1967.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.