Owing to its effectiveness and simplicity, intensity-based method works well for registration of images. However, it needs a large amount of computation for geometric transformation. In this paper, we present two shear-resize matrix factorizations to accelerate the transformation. A transform matrix can be factorized into two shears and a fixed non-uniform resize, or three shears and a customizable resize. A customizable resize can be uniform in all dimensions or scaling just in one dimension. Shears can be implemented very fast by memory-shift, and a resize can be done by simple axis-aligned interpolation. The factorizations can be applied to both rigid-body and affine transformations. Their efficiency is performed by experiments on some standard test images and fingerprint images. The methods are quite promising for hardware implementation, and can also be extended to 3D or higher dimensional fast geometric transformation.
Shear-resize factorizations for fast image registration
IEEE International Conference on Image Processing 2005 ; 3 ; III-1120
2005-01-01
223963 byte
Conference paper
Electronic Resource
English
Shear-Resize Factorizations for Fast Image Registration
British Library Conference Proceedings | 2005
|Algorithms for Fast Image Registration
IEEE | 1984
|Fast remote sensing image registration algorithm
British Library Online Contents | 2008
|