Shift-invariant linear algorithms can be described completely by the algorithm's response to an impulse input. The so called impulse response can be used as filter kernels when the algorithm is equivalently implemented using convolution. This, however, is not true when the system is block-shift invariant, i.e. when invariance is only at repetitive locations. This paper describes a generalization of the impulse response for block shift-invariant systems. The proposed technique, takes any computer program which implements a linear block-shift-invariant algorithm, and produces its equivalent filter kernels. These kernels can then be applied efficiently by using convolution. This scheme can assist in finding the filter kernels of linear operations applied directly to mosaic images acquired by digital cameras. For example, using this approach any algorithmic description for the demosaicing problem, which is linear and block shift-invariant, can be translated into actual filter kernels that can be applied efficiently.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The impulse responses of block shift-invariant systems and their use for demosaicing algorithms


    Contributors:
    Hel-Or, Y. (author)


    Publication date :

    2005-01-01


    Size :

    173958 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Fast Algorithms for Single Chip Video Demosaicing

    Mukherjee, J. / Mitra, S. K. / Visual Information Engineering Network (Institution of Engineering and Technology) | British Library Conference Proceedings | 2006


    Joint Demosaicing and Denoising

    Hirakawa, K. / Parks, T. W. | British Library Conference Proceedings | 2005


    Joint demosaicing and denoising

    Hirakawa, K. / Parks, T.W. | IEEE | 2005


    Dynamic demosaicing of camera pixels

    PATEL SHIV G / MURAD MOHANNAD / MACHAK JOSEPH G et al. | European Patent Office | 2020

    Free access