The design and analysis of spatial data structures
The design and analysis of spatial data structures
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
The JPEG still picture compression standard
Communications of the ACM - Special issue on digital multimedia systems
The Interpolation-Based Bintree and encoding of binary images
CVGIP: Graphical Models and Image Processing
S+-trees: an efficient structure for the representation of large pictures
CVGIP: Image Understanding
Boolean function-based approach for encoding of binary images
Pattern Recognition Letters
Binary text image compression using overlapping rectangular partitioning
Pattern Recognition Letters
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
An effective way to represent quadtrees
Communications of the ACM
An Exact Closed-Form Formula for d-Dimensional Quadtree Decomposition of Arbitrary Hyperrectangles
IEEE Transactions on Knowledge and Data Engineering
Journal of Visual Communication and Image Representation
Study on huber fractal image compression
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Two-Dimensional Polar Harmonic Transforms for Invariant Image Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image representation using accurate orthogonal Gegenbauer moments
Pattern Recognition Letters
A fast algorithm for computing moments of gray images based on NAM and extended shading approach
Frontiers of Computer Science in China
Image compression through wavelet transform coding
IEEE Transactions on Information Theory - Part 2
Discrete Markov image modeling and inference on the quadtree
IEEE Transactions on Image Processing
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
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.