Comparison of the structure and the computational complexity of the inverse difference and Laplacian Pyramids for still image decomposition

In this work, the structures of the Inverse Difference Pyramid (IDP) and its modification - the Reduced IDP (RIDP), are compared and evaluated with the famous Laplacian Pyramid for multi-level decomposition of digital images. The computational complexity of both decompositions is also evaluated. On the basis of the comparison of the block diagrams, which represent the recursive calculation of the 3-level decompositions and of the evaluation of their structures complexity, are outlined the basic advantages of the RIDP for pipeline image processing. The results obtained could be used for design of coders for image compression, aimed at real-time applications.