메뉴 건너뛰기




Volumn 14, Issue 5, 2006, Pages 529-541

Matching of objects nodal points improvement using optimization

Author keywords

Matching phase; Modal analysis; Optimization techniques

Indexed keywords


EID: 33745603437     PISSN: 17415977     EISSN: 17415985     Source Type: Journal    
DOI: 10.1080/17415970600573767     Document Type: Conference Paper
Times cited : (22)

References (23)
  • 3
    • 0032309503 scopus 로고    scopus 로고
    • A maximum-flow formulation of the n-camera stereo correspondence problem
    • Bombay, India
    • Roy, S. and Cox, I.J., 1998, A maximum-flow formulation of the n-camera stereo correspondence problem. International Conference on Computer Vision (ICCV '98), Bombay, India, 492-499.
    • (1998) International Conference on Computer Vision (ICCV '98) , pp. 492-499
    • Roy, S.1    Cox, I.J.2
  • 4
    • 0032141691 scopus 로고    scopus 로고
    • New algorithms for 2D and 3D point matching: Pose estimation and correspondence
    • Gold, S., Rangarajan, A., La, C.P., Pappu, S. and Mjolsness, E., 1998, New algorithms for 2D and 3D point matching: pose estimation and correspondence. Pattern Recognition, 31(8), 1019-1031.
    • (1998) Pattern Recognition , vol.31 , Issue.8 , pp. 1019-1031
    • Gold, S.1    Rangarajan, A.2    La, C.P.3    Pappu, S.4    Mjolsness, E.5
  • 8
    • 0028515989 scopus 로고
    • Iterative point matching for registration of free-form curves and surfaces
    • Zhang, Z., 1994, Iterative point matching for registration of free-form curves and surfaces. International Journal of Computer Vision, 13(2), 119-152.
    • (1994) International Journal of Computer Vision , vol.13 , Issue.2 , pp. 119-152
    • Zhang, Z.1
  • 9
    • 0033715359 scopus 로고    scopus 로고
    • Weighted matchings for dense stereo correspondence
    • Fielding, G. and Kam, M., 2000, Weighted matchings for dense stereo correspondence. Pattern Recognition. 33(9), 1511-1524.
    • (2000) Pattern Recognition. , vol.33 , Issue.9 , pp. 1511-1524
    • Fielding, G.1    Kam, M.2
  • 10
    • 0029184773 scopus 로고
    • A bipartite matching approach to feature correspondence in stereo vision
    • Wu, M.S. and Leou, J.J., 1995, A bipartite matching approach to feature correspondence in stereo vision. Pattern Recognition Letters, 16, 23-31.
    • (1995) Pattern Recognition Letters , vol.16 , pp. 23-31
    • Wu, M.S.1    Leou, J.J.2
  • 11
    • 0029247691 scopus 로고
    • Finding point correspondences using simulated annealing
    • Starink, J.P.P. and Backer, E., 1995, Finding point correspondences using simulated annealing. Pattern Recognition, 28(2), 231-240.
    • (1995) Pattern Recognition , vol.28 , Issue.2 , pp. 231-240
    • Starink, J.P.P.1    Backer, E.2
  • 14
    • 34548752768 scopus 로고
    • Feature-based correspondence: An eigenvector approach
    • Shapiro, L.S. and Brady, J.M., 1992, Feature-based correspondence: an eigenvector approach. Image and Vision Computing, 10(5), 283-288.
    • (1992) Image and Vision Computing , vol.10 , Issue.5 , pp. 283-288
    • Shapiro, L.S.1    Brady, J.M.2
  • 20
    • 23544440261 scopus 로고    scopus 로고
    • Konrad-Zuse-Zentrum für Informationstechnik Berlin, Division Scientific Computing, Department Optimization
    • Löbel, A., Barbosa, J. and Padilha, A., 2000, Mfc - a network simplex implementation, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Division Scientific Computing, Department Optimization.
    • (2000) Mfc - A Network Simplex Implementation
    • Löbel, A.1    Barbosa, J.2    Padilha, A.3
  • 21
    • 0030269645 scopus 로고    scopus 로고
    • Linear and semi-assignment problems: A core oriented approach
    • Volgenant, A., 1996, Linear and semi-assignment problems: a core oriented approach. Computers and Operations Research, 23(10), 917-932.
    • (1996) Computers and Operations Research , vol.23 , Issue.10 , pp. 917-932
    • Volgenant, A.1
  • 23
    • 0347306743 scopus 로고    scopus 로고
    • Algorithms and codes for dense assignment problems: The state of the art
    • dell'Amico, M. and Tooth, P., 2000, Algorithms and codes for dense assignment problems: the state of the art. Discrete Applied Mathematics, 100(1-2), 17-48.
    • (2000) Discrete Applied Mathematics , vol.100 , Issue.1-2 , pp. 17-48
    • Dell'Amico, M.1    Tooth, P.2


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