An adaptive algorithm for conversion from quadtree to chain codes

Frank Y. Shih, Wai Tak Wong

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

An adaptive algorithm is presented for converting the quadtree representation of a binary image to its chain code representation. Our algorithm has the advantage of constructing the chain codes of the resulting quadtree of the Boolean operation of two quadtrees by re-using the original chain codes. This algorithm is adaptive because it can adjust the total number of internal nodes to be stored and retrieve it later in the reconstruction stage. The algorithm possesses parallelism and is suited for pyramid architecture. Our algorithm requires time O(H + L) in sequential and time O(N) in parallel, where H is the height of the quadtree. L is the length of the chain code sequence generated, and N x N is the size of the input image.

Original languageEnglish (US)
Pages (from-to)631-639
Number of pages9
JournalPattern Recognition
Volume34
Issue number3
DOIs
StatePublished - Mar 2001

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Keywords

  • Adaptive conversion
  • Chain code
  • Image representation
  • Parallel algorithm
  • Quadtree

Fingerprint

Dive into the research topics of 'An adaptive algorithm for conversion from quadtree to chain codes'. Together they form a unique fingerprint.

Cite this