Hierarchical Coding of Binary Images

Yoav Cohen, Michael S. Landy, M. (Misha) Pavel

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

Quad trees are a compact hierarchical method of representation of images. In this paper, we explore a number of hierarchical image representations as applied to binary images, of which quadtrees are a single exemplar. We discuss quadtrees, binary trees, and an adaptive hierarchical method. Extending these methods into the third dimension of time results in several other methods. All of these methods are discussed in terms of time complexity, worst case and average compression of random images, and compression results on binary images derived from natural scenes. The results indicate that quadtrees are the most effective for two-dimensional images, but the adaptive algorithms are more effective for dynamic image sequences.

Original languageEnglish (US)
Pages (from-to)284-298
Number of pages15
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
VolumePAMI-7
Issue number3
DOIs
StatePublished - 1985
Externally publishedYes

Fingerprint

Binary images
Binary Image
Quadtree
Coding
Binary trees
Adaptive algorithms
Compression
Image Representation
Binary Tree
Image Sequence
Adaptive Algorithm
Time Complexity

Keywords

  • Binary images
  • hierarchical coding
  • image coding
  • image compression
  • image processing
  • quadtrees

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition
  • Software
  • Applied Mathematics
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Hierarchical Coding of Binary Images. / Cohen, Yoav; Landy, Michael S.; Pavel, M. (Misha).

In: IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-7, No. 3, 1985, p. 284-298.

Research output: Contribution to journalArticle

Cohen, Yoav ; Landy, Michael S. ; Pavel, M. (Misha). / Hierarchical Coding of Binary Images. In: IEEE Transactions on Pattern Analysis and Machine Intelligence. 1985 ; Vol. PAMI-7, No. 3. pp. 284-298.
@article{71771ebe5e34449ca5b5de6afd358ac7,
title = "Hierarchical Coding of Binary Images",
abstract = "Quad trees are a compact hierarchical method of representation of images. In this paper, we explore a number of hierarchical image representations as applied to binary images, of which quadtrees are a single exemplar. We discuss quadtrees, binary trees, and an adaptive hierarchical method. Extending these methods into the third dimension of time results in several other methods. All of these methods are discussed in terms of time complexity, worst case and average compression of random images, and compression results on binary images derived from natural scenes. The results indicate that quadtrees are the most effective for two-dimensional images, but the adaptive algorithms are more effective for dynamic image sequences.",
keywords = "Binary images, hierarchical coding, image coding, image compression, image processing, quadtrees",
author = "Yoav Cohen and Landy, {Michael S.} and Pavel, {M. (Misha)}",
year = "1985",
doi = "10.1109/TPAMI.1985.4767657",
language = "English (US)",
volume = "PAMI-7",
pages = "284--298",
journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
issn = "0162-8828",
publisher = "IEEE Computer Society",
number = "3",

}

TY - JOUR

T1 - Hierarchical Coding of Binary Images

AU - Cohen, Yoav

AU - Landy, Michael S.

AU - Pavel, M. (Misha)

PY - 1985

Y1 - 1985

N2 - Quad trees are a compact hierarchical method of representation of images. In this paper, we explore a number of hierarchical image representations as applied to binary images, of which quadtrees are a single exemplar. We discuss quadtrees, binary trees, and an adaptive hierarchical method. Extending these methods into the third dimension of time results in several other methods. All of these methods are discussed in terms of time complexity, worst case and average compression of random images, and compression results on binary images derived from natural scenes. The results indicate that quadtrees are the most effective for two-dimensional images, but the adaptive algorithms are more effective for dynamic image sequences.

AB - Quad trees are a compact hierarchical method of representation of images. In this paper, we explore a number of hierarchical image representations as applied to binary images, of which quadtrees are a single exemplar. We discuss quadtrees, binary trees, and an adaptive hierarchical method. Extending these methods into the third dimension of time results in several other methods. All of these methods are discussed in terms of time complexity, worst case and average compression of random images, and compression results on binary images derived from natural scenes. The results indicate that quadtrees are the most effective for two-dimensional images, but the adaptive algorithms are more effective for dynamic image sequences.

KW - Binary images

KW - hierarchical coding

KW - image coding

KW - image compression

KW - image processing

KW - quadtrees

UR - http://www.scopus.com/inward/record.url?scp=0022059005&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022059005&partnerID=8YFLogxK

U2 - 10.1109/TPAMI.1985.4767657

DO - 10.1109/TPAMI.1985.4767657

M3 - Article

VL - PAMI-7

SP - 284

EP - 298

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

SN - 0162-8828

IS - 3

ER -