By Topic

An iterative algorithm for two-dimensional digital least metric problems with applications to digital image compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chugg, K.M. ; Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA ; Xiaopeng Chen ; Ortega, A. ; Cheng-Wei Chang

A correspondence between the problem of two-dimensional digital least metric (DLM) fitting and data detection in serially concatenated systems in digital communication theory is described. Nearly optimal detection algorithms based on previous advances in iterative detection/decoding are applied to the DLM problem for two applications in digital image compression. The first application is least squares halftoning of digital images. The second is near-lossless (i.e., error constrained) minimum-entropy image compression. In both applications the use of the iterative algorithm yields significant improvements, measured in terms of residual metric, relative to previously suggested approaches to the DLM problem

Published in:

Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on  (Volume:2 )

Date of Conference:

4-7 Oct 1998