A New Binary Image Representation: Logicodes

Using bincodes to represent binary images is shown to be very simple and storage-saving. Given a set of bincodes, this paper presents two improved codes, namely, the logicodes and the restricted logicodes to represent binary images. We first transform the given bincodes into a set of logical expressions. Then a minimization technique is employed to reduce the storage space required for these logical expressions, thus obtaining the logicodes, on which set operations can be applied directly. Further, we put some restrictions into these logicodes to make each resulting logicode, called the restricted logicode, representing a connected black block. Given 20 different-type real images, experimental results show that our logicodes (restricted logicodes) present a saving of 29% to 44% (12% to 34%) with respect to bincodes. When compared to Sarkar's method, except spending a little more space, our proposed codes do have three advantages: (1) it is easier to extract the related geometrical coordinates; (2) the bincodes can be used as direct input; i.e., they do compress the bincodes further; and (3) each restricted logicode represents a connected block block.

[1]  Kuo-Liang Chung,et al.  Fast operations on binary images using interpolation-based bintrees , 1995, Pattern Recognit..

[2]  Daniel L. Ostapko,et al.  MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..

[3]  Kuo-Liang Chung,et al.  Finding neighbors on bincode-based images in O(n log log n) time , 1996, Pattern Recognit. Lett..

[4]  E. McCluskey Minimization of Boolean functions , 1956 .

[5]  W. D. Jonge,et al.  S + -trees: an efficient structure for the representation of large pictures , 1994 .

[6]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[7]  Debranjan Sarkar Operations on binary images encoded as minimized Boolean functions , 1997, Pattern Recognit. Lett..

[8]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[9]  Kuo-Liang Chung,et al.  Transformations between bincodes and the DF-expression , 1995, Comput. Graph..

[10]  Charles R. Dyer The space efficiency of quadtrees , 1982, Comput. Graph. Image Process..

[11]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Kuo-Liang Chung,et al.  Efficient search algorithm on compact S-trees , 1997, Pattern Recognit. Lett..

[13]  Kuo-Liang Chung,et al.  Fast implementations for mirroring and rotating bincode-based images , 1998, Pattern Recognit..

[14]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[15]  Hanan Samet,et al.  Applications of spatial data structures , 1989 .

[16]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[17]  Debranjan Sarkar,et al.  Boolean function-based approach for encoding of binary images , 1996, Pattern Recognit. Lett..

[18]  Clifford A. Shaffer,et al.  Generalized comparison of quadtree and bintree storage requirements , 1993, Image Vis. Comput..

[19]  Aris M. Ouksel,et al.  The Interpolation-Based Bintree and encoding of binary images , 1992, CVGIP Graph. Model. Image Process..

[20]  Markku Tamminen,et al.  Encoding pixel trees , 1984, Comput. Vis. Graph. Image Process..

[21]  Kuo-Liang Chung,et al.  A fast search algorithm on modified S-trees , 1995, Pattern Recognit. Lett..

[22]  Günther F. Schrack,et al.  Finding neighbors of equal size in linear quadtrees and octrees in constant time , 1991, CVGIP Image Underst..