메뉴 건너뛰기




Volumn 35, Issue 2, 2002, Pages 435-443

Optimal polygonal approximation of digitized curves using the sum of square deviations criterion

Author keywords

Graph search; Heuristics; Polygonal approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DIGITAL SIGNAL PROCESSING; ERROR ANALYSIS;

EID: 0036466938     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(01)00051-6     Document Type: Article
Times cited : (37)

References (27)
  • 15
    • 0026958249 scopus 로고
    • Piecewise linear approximation of plane curves by perimeter optimization
    • (1992) Pattern Recognition , vol.25 , pp. 1535-1543
    • Sato, Y.1
  • 16
    • 0000928986 scopus 로고
    • A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves
    • (1993) Pattern Recognition Lett , vol.14 , pp. 959-964
    • Sarkar, D.1
  • 24
    • 0016916739 scopus 로고
    • An application of heuristic search methods to edge and contour detection
    • (1976) Comm. ACM , vol.19 , pp. 73-83
    • Martelli, A.1
  • 27
    • 0007697759 scopus 로고    scopus 로고


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