메뉴 건너뛰기




Volumn 31, Issue 9, 2010, Pages 791-799

Affine iterative closest point algorithm for point set registration

Author keywords

Affine point set registration; Independent component analysis; Iterative closest point algorithm; Lie group; Singular value decomposition

Indexed keywords

AFFINE POINT SET REGISTRATION; AFFINE REGISTRATION; AFFINE TRANSFORMATIONS; EXPONENTIAL MAPPING; ICP ALGORITHMS; INITIAL PARAMETER; ITERATIVE CLOSEST POINT ALGORITHM; LIE GROUP; LOCAL MINIMUMS; POINT SET; QUADRATIC PROBLEM; QUADRATIC PROGRAMMING PROBLEMS; SHAPE REPRESENTATION; SINGULAR VALUE DECOMPOSITION TECHNIQUE; STATE-OF-THE-ART METHODS; TAYLOR APPROXIMATION;

EID: 77951099553     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2010.01.020     Document Type: Article
Times cited : (162)

References (38)
  • 5
    • 44049122968 scopus 로고
    • Object modelling by registration of multiple range images
    • Chen Y., and Gerard M. Object modelling by registration of multiple range images. Image Vision Comput. 10 3 (1992) 145-155
    • (1992) Image Vision Comput. , vol.10 , Issue.3 , pp. 145-155
    • Chen, Y.1    Gerard, M.2
  • 6
    • 0042904903 scopus 로고    scopus 로고
    • A new point matching algorithm for non-rigid registration
    • Chui H., and Rangarajan A. A new point matching algorithm for non-rigid registration. Computer Vision and Image Understanding 89 2-3 (2003) 114-141
    • (2003) Computer Vision and Image Understanding , vol.89 , Issue.2-3 , pp. 114-141
    • Chui, H.1    Rangarajan, A.2
  • 8
    • 0030493826 scopus 로고    scopus 로고
    • A reflective newton method for minimizing a quadratic function subject to bounds on some of the variables
    • Coleman T.F., and Li Y. A reflective newton method for minimizing a quadratic function subject to bounds on some of the variables. SIAM J. Optim. 6 4 (1996) 1040-1058
    • (1996) SIAM J. Optim. , vol.6 , Issue.4 , pp. 1040-1058
    • Coleman, T.F.1    Li, Y.2
  • 11
    • 0030148832 scopus 로고    scopus 로고
    • Rigid, affine and locally affine registration of free-form surfaces
    • Feldmar J., and Ayache N. Rigid, affine and locally affine registration of free-form surfaces. Internat. J. Comput. Vision 18 2 (1996) 99-119
    • (1996) Internat. J. Comput. Vision , vol.18 , Issue.2 , pp. 99-119
    • Feldmar, J.1    Ayache, N.2
  • 12
    • 0345377801 scopus 로고    scopus 로고
    • Robust registration of 2D and 3D point sets
    • Fitzgibbon A.W. Robust registration of 2D and 3D point sets. Image Vision Comput. 21 13-14 (2003) 1145-1153
    • (2003) Image Vision Comput. , vol.21 , Issue.13-14 , pp. 1145-1153
    • Fitzgibbon, A.W.1
  • 14
    • 84937545405 scopus 로고    scopus 로고
    • Multi-scale EM-ICP: A fast and robust approach for surface registration
    • Granger, S., Pennec, X., 2002. Multi-scale EM-ICP: A fast and robust approach for surface registration. In: Proc. European Conf. on Computer Vision (ECCV), pp. 418-432.
    • (2002) Proc. European Conf. on Computer Vision (ECCV) , pp. 418-432
    • Granger, S.1    Pennec, X.2
  • 17
    • 0032629347 scopus 로고    scopus 로고
    • Fast and robust fixed-point algorithms for independent component analysis
    • Hyvarinen A. Fast and robust fixed-point algorithms for independent component analysis. IEEE Trans. Neural Networks 10 3 (1999) 626-634
    • (1999) IEEE Trans. Neural Networks , vol.10 , Issue.3 , pp. 626-634
    • Hyvarinen, A.1
  • 18
    • 33745875649 scopus 로고    scopus 로고
    • A Robust algorithm for point set registration using mixture of Gaussians
    • ICCV, pp
    • Jian, B., Vemuri, B.C., 2005. A Robust algorithm for point set registration using mixture of Gaussians. In: Proc. IEEE Internat. Conf. on Computer Vision (ICCV), pp. 1246-1251.
    • (2005) Proc. IEEE Internat. Conf. on Computer Vision , pp. 1246-1251
    • Jian, B.1    Vemuri, B.C.2
  • 19
    • 84856648594 scopus 로고    scopus 로고
    • A multi-resolution ICP with heuristic closest point search for fast and robust 3D registration of range images
    • Jost, T., Hugli, H., 2003. A multi-resolution ICP with heuristic closest point search for fast and robust 3D registration of range images. In: Proc. Fourth Internat. Conf. on 3-D Digital Imaging and Modeling (3DIM), pp. 427-433.
    • (2003) Proc. Fourth Internat. Conf. on 3-D Digital Imaging and Modeling (3DIM) , pp. 427-433
    • Jost, T.1    Hugli, H.2
  • 21
    • 0034290927 scopus 로고    scopus 로고
    • An orientation reliability matrix for the iterative closest point algorithm
    • Lee B.U., Kim C.M., and Park R.H. An orientation reliability matrix for the iterative closest point algorithm. IEEE Trans. Pattern Anal. Machine Intell. 22 10 (2000) 1205-1208
    • (2000) IEEE Trans. Pattern Anal. Machine Intell. , vol.22 , Issue.10 , pp. 1205-1208
    • Lee, B.U.1    Kim, C.M.2    Park, R.H.3
  • 23
    • 34548221487 scopus 로고    scopus 로고
    • Geometric direct search algorithms for image registration
    • Lee S., Choi M., Kim H., and Park F.C. Geometric direct search algorithms for image registration. IEEE Trans. Image Process. 16 9 (2007) 2215-2224
    • (2007) IEEE Trans. Image Process. , vol.16 , Issue.9 , pp. 2215-2224
    • Lee, S.1    Choi, M.2    Kim, H.3    Park, F.C.4
  • 24
    • 33746768758 scopus 로고    scopus 로고
    • Automatic registration of overlapping 3D point clouds using closest points
    • Liu Y. Automatic registration of overlapping 3D point clouds using closest points. Image Vision Comput. 24 (2006) 762-781
    • (2006) Image Vision Comput. , vol.24 , pp. 762-781
    • Liu, Y.1
  • 25
    • 33845587624 scopus 로고    scopus 로고
    • Makadia, A., Patterson, A.I., Daniilidis, K., 2006. Fully automatic registration of 3D point clouds. In: Proc. 2006 IEEE Computer Society Conf. on Computer Vision and Pattern Recognition (CVPR), pp. 1297-1304.
    • Makadia, A., Patterson, A.I., Daniilidis, K., 2006. Fully automatic registration of 3D point clouds. In: Proc. 2006 IEEE Computer Society Conf. on Computer Vision and Pattern Recognition (CVPR), pp. 1297-1304.
  • 27
    • 33747651067 scopus 로고    scopus 로고
    • Dense 3D reconstruction from images by normal aided matching
    • Megyesi Z., Kos G., and Chetverikov D. Dense 3D reconstruction from images by normal aided matching. Machine Graphics Vision 15 1 (2006) 3-28
    • (2006) Machine Graphics Vision , vol.15 , Issue.1 , pp. 3-28
    • Megyesi, Z.1    Kos, G.2    Chetverikov, D.3
  • 29
    • 77951143365 scopus 로고    scopus 로고
    • Point-Set Registration: Coherent Point Drift
    • Technical Report
    • Myronenko, A., Song, X., 2009. Point-Set Registration: Coherent Point Drift. Technical Report.
    • (2009)
    • Myronenko, A.1    Song, X.2
  • 35
    • 41949105605 scopus 로고    scopus 로고
    • Registration of combined range-intensity scans: Initialization through verification
    • Smith E.R., King B.J., Stewart C.V., and Radke R.J. Registration of combined range-intensity scans: Initialization through verification. Computer Vision and Image Understanding 110 2 (2008) 226-244
    • (2008) Computer Vision and Image Understanding , vol.110 , Issue.2 , pp. 226-244
    • Smith, E.R.1    King, B.J.2    Stewart, C.V.3    Radke, R.J.4
  • 36
    • 84977776020 scopus 로고    scopus 로고
    • Zippered polygon meshes from range images
    • Turk, G., Levoy, M., 1996. Zippered polygon meshes from range images. In: Proc. SIGGRAPH, pp. 311-318.
    • (1996) Proc. SIGGRAPH , pp. 311-318
    • Turk, G.1    Levoy, M.2
  • 38
    • 0028515989 scopus 로고
    • Iterative point matching for registration of free-form curves and surfaces
    • Zhang Z. Iterative point matching for registration of free-form curves and surfaces. Internat. J. Comput. Vision 13 2 (1994) 119-152
    • (1994) Internat. J. Comput. Vision , vol.13 , Issue.2 , pp. 119-152
    • Zhang, Z.1


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