Distortion-constrained compression of vector maps

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 8-12

  Kolesnikov, Alexander ^a   Akimov, Alexander ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

Compression; Polygonal approximation; Quantization; Simplification; Vector map

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONFORMAL MAPPING; CONSTRAINED OPTIMIZATION; ERROR ANALYSIS; OPTIMAL SYSTEMS; VECTOR QUANTIZATION;

CONSTRAINED QUANTIZERS; ERROR TOLERANCE; POLYGONAL APPROXIMATION; VECTOR MAPS;

DATA COMPRESSION;

EID: 35248899393     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244005     Document Type: Conference Paper

References (17)

1. Akimov, A., Kolesnikov, A., Fränti, P. Coordinate quantization in vector map compression, In Proc. IASTED Int. Conf. Visualization, Imaging and Image Processing-VIIP'04, Marbella, Spain, 2004, 748-753.
2. Bertolotto, M., and Ehgenhofer, M. Progressive transmission of vector map data over the World Wide Web, Geolnformatica, 5, (2001) 345-373.
3. Buttenfield, B.P. Transmitting vector geospatial data across the Internet, Proc. GIScience, Berlin, LNCS, vol. 2478, (2002) 51-64.
4. Chan, W.S., and Chin, F. On approximation of polygonal curves with minimum number of line segments or minimum error, Int. J. Comput. Geometry and Applications, 6 (1996) 59-77.
5. Douglas, D.H., and Peucker, T.K. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature, The Canadian Cartographer, 10, 2(1973), 112-122.
6. Dunham, J. Optimum uniform piecewise linear approximation of planar curves, IEEE Transactions on Pattern Analysis and Machine Intelligence, 8, 1 (1986)67-75.
7. Imai, H., and Iri, M. Computational-geometric methods for polygonal approximations of a curve, Computer Vision, Graphics and Image Processing, 36 (1986), 31-41.
8. Kolesnikov, A., and Fränti, P. Optimal multiresolution polygonal approximation, In. Proc. Int. Conf.on Image Processing-ICIP'04, Singapore, October 2004, 3037-3040.
9. Kolesnikov, A. Optimal encoding of vector data with polygonal approximation and vertex quantization, In Proc. IAPR 14th Scandinavian Conf. on Image Analysis-SCIA '05, Joensuu, Finland, 2005, LNCS, vol. 3540, 2005, 1186-1195,.
10. Kolesnikov, A., and Fränti, P. Data reduction of large vector graphics, Pattern Recognition, 38, 3 (2005), 381-394.
11. Li, Z., and Oppenshaw, S. A natural principle for the objective generalization of digital maps, Cartography and Geographical Information Systems, 20, (1993) 19-29.
12. Schuster, G.M., and Katsaggelos, A.K. An optimal polygonal boundary encoding scheme in the rate-distortion sense, IEEE Trans. on Image Processing, 1, (1998), 13-26.
13. Schuster, G. M., Meinikov, G., and Katsaggelos, A.K. Operationally optimal vertex-based shape coding, IEEE Signal Processing Magazine, vol. 15, (1998), 91-108.
14. Shekhar, S., Huang, Y., Djugash, J., and Zhou, C. Vector map compression: a clustering approach. In: Proceedings of 10th ACM International Symposium Advances in Geographic Information Systems-GIS'02. 2002, 74-80.
15. Shekhar, S., Huang, Y., and Djugash, J. Dictionary design algorithms for vector map compression, In Proceedings of Data Compression Conference, 2002, 471.
16. Visvalingam, M., and Whyatt, J. Line generalization by repeated elimination of points, Cartographic Journal, 30, 1 (1993), 46-51.
17. ∞-constrained high fidelity image compression via adaptive context modeling, IEEE Trans, on Image Processing, 9, (2000) 536-542.