Runlength-based processing methods for low bit-depth images

Authors:
Øyvind Ryan
Affiliations:
Centre of Mathematics for Applications, University of Oslo, Oslo, Norway
Venue:
IEEE Transactions on Image Processing
Year:
2009

Citing 8
Cited 2

LZW data compression

Dr. Dobb's Journal
Introduction to data compression (2nd ed.)

Introduction to data compression (2nd ed.)
JPEG 2000: Image Compression Fundamentals, Standards and Practice

JPEG 2000: Image Compression Fundamentals, Standards and Practice
Computer Architecture: A Quantitative Approach

Computer Architecture: A Quantitative Approach
Novel word-level algorithm of embedded block coding in JPEG 2000

ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
The RIM framework for image processing

ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Compression of map images by multilayer context tree modeling

IEEE Transactions on Image Processing
Analysis and architecture design of block-coding engine for EBCOT in JPEG 2000

IEEE Transactions on Circuits and Systems for Video Technology

Dynamic tiled map services: supporting query-based visualization of large-scale raster geospatial data

Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application
Influence of the number and pattern of geometrical entities in the image upon PNG format image size

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many low bit-depth images are compactly expressed in terms of runlength-based representations. This paper discusses methods for processing such images directly in runlength-represented form and how this can improve processing times for image processing operations. The primary focus in the analysis is on image compression operations, but an explanation of the overall scheme for runlength-based processing is also presented. Tradeoffs between processing times and compression ratio for runlength-based image compression algorithms are discussed. Sketches of runlength-based compression algorithms for some widely used image standards are given, and the algorithms are compared with raster-based counterparts. Important design features needed in implementations of runlength-based image processing are discussed. The main application areas of runlength-based image processing are also explained.