메뉴 건너뛰기




Volumn 17, Issue 1, 2006, Pages 143-162

Particle swarm optimization for point pattern matching

Author keywords

Genetic algorithm; Global optimal solution; Local optimal solution; Particle swarm optimization; Point pattern matching; Simulated annealing

Indexed keywords

COMPUTER VISION; GENETIC ALGORITHMS; IMAGE ANALYSIS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PERTURBATION TECHNIQUES; SIMULATED ANNEALING; VECTORS;

EID: 28844473271     PISSN: 10473203     EISSN: 10959076     Source Type: Journal    
DOI: 10.1016/j.jvcir.2005.02.002     Document Type: Article
Times cited : (59)

References (30)
  • 1
    • 0028741343 scopus 로고
    • Evolutionary programming for fast and robust point pattern matching
    • A. Agrawal, N. Ansari, and E. Hou Evolutionary programming for fast and robust point pattern matching Proc. IEEE Int. Conf. Neural Netw. 1994 1777 1782
    • (1994) Proc. IEEE Int. Conf. Neural Netw. , pp. 1777-1782
    • Agrawal, A.1    Ansari, N.2    Hou, E.3
  • 4
    • 0026137964 scopus 로고
    • Least-squares estimation of transformation parameters between two point patterns
    • S. Umeyama Least-squares estimation of transformation parameters between two point patterns IEEE Trans. Pattern Anal. Mach. Intell. PAMI-13 1991 376 380
    • (1991) IEEE Trans. Pattern Anal. Mach. Intell. , vol.PAMI-13 , pp. 376-380
    • Umeyama, S.1
  • 5
    • 0027702715 scopus 로고
    • Dominant point matching algorithm
    • P.C. Yuen Dominant point matching algorithm Electron. Lett. 29 1993 2023 2024
    • (1993) Electron. Lett. , vol.29 , pp. 2023-2024
    • Yuen, P.C.1
  • 6
    • 4243200644 scopus 로고    scopus 로고
    • Point pattern matching by line segments and labels
    • W.H. Wang, and Y.C. Chen Point pattern matching by line segments and labels Electron. Lett. 33 1997 478 479
    • (1997) Electron. Lett. , vol.33 , pp. 478-479
    • Wang, W.H.1    Chen, Y.C.2
  • 7
    • 0031061865 scopus 로고    scopus 로고
    • Fast algorithm for point pattern matching: Invariant to translations, rotations and scale changes
    • S.H. Chang, F.H. Cheng, W.H. Hsu, and G.Z. Wu Fast algorithm for point pattern matching: invariant to translations, rotations and scale changes Pattern Recogn. 30 1997 311 320
    • (1997) Pattern Recogn. , vol.30 , pp. 311-320
    • Chang, S.H.1    Cheng, F.H.2    Hsu, W.H.3    Wu, G.Z.4
  • 9
    • 0030781645 scopus 로고    scopus 로고
    • Automatic target recognition by matching oriented edge pixels
    • C.F. Olson, and D.P. Huttenlocher Automatic target recognition by matching oriented edge pixels IEEE Trans. Image Process. 6 1997 103 113
    • (1997) IEEE Trans. Image Process. , vol.6 , pp. 103-113
    • Olson, C.F.1    Huttenlocher, D.P.2
  • 10
    • 0019229247 scopus 로고
    • Point pattern matching by relaxation
    • S. Ranade, and A. Rosenfeld Point pattern matching by relaxation Pattern Recogn. 12 1980 269 275
    • (1980) Pattern Recogn. , vol.12 , pp. 269-275
    • Ranade, S.1    Rosenfeld, A.2
  • 11
    • 0021644145 scopus 로고
    • Labeled point pattern matching by fuzzy relaxation
    • H. Ogawa Labeled point pattern matching by fuzzy relaxation Pattern Recogn. 17 1984 569 573
    • (1984) Pattern Recogn. , vol.17 , pp. 569-573
    • Ogawa, H.1
  • 13
  • 14
    • 0037209409 scopus 로고    scopus 로고
    • Spectral correspondence for point pattern matching
    • M. Carcassoni, and E.R. Hancock Spectral correspondence for point pattern matching Pattern Recogn. 36 2003 193 204
    • (2003) Pattern Recogn. , vol.36 , pp. 193-204
    • Carcassoni, M.1    Hancock, E.R.2
  • 16
    • 0037235940 scopus 로고    scopus 로고
    • Genetic algorithm for affine point pattern matching
    • L. Zhang, W. Xu, and C. Chang Genetic algorithm for affine point pattern matching Pattern Recogn. Lett. 24 2003 9 19
    • (2003) Pattern Recogn. Lett. , vol.24 , pp. 9-19
    • Zhang, L.1    Xu, W.2    Chang, C.3
  • 18
    • 0029247691 scopus 로고
    • Finding point correspondences using simulated annealing
    • J.P. Starink, and E. Backer Finding point correspondences using simulated annealing Pattern Recogn. 28 1995 231 240
    • (1995) Pattern Recogn. , vol.28 , pp. 231-240
    • Starink, J.P.1    Backer, E.2
  • 21
    • 0003996989 scopus 로고    scopus 로고
    • Master thesis, Purdue School of Engineering and Technology, Indiana University, Purdue University, Indianapolis
    • V. Tandon, Closing the gap between CAD/CAM and optimized CNC end milling, Master thesis, Purdue School of Engineering and Technology, Indiana University, Purdue University, Indianapolis, 2000
    • (2000) Closing the Gap between CAD/CAM and Optimized CNC End Milling
    • Tandon, V.1
  • 24
    • 2442570106 scopus 로고    scopus 로고
    • A discrete particle swarm algorithm for optimal polygonal approximation of digital curves
    • P.Y. Yin A discrete particle swarm algorithm for optimal polygonal approximation of digital curves J. Vis. Commun. Image Represent. 15 2004 241 260
    • (2004) J. Vis. Commun. Image Represent. , vol.15 , pp. 241-260
    • Yin, P.Y.1
  • 25
    • 0344291226 scopus 로고    scopus 로고
    • Recent approaches to global optimization problems through particle swarm optimization
    • K.E. Parsopoulos, and M.N. Vrahatis Recent approaches to global optimization problems through particle swarm optimization Nat. Comput. 1 2002 235 306
    • (2002) Nat. Comput. , vol.1 , pp. 235-306
    • Parsopoulos, K.E.1    Vrahatis, M.N.2
  • 26
    • 0036464756 scopus 로고    scopus 로고
    • The particle swarm explosion, stability, and convergence in a multidimensional complex space
    • M. Clerc, and J. Kennedy The particle swarm explosion, stability, and convergence in a multidimensional complex space IEEE Trans. Evolut. Comput. 6 2002 58 73
    • (2002) IEEE Trans. Evolut. Comput. , vol.6 , pp. 58-73
    • Clerc, M.1    Kennedy, J.2
  • 27
    • 0037475094 scopus 로고    scopus 로고
    • The particle swarm optimization algorithm: Convergence analysis and parameter selection
    • I.C. Trelea The particle swarm optimization algorithm: convergence analysis and parameter selection Inform. Process. Lett. 85 2003 317 325
    • (2003) Inform. Process. Lett. , vol.85 , pp. 317-325
    • Trelea, I.C.1
  • 28
    • 26844447786 scopus 로고    scopus 로고
    • Discrete particle swarm optimization, illustrated by the Traveling Salesman Problem
    • Springer Heidelberg, Germany
    • M. Clerc Discrete particle swarm optimization, illustrated by the Traveling Salesman Problem New optimization techniques in engineering 2004 Springer Heidelberg, Germany 219 239
    • (2004) New Optimization Techniques in Engineering , pp. 219-239
    • Clerc, M.1


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