TY - JOUR

T1 - A New Binary Image Representation

T2 - Logicodes

AU - Wu, Jung Gen

AU - Chung, Kuo Liang

N1 - Funding Information:
The authors appreciate the three anonymous referees, Dr. K. Aizawa, and K. Rado for their valuable comments and corrections that helped to improve the presentation and quality of the paper. Especially, one referee spent a lot of time making all remarks directly on the manuscript. This research was supported in part by the National Science Council of R.O.C. under Contracts NSC85-2213-E003-001, NCHC86-08-015, and NSC86-2213-E011-010.

PY - 1997/9

Y1 - 1997/9

N2 - 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.

AB - 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.

KW - Binary image compression

KW - Bincodes

KW - Logical expressions

KW - Logicodes

KW - Minimization

KW - Sarkar's codes

KW - Set operations

KW - Spatial data structures

UR - http://www.scopus.com/inward/record.url?scp=0031223249&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031223249&partnerID=8YFLogxK

U2 - 10.1006/jvci.1997.0360

DO - 10.1006/jvci.1997.0360

M3 - Article

AN - SCOPUS:0031223249

VL - 8

SP - 291

EP - 298

JO - Journal of Visual Communication and Image Representation

JF - Journal of Visual Communication and Image Representation

SN - 1047-3203

IS - 3

ER -