Results 251 to 260 of about 274,335 (270)
Some of the next articles are maybe not open access.
2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010
Registration is a ubiquitous task for image analysis applications. Generally, the requirements of registration algorithms include fast computation and large capture range. For these purposes, registration in the Fourier domain using normalized cross correlation is well suited and has been extensively studied in the literature.
openaire +1 more source
Registration is a ubiquitous task for image analysis applications. Generally, the requirements of registration algorithms include fast computation and large capture range. For these purposes, registration in the Fourier domain using normalized cross correlation is well suited and has been extensively studied in the literature.
openaire +1 more source
Journal of the Institution of Electronic and Radio Engineers, 1985
In many examples of Fast Fourier Transform processing, a substantial loss arises from the so-called Picket Fence effect or from use of shaped time-windows or both. This paper describes a simple, easily implemented procedure which greatly reduces such loss in certain applications.
openaire +1 more source
In many examples of Fast Fourier Transform processing, a substantial loss arises from the so-called Picket Fence effect or from use of shaped time-windows or both. This paper describes a simple, easily implemented procedure which greatly reduces such loss in certain applications.
openaire +1 more source