메뉴 건너뛰기
Lecture Notes in Control and Information Sciences
Volumn 345, Issue , 2006, Pages 30-41
A hybrid genetic algorithm for two types of polygonal approximation problems
Author keywords

[No Author keywords available]
Indexed keywords

EID: 33748881391     PISSN: 01708643     EISSN: None     Source Type: Book Series    
DOI: 10.1007/11816515_4     Document Type: Conference Paper
Times cited : (1)
References (13)
  • 1
    • 0037751705 scopus 로고    scopus 로고
    • Genetic algorithms for polygonal approximation of digital curves
    • Yin, P.Y.: Genetic Algorithms for Polygonal Approximation of Digital Curves. Int. J. Pattern Recognition Artif. Intell. 13 (1999) 1-22
    • (1999) Int. J. Pattern Recognition Artif. Intell. , vol.13 , pp. 1-22
    • Yin, P.Y.1
  • 2
    • 0019148998 scopus 로고
    • Fast polygonal approximation of digitized curves
    • Sklansky, J., Gonzalez, V.: Fast Polygonal Approximation of Digitized Curves. Pattern Recognition. 12 (1980) 327-331
    • (1980) Pattern Recognition , vol.12 , pp. 327-331
    • Sklansky, J.1    Gonzalez, V.2
  • 3
    • 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. 12(2) (1973) 112-122
    • (1973) The Canadian Cartographer , vol.12 , Issue.2 , pp. 112-122
    • Douglas, D.H.1    Peucker, T.K.2
  • 4
    • 0023791809 scopus 로고
    • Polygonal approximation of 2D shapes through boundary merging
    • Leu, J.G., Chen, L.: Polygonal Approximation of 2D Shapes through Boundary Merging. Pattern Recgnition Letters. 7(4) (1988) 231-238
    • (1988) Pattern Recgnition Letters , vol.7 , Issue.4 , pp. 231-238
    • Leu, J.G.1    Chen, L.2
  • 5
    • 0029247737 scopus 로고
    • A new split-and-merge technique for polygonal apporximation of chain coded curves
    • Ray, B.K., Ray, K.S.: A New Split-and-Merge Technique for Polygonal Apporximation of Chain Coded Curves. Pattern Recognition Lett. 16 (1995) 161-169
    • (1995) Pattern Recognition Lett. , vol.16 , pp. 161-169
    • Ray, B.K.1    Ray, K.S.2
  • 7
    • 0033740737 scopus 로고    scopus 로고
    • A tabu search approach to the polygonal approximation of digital curves
    • Yin, P.Y.: A Tabu Search Approach to the Polygonal Approximation of Digital Curves. Int. J. Pattern Recognition Artif Intell. 14 (2000) 243-255
    • (2000) Int. J. Pattern Recognition Artif Intell. , vol.14 , pp. 243-255
    • Yin, P.Y.1
  • 8
    • 0032156001 scopus 로고    scopus 로고
    • A new method for polygonal approximation using genetic algorithms
    • Yin, P.Y.: A New Method for Polygonal Approximation Using Genetic Algorithms. Pattern Recognition letter. 19 (1998) 1017-1026.
    • (1998) Pattern Recognition Letter. , vol.19 , pp. 1017-1026
    • Yin, P.Y.1
  • 9
    • 0032648124 scopus 로고    scopus 로고
    • Polygonal approximation using genetic algorithms
    • Huang, S.-C., Sun, Y.-N.: Polygonal Approximation Using Genetic Algorithms. Pattern Recognition. 32 (1999) 1409-1420
    • (1999) Pattern Recognition , vol.32 , pp. 1409-1420
    • Huang, S.-C.1    Sun, Y.-N.2
  • 11
    • 0035546415 scopus 로고    scopus 로고
    • An efficient evolutionary algorithm for accurate polygonal approximation
    • Ho, S.-Y., Chen, Y.-C.: An Efficient Evolutionary Algorithm for Accurate Polygonal Approximation. Pattern Recognition. 34 (2001) 2305-2317
    • (2001) Pattern Recognition , vol.34 , pp. 2305-2317
    • Ho, S.-Y.1    Chen, Y.-C.2
  • 12
    • 0037991532 scopus 로고    scopus 로고
    • Ant colony search algorithms for optimal polygonal approximation of plane curves
    • Yin, P.Y.: Ant Colony Search Algorithms for Optimal Polygonal Approximation of Plane Curves. Pattern Recognition. 36 (2003) 1783-1997
    • (2003) Pattern Recognition , vol.36 , pp. 1783-1997
    • Yin, P.Y.1
  • 13
    • 2442570106 scopus 로고    scopus 로고
    • A discrete particle swarm algorithm for optimal polygonal approximation of digital curves
    • Yin, P.Y.: A Discrete Particle Swarm Algorithm for Optimal Polygonal Approximation of Digital Curves. Journal of Visual Communication and Image Representation. 15 (2004) 241-260
    • (2004) Journal of Visual Communication and Image Representation , vol.15 , pp. 241-260
    • Yin, P.Y.1

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