Optimal encoding of vector data with polygonal approximation and vertex quantization

Authors:
Alexander Kolesnikov
Affiliations:
Speech and Image Processing Unit Department of Computer Science, University of Joensuu, Joensuu, Finland
Venue:
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Year:
2005

Citing 9
Cited 2

Optimum Uniform Piecewise Linear Approximation of Planar Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
Vector quantization and signal compression

Vector quantization and signal compression
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
Vector map compression: a clustering approach

Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Reduced-search dynamic programming for approximation of polygonal curves

Pattern Recognition Letters
Data reduction of large vector graphics

Pattern Recognition
Quantization

IEEE Transactions on Information Theory
An optimal polygonal boundary encoding scheme in the rate distortion sense

IEEE Transactions on Image Processing

Distortion-constrained compression of vector maps

Proceedings of the 2007 ACM symposium on Applied computing
Optimal algorithm for lossy vector data compression

ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Problem of lossy compression of vector data is considered. We attack the problem by jointly considering data reduction by polygonal approximation and quantization of the prediction errors for approximation nodes. Optimal algorithms proposed for vector data encoding with minimal distortion for given target bit-rate, and with minimal bit-rate for given maximum deviation.