Many second generation image coding techniques have been studied in recent years. Most of these methods consider the l2 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.
L-infinity norm based second generation image coding
DALAI, Marco;LEONARDI, Riccardo
2004-01-01
Abstract
Many second generation image coding techniques have been studied in recent years. Most of these methods consider the l2 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.File | Dimensione | Formato | |
---|---|---|---|
DL-ICIP-2004_full-text.pdf
gestori archivio
Tipologia:
Full Text
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
445.88 kB
Formato
Adobe PDF
|
445.88 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
DL_ICIP-2004_post-print.pdf
accesso aperto
Descrizione: DL_ICIP-2004_post-print
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
445.88 kB
Formato
Adobe PDF
|
445.88 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.