Constructing Trees for Region Description

Abstract

A thresholded (binary) image can be represented as a region tree in which each node corresponds to a component of 1's (object) or 0's (background). If regions O and B share a border, then one encloses the other. This enclosure relation defines the tree. The chain code of the component and a description based on statistical features are stored at each node. The region tree is built in a single pass over the image.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1977
Accession Number
ADA045338

Entities

People

  • David L. Milgram

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Coding
  • Computer Programming
  • Computer Science
  • Data Science
  • Hash Tables
  • Image Processing
  • Information Processing
  • Information Science
  • Maryland
  • Night Vision
  • Security
  • Statistics
  • Theoretical Computer Science
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Vision.
  • Neural Network Machine Learning.