10 June 1994 Edge-data compression using Bézier polynomials
Author Affiliations +
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mohammed Khurrum, Jay B. Jordan, "Edge-data compression using Bézier polynomials", Proc. SPIE 2232, Signal Processing, Sensor Fusion, and Target Recognition III, (10 June 1994); doi: 10.1117/12.177737; https://doi.org/10.1117/12.177737
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT


Back to Top