Optimal algorithm for lossy vector data compression

Abstract

An algorithm for lossy compression of vector data (vector maps, vector graphics, contours of shapes) was developed. The algorithm is based on optimal polygonal approximation for error measure L2 and dynamic quantization of the vector data. The algorithm includes optimal distribution of the approximation line segments among the vector objects, optimal polygonal approximation of the objects with dynamic quantization and construction of the optimal variable-rate vector quantizer. The developed algorithm can be used for lossy compression of one-dimensional signals and multidimensional vector data. © Springer-Verlag Berlin Heidelberg 2007.