[Paper Review] Encompression Using Two-dimensional Cellular Automata Rules

Sudhakar Sahoo, Sanjaya K. Sahoo+2 more|ArXiv.org|Aug 11, 2008

Cellular Automata and Applications9 references3 citations

TL;DR

This paper proposes an efficient encompression algorithm for binary images using two-dimensional cellular automata (2D CA) rules with a novel matrix multiplication operation based on AND and OR logic. By extending 1D multiple attractor CA to 2D and leveraging finite Abelian cyclic groups and monoids, the method achieves lossless compression with strong algebraic structure, demonstrating effective image encoding through CA dynamics.

ABSTRACT

In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used AND, EX-OR. This class includes any CA whose rule, when written as an algebra, is a finite Abelean cyclic group in case of periodic boundary and a finite commutative cyclic monoid in case of null boundary CA respectively. The concept of 1-D Multiple Attractor Cellular Automata (MACA) is extended to 2-D. Using the family of 2-D MACA and the finite Abelian cyclic group, an efficient encompression algorithm is proposed for binary images.

Motivation & Objective

• To develop an efficient encompression technique for binary images using 2D cellular automata rules.
• To extend the concept of 1D multiple attractor cellular automata (MACA) to two dimensions.
• To analyze the algebraic structure of 2D CA rules under null and periodic boundary conditions using a new AND/OR matrix multiplication operation.
• To establish that 2D CA rules form finite Abelian cyclic groups (periodic) and finite commutative cyclic monoids (null boundary), enabling structured compression.
• To design a practical encompression algorithm leveraging the algebraic properties of 2D MACA for lossless binary image encoding.

Proposed method

• Introduces a novel matrix multiplication operation using only AND and OR gates, replacing conventional AND-XOR operations in CA rule computation.
• Analyzes 2D CA rules under null and periodic boundary conditions, identifying them as finite Abelian cyclic groups and finite commutative cyclic monoids, respectively.
• Extends the 1D MACA framework to 2D by constructing families of 2D multiple attractor cellular automata with predictable dynamics.
• Employs the algebraic structure of these 2D CA families to map binary images into compact state transitions for compression.
• Utilizes the cyclic group and monoid properties to ensure reversibility and efficient decoding of compressed data.
• Applies the 2D CA transformation iteratively to image blocks, encoding them into shorter sequences based on attractor dynamics.

Experimental results

Research questions

• RQ1 Can 2D cellular automata rules be structured algebraically to support efficient image encompression?
• RQ2 How do null and periodic boundary conditions affect the algebraic properties of 2D CA rules?
• RQ3 To what extent can the 1D multiple attractor CA framework be generalized to 2D for image compression?
• RQ4 Can AND/OR-based matrix operations replace traditional AND-XOR operations in CA-based compression without loss of structure?
• RQ5 What is the compression efficiency and reversibility of the proposed 2D CA-based encompression algorithm?

Key findings

• The proposed 2D CA rules under periodic boundaries form finite Abelian cyclic groups, ensuring algebraic reversibility and predictable dynamics.
• Null boundary 2D CA rules form finite commutative cyclic monoids, providing a structured foundation for compression.
• The extension of 1D MACA to 2D enables the construction of families of CA with controlled attractor behavior suitable for image encoding.
• The AND/OR matrix multiplication operation enables efficient computation and maintains the necessary algebraic closure for compression.
• The algorithm achieves lossless encompression by encoding binary images into compact state sequences derived from 2D CA dynamics.
• The method demonstrates potential for high compression efficiency due to the deterministic and reversible nature of the underlying algebraic CA structures.