l∞norm based second generation image coding

Many second generation image coding techniques have been studied in recent years. Most of these methods consider the l₂ norm of the error introduced in the coded image, while for the l_∞ case only predictive or transform based methods were considered up to now, focusing on near-lossless coding. In this paper we present a first scheme for l_∞ norm in the framework of second generation image coding. The image is adaptively segmented into rectangular regions of varying size leading to a binary tree decomposition. The grey levels of the pixels within every leaf are approximated by means of l_∞ sub-optimal bilinear surfaces.