Computing the Euler Number of an Image from Its Quadtree

Abstract

An algorithm is presented which computes the Euler number, ie., the number of components minus the number of holes, of a binary image represented by the quadtree. The local property counting techniques used with an array representation are generalized to counting local node configurations in a quadtree. The average worst case running time of the algorithm is proportional to the product of the number of nodes representing the components and the logarithm of the image diameter.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1979
Accession Number
ADA084289

Entities

People

  • Charles R. Dyer

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computations
  • Computer Science
  • Geometry
  • Mathematics
  • Night Vision
  • Pattern Recognition
  • Physical Properties
  • Recognition
  • Security
  • Terminals
  • Universities

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.