Share Email Print

Proceedings Paper

Data Compaction in the Polygonal Representation of Images
Author(s): Minsoo Suk; Hyun-Taek Chang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

An efficient data compaction algorithm which reduces the total number of vertices in the polygonal representation of images is presented. The data compaction procedure takes a segmented and polygonally approximated image and transforms it into an ordered list of attribute-minimum cover. The new algorithm incorporates the precedence relation among fields associated with each node of Enclosure Tree as well as enclosure relation among constituent polygons. It is an extension of our previous work which uses only enclosure relation. The algorithm is useful for automated frame creation for pictorial information systems and graphics data compression.

Paper Details

Date Published: 1 May 1986
PDF: 6 pages
Proc. SPIE 0594, Image Coding, (1 May 1986); doi: 10.1117/12.952216
Show Author Affiliations
Minsoo Suk, Syracuse University (United States)
Hyun-Taek Chang, Syracuse University (United States)

Published in SPIE Proceedings Vol. 0594:
Image Coding
Thomas S. Huang; Murat Kunt, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?