메뉴 건너뛰기




Volumn 4633 LNCS, Issue , 2007, Pages 761-771

Optimal algorithm for lossy vector data compression

Author keywords

Polygonal approximation; Quantization; Vector data compression; Vector data reduction; Vector map compression

Indexed keywords

ALGORITHMS; OPTIMAL SYSTEMS; VECTOR QUANTIZATION;

EID: 37849049669     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74260-9_68     Document Type: Conference Paper
Times cited : (4)

References (21)
  • 1
    • 0015432623 scopus 로고
    • Optimum Quantization and Permutation Codes
    • Berger, T.: Optimum Quantization and Permutation Codes. IEEE Trans. on Information Theory 18, 759-765 (1972)
    • (1972) IEEE Trans. on Information Theory , vol.18 , pp. 759-765
    • Berger, T.1
  • 3
    • 0030535803 scopus 로고    scopus 로고
    • On approximation of polygonal curves with minimum number of line segments or minimum error. International Journal on Comput
    • Chan, W.S., Chin, F.: On approximation of polygonal curves with minimum number of line segments or minimum error. International Journal on Comput. Geometry and Applications 6, 59-77 (1997)
    • (1997) Geometry and Applications , vol.6 , pp. 59-77
    • Chan, W.S.1    Chin, F.2
  • 5
    • 0001489753 scopus 로고
    • Algorithm for the Reduction of the Number of Points Required to Represent a Line or its Caricature
    • Douglas, D.H., Peucker, T.K.: Algorithm for the Reduction of the Number of Points Required to Represent a Line or its Caricature. The Canadian Cartographer 10, 112-122 (1973)
    • (1973) The Canadian Cartographer , vol.10 , pp. 112-122
    • Douglas, D.H.1    Peucker, T.K.2
  • 7
    • 0022794678 scopus 로고
    • Computational-geometric Methods for Polygonal Approximations of a Curve
    • Imai, H., Iri, M.: Computational-geometric Methods for Polygonal Approximations of a Curve. Computer Vision and Image Processing 36, 31-41 (1986)
    • (1986) Computer Vision and Image Processing , vol.36 , pp. 31-41
    • Imai, H.1    Iri, M.2
  • 11
    • 26444562341 scopus 로고    scopus 로고
    • Kolesnikov, A.: Optimal Encoding of Vector Data with Polygonal Approximation and Vertex Quantization. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, 3540, pp. 1186-1195. Springer, Heidelberg (2005)
    • Kolesnikov, A.: Optimal Encoding of Vector Data with Polygonal Approximation and Vertex Quantization. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, vol. 3540, pp. 1186-1195. Springer, Heidelberg (2005)
  • 13
    • 10044273895 scopus 로고    scopus 로고
    • Data Reduction of Large Vector Graphics
    • Kolesnikov, A., Fränti, P.: Data Reduction of Large Vector Graphics. Pattern Recognition 38, 381-394 (2005)
    • (2005) Pattern Recognition , vol.38 , pp. 381-394
    • Kolesnikov, A.1    Fränti, P.2
  • 14
    • 0042842442 scopus 로고    scopus 로고
    • Reduced Search Dynamic Programming for Approximation of Polygonal Curves
    • Kolesnikov, A., Fränti, P.: Reduced Search Dynamic Programming for Approximation of Polygonal Curves. Pattern Recognition Letters 24, 2243-2254 (2003)
    • (2003) Pattern Recognition Letters , vol.24 , pp. 2243-2254
    • Kolesnikov, A.1    Fränti, P.2
  • 16
    • 0028667327 scopus 로고
    • Optimum Polygonal Approximation of Digitized Curves
    • Perez, J.C., Vidal, E.: Optimum Polygonal Approximation of Digitized Curves. Pattern Recognition Letters 15, 743-750 (1994)
    • (1994) Pattern Recognition Letters , vol.15 , pp. 743-750
    • Perez, J.C.1    Vidal, E.2
  • 17
    • 0035096426 scopus 로고    scopus 로고
    • An Efficient Algorithm for the Optimal Polygonal Approximation of Digitized Curves
    • Salotti, M.: An Efficient Algorithm for the Optimal Polygonal Approximation of Digitized Curves. Pattern Recognition Letters 22, 215-221 (2001)
    • (2001) Pattern Recognition Letters , vol.22 , pp. 215-221
    • Salotti, M.1
  • 18
    • 0036466938 scopus 로고    scopus 로고
    • Optimal Polygonal Approximation of Digitized Curves Using the Sum of Square Deviations Criterion
    • Salotti, M.: Optimal Polygonal Approximation of Digitized Curves Using the Sum of Square Deviations Criterion. Pattern Recognition 35, 435-443 (2002)
    • (2002) Pattern Recognition , vol.35 , pp. 435-443
    • Salotti, M.1
  • 19
    • 0031673777 scopus 로고    scopus 로고
    • An Optimal Polygonal Boundary Encoding Scheme in the Rate-Distortion Sense
    • Schuster, G.M., Katsaggelos, A.K.: An Optimal Polygonal Boundary Encoding Scheme in the Rate-Distortion Sense. IEEE Trans. on Image Processing 7, 13-26 (1998)
    • (1998) IEEE Trans. on Image Processing , vol.7 , pp. 13-26
    • Schuster, G.M.1    Katsaggelos, A.K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.