On Redundancy of Rice Coding

Alexandre  Krivoulets

On Redundancy of Rice Coding

Alexandre Krivoulets

Research output: Book / Anthology / Report › Report › Research

Abstract

In this paper we derive the relative per-symbol redundancy of the Rice coding algorithm, which is a widely used technique in image compression for very fast entropy coding. We show, that for some important source models, such as the two-sided geometric distribution (TSGD), the redundancy depends on the source entropy H and it tends to zero if H -> oo. The redundancy is upper bounded by 50% if H -> 0.

Original language	English

Place of Publication	Copenhagen
Publisher	IT-Universitetet i København
Edition	TR-2003-32
Number of pages	10
ISBN (Electronic)	87-7949-043-3
Publication status	Published - Sept 2003
Externally published	Yes

Series	IT University Technical Report Series
Number	TR-2003-32
ISSN	1600-6100

Keywords

Rice coding algorithm
Image compression
Entropy coding
Relative per-symbol redundancy
Two-sided geometric distribution (TSGD)

Access to Document

ITU-TR-2003-32 pdfFinal published version, 230 KB

Cite this

@book{4ba9562643ab44ce90f732cdecafd77b,

title = "On Redundancy of Rice Coding",

abstract = "In this paper we derive the relative per-symbol redundancy of the Rice coding algorithm, which is a widely used technique in image compression for very fast entropy coding. We show, that for some important source models, such as the two-sided geometric distribution (TSGD), the redundancy depends on the source entropy H and it tends to zero if H -> oo. The redundancy is upper bounded by 50\% if H -> 0.",

keywords = "Rice coding algorithm, Image compression, Entropy coding, Relative per-symbol redundancy, Two-sided geometric distribution (TSGD)",

author = "Alexandre Krivoulets",

year = "2003",

month = sep,

language = "English",

series = "IT University Technical Report Series",

number = "TR-2003-32",

publisher = "IT-Universitetet i K{\o}benhavn",

address = "Denmark",

edition = "TR-2003-32",

}

TY - RPRT

T1 - On Redundancy of Rice Coding

AU - Krivoulets, Alexandre

PY - 2003/9

Y1 - 2003/9

N2 - In this paper we derive the relative per-symbol redundancy of the Rice coding algorithm, which is a widely used technique in image compression for very fast entropy coding. We show, that for some important source models, such as the two-sided geometric distribution (TSGD), the redundancy depends on the source entropy H and it tends to zero if H -> oo. The redundancy is upper bounded by 50% if H -> 0.

AB - In this paper we derive the relative per-symbol redundancy of the Rice coding algorithm, which is a widely used technique in image compression for very fast entropy coding. We show, that for some important source models, such as the two-sided geometric distribution (TSGD), the redundancy depends on the source entropy H and it tends to zero if H -> oo. The redundancy is upper bounded by 50% if H -> 0.

KW - Rice coding algorithm

KW - Image compression

KW - Entropy coding

KW - Relative per-symbol redundancy

KW - Two-sided geometric distribution (TSGD)

M3 - Report

T3 - IT University Technical Report Series

BT - On Redundancy of Rice Coding

PB - IT-Universitetet i København

CY - Copenhagen

ER -

On Redundancy of Rice Coding

Abstract

Keywords

Access to Document

Fingerprint

Cite this