Data Compaction in the Polygonal Representation of Images

Minsoo Suk; Hyun-Taek Chang

doi:10.1117/12.952216

1 May 1986 Data Compaction in the Polygonal Representation of Images

Minsoo Suk, Hyun-Taek Chang

Proceedings Volume 0594, Image Coding; (1986) https://doi.org/10.1117/12.952216
Event: 1985 International Technical Symposium/Europe, 1985, Cannes, France

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.

Citation Download Citation

Minsoo Suk and Hyun-Taek Chang "Data Compaction in the Polygonal Representation of Images", Proc. SPIE 0594, Image Coding, (1 May 1986); https://doi.org/10.1117/12.952216

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available