In this paper we present a new block adaptive coding scheme which uses non-rectangular Laplacian Pyramid Algorithms. The proposed method JB adapted to the local image contents. The original image is broken into subimages according to some previously specified bidimensional activity function defined on the frequency domain. Then, the appropiate algonthm defined on arbitrary sampling lattices is applied and matched to the image contents. The code produces images with notably sharper detail and more pleasing appearance than the Laplacian Pyramid coding, since the method is matched to the local statisfical properties of the image. Good visual quality is obtained for low bit rates.

Peer Reviewed