Neighbor Finding Techniques for Images Represented by Quadtrees

Abstract

A number of different techniques are presented for moving between adjacent blocks in an image represented by a quadtree. These adjacencies may be in the horizontal, vertical, or diagonal directions. Algorithms are given and their execution time is analyzed using a suitably defined model.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1980
Accession Number
ADA090240

Entities

People

  • Hanan Samet

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computations
  • Computer Science
  • Decomposition
  • Image Processing
  • Mathematics
  • Probability
  • Quadrants
  • Reasoning
  • Terminals
  • Transitions
  • Trees (Data Structures)
  • Universities

Readers

  • Computer Vision.