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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Shear-resize factorizations for fast image registration


    Contributors:
    Chen Ying, (author) / Pengwei Hao, (author) / Chao Zhang, (author)


    Publication date :

    2005-01-01


    Size :

    223963 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Shear-Resize Factorizations for Fast Image Registration

    Chen, Y. / Hao, P. / Zhang, C. | British Library Conference Proceedings | 2005


    3 third stage Resize cup holders

    YANG SI EUN / KIM SANG GIL | European Patent Office | 2018

    Free access


    Algorithms for Fast Image Registration

    Rezaie, B. / Srinath, M.D. | IEEE | 1984


    Fast remote sensing image registration algorithm

    Yue, T. / Yongmei, Z. / Bo, L. | British Library Online Contents | 2008