Set Enumeration Tree based Image Representation for Gray Level Image Storage and Retrieval

Muhammad Suzuri Hitam, Pong Kuan Peng, Wan Nural Jawahir Hj Wan Yussof, Abdul Aziz K Abdul Hamid, Ghazali Sulong


The recent growth of communications and multimedia applications had led to the requirement of mass storage space as well as efficient retrieval technique especially for multimedia data. In this paper, a novel approach for representing gray level image for data storage and image retrieval is proposed. The proposed approach used set enumeration tree data structures where only unique image pattern is stored in the image data structure. The overall structure involves two types of tree data structures; the first tree is low-level image pattern tree to store the unique gray level image pattern and the second tree is used to store the image path by referring to the first tree data structure. The low-level image pattern tree is predefined and will not expand throughout the image encoding process. The size of the second tree is gradually expanded as the result of addition of new image path during image encoding. Through unique image pattern encoding into a tree, there will be no redundant image features, thus leading to saving storing space. Caltech-101 gray level image datasets were used to test the proposed approach and the results showed that it could lead to saving storage space while provide promising performance in image retrieval.


Image Compression; Retrieval; Set Enumeration Tree; Storage;

Full Text:



S. Dhawan, “A review of image compression and comparison of its algorithms,” International Journal of Electronics & Communication Technology, vol. 2, no. 1, pp. 22-26, 2011.

M. Marimuthu, R. Muthaiah, and P. Swaminathan, “Review article: An overview of image compression techniques,” Research Journal of Applied Sciences, Engineering and Technology,” vol. 4, no. 24, pp. 5381-5386, 2012.

J. Ziv, and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Transactions on Information Theory, vol. 23, no. 3, pp. 337-343, 1977.

T.A.Welch, “A technique for high-performance data compression,” Computer, vol. 17, no. 6, pp. 8-19, 1984.

M. Rabbani, and P. W. Jones, Digital Image Compression Techniques. Society of Photo-Optical Instrumentation Engineers, Bellingham: SPIE Opt. Eng. Press, 1991.

I.H. Witten, R.M. Neal, and J. G. Cleary, “Arithmetic coding for data compression,” Communication, vol. 30, pp. 520-540, 1987.

D.A. Huffman, “A method for the construction of minimumredundancy codes,” in Proceedings IRE, vol. 40, 1962, pp. 1098-1101.

R.J. Clarke, Transform coding of images. San Diego: Academic Press, 1985.

G.K. Wallace, “The JPEG still picture compression standard,” IEEE Transactions on Consumer Electronics, vol. 38, no. 1, pp. xviii-xxxiv, 1992.

J. Sivic, and A. Zisserman, “Video Google: A text retrieval approach to object matching in videos,” in Proceedings of the Ninth IEEE International Conference on Computer Vision, vol. 2, 2003, pp. 1470- 1477.

P. Indyk, and R. Motwani, “Approximate nearest neighbors: Towards removing the curse of dimensionality,” in Proceedings of 30th annual ACM symposium on Theory of computing, ACM, 1998, pp. 604-613.

R. Shekhar, and C. V. Jawahar, “Word image retrieval using bag of visual words,” in 10th IAPR International Workshop on Document Analysis Systems, 2012, pp. 297-301.

A. Kumar, J. Kim, L. Wen, M. Fulham, and D. Feng, A graph-based approach for the retrieval of multi-modality medical images,” Medical Image Analysis, vol. 18, no. 2, pp. 330-342, 2014.

Z. Gao, W. Bu, Y. Zheng, and X. Wu, “Automated layer segmentation of macular OCT images via graph-based SLIC superpixels and manifold ranking approach,” Computerized Medical Imaging and Graphics, vol. 55, pp. 42-53, 2017.

K. Grauman, and T. Darrell, “The pyramid match kernel: Discriminative classification with sets of image features,” in Proceedings of the 10th IEEE International Conference on Computer Vision, vol.2, 2005, pp. 1458–1465.

S. Lazebnik, C. Schmid, and J. Ponce, “Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories,” in Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2, 2006, pp. 2169-2178.

C. Silpa-Anan, and R. Hartley, “Optimised KD-trees for fast image descriptor matching,” in Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2008, pp. 1-8.

V.P. SubramanyamRallabandi, and S.K. Sett, “Image retrieval system using R-tree self-organizing map,” Data & Knowledge Engineering, vol. 61, no. 3, pp. 524-539, 2007.

T. Skopal, and J. Lokoč, “New dynamic construction techniques for Mtree,” Journal of Discrete Algorithms, vol. 7, no. 1, pp. 62-77, 2009.

C. Douglas, “The ubiquitous B-tree,” ACM Computing Surveys, vol. 11, no. 2, pp.121-137, 1979.

H. Samet, “The quadtree and related hierarchical data structures,” ACM Computing Surveys, vol. 16, no. 2, pp. 187-260, 1984.

T. Markas, and J. Reif, “Quad tree structures for image compression applications,” Information Processing & Management, vol. 28, no. 6, pp. 707-721, 1992.

R. Rymon, “Search through systematic set enumeration,” in Proceedings of 3rd International Conference on Principles of Knowledge Representation and Reasoning, 1992, pp. 539-550.

F. Guil, and R. Marin, “A tree structure for event-based sequence mining,” Knowledge-Based Systems, vol. 35, pp. 186-200, 2012.

L. Fei-Fei, R. Fergus, and P. Perona, “Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories,” Computer Vision and Image Understanding, vol. 106, no. 1, pp. 59-70, 2007.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

ISSN: 2180-1843

eISSN: 2289-8131