HIERARCHICAL CODING OF BINARY IMAGES.

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

Research output: Contribution to journalArticle

Abstract

The authors explore a number of hierarchical image representations as applied to binary images. They 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
StatePublished - May 1985

Fingerprint

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

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

HIERARCHICAL CODING OF BINARY IMAGES. / Cohen, Yoav; Landy, Michael; Pavel, M. (Misha).

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

Research output: Contribution to journalArticle

Cohen, Yoav ; Landy, Michael ; 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{963b634ed81f45f9a102eac8a175ac3c,
title = "HIERARCHICAL CODING OF BINARY IMAGES.",
abstract = "The authors explore a number of hierarchical image representations as applied to binary images. They 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.",
author = "Yoav Cohen and Michael Landy and Pavel, {M. (Misha)}",
year = "1985",
month = "5",
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

AU - Pavel, M. (Misha)

PY - 1985/5

Y1 - 1985/5

N2 - The authors explore a number of hierarchical image representations as applied to binary images. They 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 - The authors explore a number of hierarchical image representations as applied to binary images. They 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.

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

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

M3 - Article

AN - SCOPUS:0022059005

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 -