Share Email Print

Proceedings Paper

Edge-data compression using BÚzier polynomials
Author(s): Mohammed Khurrum; Jay B. Jordan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Edge-data compression is concerned with obtaining a representation of an edge while preserving its shape, continuity and smoothness with fewer data points than required for a bitmap. Achieving a very high degree of edge-data compression without much loss in shape, continuity and smoothness is an extremely difficult problem in edge representation. Bezier polynomials have parametric form of equations and are frequently used in computer graphics for interactive generation of smooth curves. Recent studies have resulted in algorithms for an approximate solution to the edge fitting problem using Bezier polynomials. It is shown that application of these algorithms to edges results in a mathematical model capable of a very high degree of data compression. Suitable choices of optimality criteria and applications are also discussed.

Paper Details

Date Published: 10 June 1994
PDF: 7 pages
Proc. SPIE 2232, Signal Processing, Sensor Fusion, and Target Recognition III, (10 June 1994); doi: 10.1117/12.177737
Show Author Affiliations
Mohammed Khurrum, New Mexico State Univ. (United States)
Jay B. Jordan, New Mexico State Univ. (United States)

Published in SPIE Proceedings Vol. 2232:
Signal Processing, Sensor Fusion, and Target Recognition III
Ivan Kadar; Vibeke Libby, Editor(s)

© SPIE. Terms of Use
Back to Top