A novel gray image representation using overlapping rectangular NAM and extended shading approach

In this paper, inspired by the idea of overlapping rectangular region coding of binary images, we extend the SDS design, which is based on overlapping representation from binary images to gray images based on the non-symmetry and anti-packing model (NAM). A novel gray image representation is proposed by using the overlapping rectangular NAM (RNAM) and the extended Gouraud shading approach, which is called ORNAM representation. Also, we present an ORNAM representation algorithm of gray images. The encoding and the decoding of the proposed algorithm can be performed in O(n logn) time and O(n) time, respectively, where n denotes the number of pixels in a gray image. The wrong decoding problem of the hybrid matrix R for the overlapping RNAM representation of gray images is solved by using the horizontal, vertical, and isolated matrices, i.e., H, V and I, respectively, which are used to identify the vertex types. Also, we put forward four criteria of anti-packing homogeneous blocks. In addition, by redefining a codeword set for the three vertices symbols, we also propose a new coordinate data compression procedure for coding the coordinates of all non-zone elements in the three matrices H, V and I. By taking some idiomatic standard gray images in the field of image processing as typical test objects, and by comparing our proposed ORNAM representation with the conventional S-Tree Coding (STC) representation, the experimental results in this paper show that the former has higher compression ratio and less number of homogeneous blocks than the latter whereas maintaining a satisfactory image quality, and therefore it is a better method to represent gray images.

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

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

[3]  Shyh-Kwei Chen,et al.  An exact closed-form formula for d-dimensional quadtree decomposition of arbitrary hyperrectangles , 2006, IEEE Transactions on Knowledge and Data Engineering.

[4]  Ronald A. DeVore,et al.  Image compression through wavelet transform coding , 1992, IEEE Trans. Inf. Theory.

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

[6]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1992 .

[7]  Patrick Pérez,et al.  Discrete Markov image modeling and inference on the quadtree , 2000, IEEE Trans. Image Process..

[8]  Minglun Gong,et al.  Quadtree-based genetic algorithm and its applications to computer vision , 2004, Pattern Recognit..

[9]  Steven K. Feiner,et al.  Computer graphics: principles and practice (2nd ed.) , 1990 .

[10]  Zheng,et al.  A Novel Non-Symmetry and Anti-Packing Model for Image Representation , 2009 .

[11]  Daniel G. Bobrow,et al.  CLOS: integrating object-oriented and functional programming , 1991, CACM.

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

[13]  Kuo-Liang Chung,et al.  A hybrid gray image representation using spatial- and DCT-based approach with application to moment computation , 2006, J. Vis. Commun. Image Represent..

[14]  Karthik S. Gurumoorthy,et al.  A Method for Compact Image Representation Using Sparse Matrix and Tensor Projections Onto Exemplar Orthonormal Bases , 2010, IEEE Transactions on Image Processing.

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

[16]  Xudong Jiang,et al.  Two-Dimensional Polar Harmonic Transforms for Invariant Image Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Yunping Zheng,et al.  A fast algorithm for computing moments of gray images based on NAM and extended shading approach , 2010, Frontiers of Computer Science in China.

[18]  Jyh-Horng Jeng,et al.  Study on Huber Fractal Image Compression , 2009, IEEE Trans. Image Process..

[19]  Riccardo Distasi,et al.  Image compression by B-tree triangular coding , 1997, IEEE Trans. Commun..

[20]  Nobuaki Minematsu,et al.  A Theory of Phase Singularities for Image Representation and its Applications to Object Tracking and Image Matching , 2009, IEEE Transactions on Image Processing.

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

[22]  Yrjö Neuvo,et al.  Interpolative BTC image coding with vector quantization , 1993, IEEE Trans. Commun..

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

[24]  Herbert Freeman Computer Processing of Line Drawings. , 1973 .

[25]  Kuo-Liang Chung,et al.  An efficient algorithm for computing moments on a block representation of a grey-scale image , 2005, Pattern Recognit..

[26]  Kuo-Liang Chung,et al.  Improved image compression using S-tree and shading approach , 2000, IEEE Trans. Commun..

[27]  Khalid M. Hosny,et al.  Image representation using accurate orthogonal Gegenbauer moments , 2011, Pattern Recognit. Lett..

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

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

[30]  Faouzi Kossentini,et al.  The emerging JBIG2 standard , 1998, IEEE Trans. Circuits Syst. Video Technol..

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