메뉴 건너뛰기




Volumn , Issue , 2010, Pages 4289-4292

Fast dynamic quantization algorithm for vector map compression

Author keywords

Computational geometry; Data compression

Indexed keywords

DYNAMIC QUANTIZATION; FAST ALGORITHMS; FAST DYNAMICS; LAGRANGIAN; LOWER ENVELOPES; POLYGONAL APPROXIMATIONS; PREDICTION ERRORS; QUANTIZATION LEVELS; QUANTIZERS; RATE DISTORTION PERFORMANCE; RATE-DISTORTION CURVES; VECTOR MAP COMPRESSION;

EID: 78651068312     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2010.5651821     Document Type: Conference Paper
Times cited : (8)

References (12)
  • 1
    • 0031673777 scopus 로고    scopus 로고
    • An optimal polygonal boundary encoding scheme in the rate-distortion sense
    • G. M. Schuster and A. K. Katsaggelos, "An optimal polygonal boundary encoding scheme in the rate-distortion sense", IEEE Trans. on Image Processing, vol.7, pp. 13-26, 1998.
    • (1998) IEEE Trans. on Image Processing , vol.7 , pp. 13-26
    • Schuster, G.M.1    Katsaggelos, A.K.2
  • 2
    • 78650647176 scopus 로고
    • A natural principle for the objective generalization of digital maps
    • Z. Li, and S. Oppenshaw, "A natural principle for the objective generalization of digital maps", Cartography and Geographical Information Systems, vol. 20, pp. 19-29, 1993.
    • (1993) Cartography and Geographical Information Systems , vol.20 , pp. 19-29
    • Li, Z.1    Oppenshaw, S.2
  • 6
    • 26444562341 scopus 로고    scopus 로고
    • Optimal encoding of vector data with polygonal approximation and vertex quantization
    • LNCS
    • A. Kolesnikov, "Optimal encoding of vector data with polygonal approximation and vertex quantization", SCIA'05, LNCS, vol. 3540, 1186-1195. 2005.
    • (2005) SCIA'05 , vol.3540 , pp. 1186-1195
    • Kolesnikov, A.1
  • 8
    • 65349191220 scopus 로고    scopus 로고
    • Efficient compression of vector data map based on a clustering model
    • B. Yang and Q. Li, "Efficient compression of vector data map based on a clustering model", Geo-spatial Information Science, 12(1), 13-17, 2009.
    • (2009) Geo-spatial Information Science , vol.12 , Issue.1 , pp. 13-17
    • Yang, B.1    Li, Q.2
  • 9
    • 34548017427 scopus 로고    scopus 로고
    • Optimized polygonal approximation by dominant point deletion
    • A. Masood, "Optimized polygonal approximation by dominant point deletion", Pattern Recognition, 41 (1), 227-239, 2008.
    • (2008) Pattern Recognition , vol.41 , Issue.1 , pp. 227-239
    • Masood, A.1
  • 10
    • 34548125378 scopus 로고    scopus 로고
    • Fast polygonal approximation of digital curves using relaxed straightness properties
    • P. Bhowmick and B. Bhattacharya, "Fast polygonal approximation of digital curves using relaxed straightness properties", IEEE Trans. on PAMI, 29 (9), 1590-1602, 2007.
    • (2007) IEEE Trans. on PAMI , vol.29 , Issue.9 , pp. 1590-1602
    • Bhowmick, P.1    Bhattacharya, B.2
  • 11
    • 0028667327 scopus 로고
    • Optimum polygonal approximation of digitized curves
    • J. C. Perez, E. Vidal, "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
  • 12
    • 0036466938 scopus 로고    scopus 로고
    • Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
    • M. Salotti, "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


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