Affordable Access

Publisher Website

A generalized solution to the quadtree expected complexity problem

Authors
Journal
Pattern Recognition Letters
0167-8655
Publisher
Elsevier
Publication Date
Volume
16
Issue
5
Identifiers
DOI: 10.1016/0167-8655(95)00126-2
Keywords
  • Quadtree
  • Expected Complexity
  • Soft-Linked Quadtree
  • Link Strength
  • Node Condensation
Disciplines
  • Computer Science

Abstract

Abstract Complexity in tree-structured hierarchical representation of images is defined as the total number of nodes in the tree. An a priori knowledge of this quantity is of considerable interest in problems involving tree traversal-based search algorithms and storage and transmission of imagery using hierarchical compression coding. This paper derives a closed-form expression for expected complexity by developing a generalized weighting function defined over a primitive element of a soft-linked quadtree.

There are no comments yet on this publication. Be the first to share your thoughts.