A new lossless compression scheme for bilevel images targeted at binary shapes of image and video objects is presented. The scheme is based on a local analysis of the digital straightness of the causal part of the object boundary, which is used in the context definition for arithmetic encoding. Tested on individual images of binary shapes and binary layers of digital maps the algorithm outperforms PWC, JBIG and MPEG-4 CAE. On the binary shapes the code lengths are reduced by 21%, 25%, and 42%, respectively. On the maps the reductions are 34%, 32%, and 59%, respectively. The algorithm is also more efficient than the state-of-the-art and more complex free tree coder for most of the binary shape and map test images.
|Title of host publication||Data Compression Conference, 2004. Proceedings. DCC 2004|
|Publication status||Published - 2004|
|Event||2004 IEEE Data Compression Conference - Snowbird, UT, United States|
Duration: 23 Mar 2004 → 25 Mar 2004
|Conference||2004 IEEE Data Compression Conference|
|Period||23/03/2004 → 25/03/2004|