Technical section
Breadth-first quad encoding for networked picture browsing

https://doi.org/10.1016/0097-8493(89)90003-4Get rights and content

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.

References (18)

  • S.L. Tanimoto

    Image transmission with gross information first

    Comp. Graphics and Image Processing

    (1979)
  • C. Anedda et al.

    P-compressed quadtrees for image storing

    The Comp. J.

    (1988)
  • W. A. Davis and X. Wang, A new approach to linear quadtrees. Graphics Interface '85, pp....
  • F. Fabbrini et al.

    Autumnal quadtrees

    The Comp. J.

    (1986)
  • I. Gargantini

    An effective way to represent quadtrees

    Comm. of the ACM

    (December 1982)
  • F.S. Hill et al.

    Interactive image query system using progressive transmission

    Comp. Graphics

    (July 1983)
  • A. Hunter, Browsing colour pictures in a network distributed archive system. Ph.D. Thesis, The University of Bath (in...
  • E. Kawaguchi et al.

    On a method of binary-picture representation and its application to data compression

    IEEE T-PAMI

    (January 1980)
  • K. Knowlton

    Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes

There are more references available in the full text version of this article.

Cited by (0)

View full text