This paper studies the theoretical aspects of two-dimensional cellular automata (CAs), it classifies this family into subfamilies with respect to their visual behavior and presents an application to pseudo random number generation by hybridization of these subfamilies. Even though the basic construction of a cellular automaton is a discrete model, its macroscopic behavior at large evolution times and on large spatial scales can be a close approximation to a continuous system. Beyond some statistical properties, we consider geometrical and visual aspects of patterns generated by CA evolution. The present work focuses on the theory of two-dimensional CA with respect to uniform periodic, adiabatic and reflexive boundary CA (2D PB, AB and RB) conditions. In total, there are 512 linear rules over the binary field ℤ2 for each boundary condition and the effects of these CA are studied on applications of image processing for self-replicating patterns. After establishing the representation matrices of 2D CA, these linear CA rules are classified into groups of nine and eight types according to their boundary conditions and the number of neighboring cells influencing the cells under consideration. All linear rules have been found to be rendering multiple self-replicating copies of a given image depending on these types. Multiple copies of any arbitrary image corresponding to CA find innumerable applications in real life situation, e.g. textile design, DNA genetics research, statistical physics, molecular self-assembly and artificial life, etc. We conclude by presenting a successful application for generating pseudo numbers to be used in cryptography by hybridization of these 2D CA subfamilies. [ABSTRACT FROM AUTHOR]