Image mosaicking has been a focus of attention of many researchers in recent years. Mosaicking methods which exist today are merely unable to construct mosaics from images taken with large motion parallax. The idea is resembles some kind of layered mosaicking. The proposed method uniformly distributes the parallax mismatch between consecutive frames in the whole mosaic. In this paper, we have shown the results of the developed algorithm on two consecutive frames, as well as the result obtained on a set of frames. Although the resulted mosaic gets a bit blurry by using a set of frames with high motion parallax, it can be completely useable for video compression where the mosaic is used to compute the residuals. The proposed algorithm is much faster than the existing methods which tend to have computation time of several seconds to several minutes. Besides, a multi-resolution version of the algorithm is introduced will lessens the computation time considerably. The obtained results show the efficiency of the proposed algorithm