From Random to Hierarchical Data through an Irregular Pyramidal Structure

  • Authors:
  • Rimon Elias;Mohab Al Ashraf;Omar Aly

  • Affiliations:
  • Faculty of Digital Media Engineering and Technology, German University in Cairo, New Cairo City, Egypt;Faculty of Digital Media Engineering and Technology, German University in Cairo, New Cairo City, Egypt;Faculty of Digital Media Engineering and Technology, German University in Cairo, New Cairo City, Egypt

  • Venue:
  • GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time consumed querying these random data. Such a structure is built as a series of graphs with different resolutions. Levels are constructed and surviving cells are chosen following irregular irregular pyramidal rules and according to a proximity criterion among the space points under consideration. Experimental results show that using such a structure to query data can save considerable search time.