@article {13633,
	title = {Residual coding in document image compression},
	journal = {Image Processing, IEEE Transactions on},
	volume = {9},
	year = {2000},
	month = {2000/06//},
	pages = {961 - 969},
	abstract = {Symbolic document image compression relies on the detection of similar patterns in a document image and construction of a prototype library. Compression is achieved by referencing multiple pattern instances ( ldquo;components rdquo;) through a single representative prototype. To provide a lossless compression, however, the residual difference between each component and its assigned prototype must be coded. Since the size of the residual can significantly affect the compression ratio, efficient coding is essential. We describe a set of residual coding models for use with symbolic document image compression that exhibit desirable characteristics for compression and rate-distortion and facilitate compressed-domain processing. The first model orders the residual pixels by their distance to the prototype edge. Grouping pixels based on this distance value allows for a more compact coding and lower entropy. This distance model is then extended to a model that defines the structure of the residue and uses it as a basis for continuous and packet reconstruction which provides desired functionality for use in lossy compression and progressive transmission},
	keywords = {coding, coding;compressed-domain, coding;entropy;lossless, coding;image, communication;, compact, compression;data, compression;document, compression;multiple, construction;rate-distortion;representative, detection;symbolic, difference;residual, distortion, document, edge;prototype, image, library, model;efficient, models;residual, pattern, patterns, pixels;similar, processing;compression, processing;entropy;image, prototype;residual, ratio;continuous, reconstruction;distance, reconstruction;progressive, reconstruction;rate, referencing;packet, theory;visual, transmission;prototype},
	isbn = {1057-7149},
	doi = {10.1109/83.846239},
	author = {Kia,O. E and David Doermann}
}
