Abstract
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon and consider the problem of finding the polygon which can be encoded with the smallest number of bits for a given maximum distortion. The presented scheme is an extension of the approaches introduced in [1, 2], in that the admissible polygon vertices belong to a band around the original boundary and a new vertex encoding scheme is proposed.
Original language | English (US) |
---|---|
Title of host publication | IEEE International Conference on Image Processing |
Editors | Anon |
Publisher | IEEE |
Pages | 77-80 |
Number of pages | 4 |
Volume | 2 |
State | Published - Dec 1 1996 |
Event | Proceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3) - Lausanne, Switz Duration: Sep 16 1996 → Sep 19 1996 |
Other
Other | Proceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3) |
---|---|
City | Lausanne, Switz |
Period | 9/16/96 → 9/19/96 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Hardware and Architecture
- Electrical and Electronic Engineering