Breadth-first quad encoding for network picture browsing

A Hunter, P Willis

Research output: Contribution to journalArticle

Abstract

Breadth-first quad encoding is shown to be a good method of picture representation for networked browsing of colour raster pictures. The twin requirements of partial transmission and compression are discussed. Efficient algorithms for the display of sub-areas of a picture, at varying resolution, are developed; suggestions are made for further generalisation. Particular attention is paid to tesseral addressing, and the way that it can be exploited to produce efficient traversal and display algorithms. A sample non-recursive algorithm is included. The problem of quad-encoding arbitrarily dimensioned pictures is addressed.
Original languageEnglish
Pages (from-to)419-432
Number of pages14
JournalComputers & Graphics
Volume13
Issue number4
DOIs
Publication statusPublished - 1989

Fingerprint

Display devices
Color

Cite this

Breadth-first quad encoding for network picture browsing. / Hunter, A; Willis, P.

In: Computers & Graphics, Vol. 13, No. 4, 1989, p. 419-432.

Research output: Contribution to journalArticle

Hunter, A ; Willis, P. / Breadth-first quad encoding for network picture browsing. In: Computers & Graphics. 1989 ; Vol. 13, No. 4. pp. 419-432.
@article{0f0d45025d9d4425b5dd17c9bce6c8bf,
title = "Breadth-first quad encoding for network picture browsing",
abstract = "Breadth-first quad encoding is shown to be a good method of picture representation for networked browsing of colour raster pictures. The twin requirements of partial transmission and compression are discussed. Efficient algorithms for the display of sub-areas of a picture, at varying resolution, are developed; suggestions are made for further generalisation. Particular attention is paid to tesseral addressing, and the way that it can be exploited to produce efficient traversal and display algorithms. A sample non-recursive algorithm is included. The problem of quad-encoding arbitrarily dimensioned pictures is addressed.",
author = "A Hunter and P Willis",
year = "1989",
doi = "10.1016/0097-8493(89)90003-4",
language = "English",
volume = "13",
pages = "419--432",
journal = "Computers & Graphics",
issn = "0097-8493",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Breadth-first quad encoding for network picture browsing

AU - Hunter, A

AU - Willis, P

PY - 1989

Y1 - 1989

N2 - Breadth-first quad encoding is shown to be a good method of picture representation for networked browsing of colour raster pictures. The twin requirements of partial transmission and compression are discussed. Efficient algorithms for the display of sub-areas of a picture, at varying resolution, are developed; suggestions are made for further generalisation. Particular attention is paid to tesseral addressing, and the way that it can be exploited to produce efficient traversal and display algorithms. A sample non-recursive algorithm is included. The problem of quad-encoding arbitrarily dimensioned pictures is addressed.

AB - Breadth-first quad encoding is shown to be a good method of picture representation for networked browsing of colour raster pictures. The twin requirements of partial transmission and compression are discussed. Efficient algorithms for the display of sub-areas of a picture, at varying resolution, are developed; suggestions are made for further generalisation. Particular attention is paid to tesseral addressing, and the way that it can be exploited to produce efficient traversal and display algorithms. A sample non-recursive algorithm is included. The problem of quad-encoding arbitrarily dimensioned pictures is addressed.

UR - http://dx.doi.org/10.1016/0097-8493(89)90003-4

U2 - 10.1016/0097-8493(89)90003-4

DO - 10.1016/0097-8493(89)90003-4

M3 - Article

VL - 13

SP - 419

EP - 432

JO - Computers & Graphics

JF - Computers & Graphics

SN - 0097-8493

IS - 4

ER -