Lossless image compression by block matching

JA Storer; HA Helfgott

doi:10.1093/comjnl/40.2_and_3.137

Lossless image compression by block matching

JA Storer, HA Helfgott

The University of Bristol

Research output: Contribution to journal › Article (Academic Journal) › peer-review

29 Citations (Scopus)

Abstract

Lossless image compression has often employed techniques quite separate from those used for text compression or lossy image compression; most standards today employ modelling followed by coding (e.g. the JBIG standard, the IBM Q-coder, CCITT Group 4). Constantinescu and Storer present a lossy image compression scheme that can be viewed as a generalization of lossless dynamic dictionary compression ('LZ2'-type methods) to two dimensions with approximate matching; recently, Constantinescu and Storer have experimented with this approach for lossless hi-level image compression with great success, Here we generalize 'LZ1'-type methods (that identify matches in previously seen text) to lossless image compression. We examine complexity issues and finish by considering practical 2-D implementations for bi-level images.

Translated title of the contribution	Lossless image compression by block matching
Original language	English
Pages (from-to)	137 - 145
Journal	Computer Journal
Volume	40
Issue number	2-3
DOIs	https://doi.org/10.1093/comjnl/40.2_and_3.137
Publication status	Published - 1997

Bibliographical note

Publisher: Cambridge Univ Press
Other identifier: IDS number YF653

Access to Document

10.1093/comjnl/40.2_and_3.137

Handle.net

Persistent link

Cite this

@article{9711e954588040109434874be4daa2fa,

title = "Lossless image compression by block matching",

abstract = "Lossless image compression has often employed techniques quite separate from those used for text compression or lossy image compression; most standards today employ modelling followed by coding (e.g. the JBIG standard, the IBM Q-coder, CCITT Group 4). Constantinescu and Storer present a lossy image compression scheme that can be viewed as a generalization of lossless dynamic dictionary compression ('LZ2'-type methods) to two dimensions with approximate matching; recently, Constantinescu and Storer have experimented with this approach for lossless hi-level image compression with great success, Here we generalize 'LZ1'-type methods (that identify matches in previously seen text) to lossless image compression. We examine complexity issues and finish by considering practical 2-D implementations for bi-level images.",

author = "JA Storer and HA Helfgott",

note = "Publisher: Cambridge Univ Press Other identifier: IDS number YF653",

year = "1997",

doi = "10.1093/comjnl/40.2_and_3.137",

language = "English",

volume = "40",

pages = "137 -- 145",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "2-3",

}

TY - JOUR

T1 - Lossless image compression by block matching

AU - Storer, JA

AU - Helfgott, HA

N1 - Publisher: Cambridge Univ Press Other identifier: IDS number YF653

PY - 1997

Y1 - 1997

N2 - Lossless image compression has often employed techniques quite separate from those used for text compression or lossy image compression; most standards today employ modelling followed by coding (e.g. the JBIG standard, the IBM Q-coder, CCITT Group 4). Constantinescu and Storer present a lossy image compression scheme that can be viewed as a generalization of lossless dynamic dictionary compression ('LZ2'-type methods) to two dimensions with approximate matching; recently, Constantinescu and Storer have experimented with this approach for lossless hi-level image compression with great success, Here we generalize 'LZ1'-type methods (that identify matches in previously seen text) to lossless image compression. We examine complexity issues and finish by considering practical 2-D implementations for bi-level images.

AB - Lossless image compression has often employed techniques quite separate from those used for text compression or lossy image compression; most standards today employ modelling followed by coding (e.g. the JBIG standard, the IBM Q-coder, CCITT Group 4). Constantinescu and Storer present a lossy image compression scheme that can be viewed as a generalization of lossless dynamic dictionary compression ('LZ2'-type methods) to two dimensions with approximate matching; recently, Constantinescu and Storer have experimented with this approach for lossless hi-level image compression with great success, Here we generalize 'LZ1'-type methods (that identify matches in previously seen text) to lossless image compression. We examine complexity issues and finish by considering practical 2-D implementations for bi-level images.

U2 - 10.1093/comjnl/40.2_and_3.137

DO - 10.1093/comjnl/40.2_and_3.137

M3 - Article (Academic Journal)

SN - 0010-4620

VL - 40

SP - 137

EP - 145

JO - Computer Journal

JF - Computer Journal

IS - 2-3

ER -

Lossless image compression by block matching

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this