Comparison of Image Decompositions Through Inverse Difference and Laplacian Pyramids

Abstract

In this work, the Inverse Difference Pyramid (IDP) and its modification – the Reduced IDP (RIDP), are compared and evaluated with the famous Laplacian Pyramid (LP) for multi-level decomposition of digital images. The comparison comprises: the structures of LP and IDP, the image representation through LP and IDP in the pixel space and in the spectrum space of the Fourier transform, the efficiency of both transforms for the aims of the progressive image transfer, the LP and the IDP computation graphs and the evaluation of the computational complexity of the algorithms for the 3-level reduced LP and the 3-level reduced IDP. The influence of the quantization noise on both decompositions is also analyzed. On the basis of the comparison are outlined the basic advantages of the RIDP for pipeline image processing. The results obtained could be used for the design of coders for image compression, aimed at real-time applications, etc.