About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
DCC 2002
Conference paper
Fast peak autocorrelation finding for periodicity-exploiting compression methods
Abstract
Summary form only given. Bilevel image compression algorithms like JBIG, JBIG2-Generic, and PRECIS can exploit 1D or 2D peak autocorrelation in binary images like 'digital halftones', in order to achieve breakthrough boosts in additional compression. For hard to compress, but periodic halftones, boosts of factors of three or more times the compression ratios and similar increases in decompression speeds can be achieved (boosts defined v.s. the closest related, non-periodicity-exploiting algorithm (e.g. JBIG or JBIG2-Generic with AT>0 v.s. with AT=O, or PRECIS v.s. MMR)). Our peak autocorrelation finding method isolates the needed period for peak compression, two orders-of-magnitude faster than the prior art.