By Topic

Transform-based image compression by noise reduction and spatial modification using Boolean minimization

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

3 Author(s)
Agauan, S.S. ; Dept. of Electr. Eng., Texas Univ., San Antonio, TX, USA ; Baran, T.A. ; Panetta, K.A.

A method for the lossy compression of multivalued images using transform-based Boolean minimization is described. Blocks in bit-planes of an image are minimized, and the results of these minimizations are used to detect and reduce noise (sandy regions) and spatial complexity in the blocks. Specifically, the techniques of "minterm uniformalization" and "minterm quantization and thresholding" are presented as methods of discarding perceptually insignificant information from a minimized representation of an image and use data readily available from minimization without the calculation of complicated measures. Experimentally, results comparable to JPEG and better than existing binary techniques can be expected. Fast algorithms may be used, no multiplications are required, and decompression is performed without an inverse transform. Therefore, an emphasis is placed on the use of these algorithms for low-complexity or very high-speed hardware implementations for communications, for distributed and parallel sensor and computing applications, as well as for database storage.

Published in:

Statistical Signal Processing, 2003 IEEE Workshop on

Date of Conference:

28 Sept.-1 Oct. 2003