Rectangular based binary image representation: Theory, applications, and dataset introduction

This paper presents the theory and applications of rectangular based binary image representation (RBIR). An automatic method is proposed to convert original binary image into RBIR. Some applications directly derived from RBIR are introduced. RBIR lossless compression is comparable with the run-length encoding (RLE) compression. Efficient algorithms are proposed for computing the dilation/erosion from the RBIR. Unfortunately, converting original image into the RBIR is not a fast process. Hence, a dataset is provided which researchers can use to report their results.

[1]  S. Zahir,et al.  A new rectangular partitioning based lossless binary image compression scheme , 2005, Canadian Conference on Electrical and Computer Engineering, 2005..

[2]  Paul A. Viola,et al.  Rapid object detection using a boosted cascade of simple features , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[3]  Moustafa M. Fahmy,et al.  Binary image compression using efficient partitioning into rectangular regions , 1995, IEEE Trans. Commun..

[4]  Moustafa M. Fahmy,et al.  Binary text image compression using overlapping rectangular partitioning , 1999, Pattern Recognit. Lett..

[5]  Jim Piper,et al.  Erosion and dilation of binary images by arbitrary structuring elements using interval coding , 1989, Pattern Recognit. Lett..

[6]  Anthony J. T. Lee,et al.  A data mining approach to face detection , 2010, Pattern Recognit..

[7]  HyunWook Park,et al.  Automatic target detection using binary template matching , 2005 .

[8]  Seong-Dae Kim,et al.  Fast Algorithms for Binary Dilation and Erosion Using Run-Length Encoding , 2005 .

[9]  Seong-Dae Kim,et al.  A new chain-coding algorithm for binary images using run-length codes , 1988, Comput. Vis. Graph. Image Process..