Sequential logic compression of images

We present a new algorithm for lossless compression of bilevel images. The algorithm represents the image to be compressed with a sequential logic function and then, minimizes it to obtain a more compact representation. As the minimization of Boolean functions requires a high computational cost, our algorithm represents them with ordered binary-decision diagrams (OBDD), which can be simplified with a low computational cost. Once the OBDD of the sequential logic function has been obtained and reduced, it is coded efficiently in order to reduce the redundancy present on it. Arithmetic coding is also used to remove even more the residual redundancy. The results obtained show significant improvements with respect to previous works