Simultaneous Registration of Multiple Corresponding Point Sets

J. Williams, Mohammed Bennamoun

    Research output: Contribution to journalArticle

    74 Citations (Scopus)

    Abstract

    We present a new technique for the simultaneous registration of multiple corresponding point sets with rigid 3D transformations. This class of problems is a generalization of the classic pairwise point set registration task, involving multiple views with multiple correspondences existing between them. The proposed technique requires the computation of a constant matrix which encodes the point correspondence information, followed by an efficient iterative algorithm to compute the optimal rotations. The optimal translations are then recovered directly through the solution of a linear equation system. The algorithm supports weighting of data according to confidence, and we show how it may be incorporated into two robust estimation frameworks to detect and reject outlier data. We have integrated our method into a generalized multiview ICP surface matching system and tested it with synthetic and real data. These tests indicate that the technique is accurate and efficient. The algorithm also compares favorably to another multiview technique from the literature. (C) 2001 Academic Press.
    Original languageEnglish
    Pages (from-to)117-142
    JournalComputer Vision and Image Understanding
    Volume81
    DOIs
    Publication statusPublished - 2001

    Fingerprint

    Linear equations

    Cite this

    @article{3f47ec1637f94e5ea4e469fe52d96948,
    title = "Simultaneous Registration of Multiple Corresponding Point Sets",
    abstract = "We present a new technique for the simultaneous registration of multiple corresponding point sets with rigid 3D transformations. This class of problems is a generalization of the classic pairwise point set registration task, involving multiple views with multiple correspondences existing between them. The proposed technique requires the computation of a constant matrix which encodes the point correspondence information, followed by an efficient iterative algorithm to compute the optimal rotations. The optimal translations are then recovered directly through the solution of a linear equation system. The algorithm supports weighting of data according to confidence, and we show how it may be incorporated into two robust estimation frameworks to detect and reject outlier data. We have integrated our method into a generalized multiview ICP surface matching system and tested it with synthetic and real data. These tests indicate that the technique is accurate and efficient. The algorithm also compares favorably to another multiview technique from the literature. (C) 2001 Academic Press.",
    author = "J. Williams and Mohammed Bennamoun",
    year = "2001",
    doi = "10.1006/cviu.2000.0884",
    language = "English",
    volume = "81",
    pages = "117--142",
    journal = "Computer Vision and Image Understanding",
    issn = "1077-3142",
    publisher = "Academic Press",

    }

    Simultaneous Registration of Multiple Corresponding Point Sets. / Williams, J.; Bennamoun, Mohammed.

    In: Computer Vision and Image Understanding, Vol. 81, 2001, p. 117-142.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Simultaneous Registration of Multiple Corresponding Point Sets

    AU - Williams, J.

    AU - Bennamoun, Mohammed

    PY - 2001

    Y1 - 2001

    N2 - We present a new technique for the simultaneous registration of multiple corresponding point sets with rigid 3D transformations. This class of problems is a generalization of the classic pairwise point set registration task, involving multiple views with multiple correspondences existing between them. The proposed technique requires the computation of a constant matrix which encodes the point correspondence information, followed by an efficient iterative algorithm to compute the optimal rotations. The optimal translations are then recovered directly through the solution of a linear equation system. The algorithm supports weighting of data according to confidence, and we show how it may be incorporated into two robust estimation frameworks to detect and reject outlier data. We have integrated our method into a generalized multiview ICP surface matching system and tested it with synthetic and real data. These tests indicate that the technique is accurate and efficient. The algorithm also compares favorably to another multiview technique from the literature. (C) 2001 Academic Press.

    AB - We present a new technique for the simultaneous registration of multiple corresponding point sets with rigid 3D transformations. This class of problems is a generalization of the classic pairwise point set registration task, involving multiple views with multiple correspondences existing between them. The proposed technique requires the computation of a constant matrix which encodes the point correspondence information, followed by an efficient iterative algorithm to compute the optimal rotations. The optimal translations are then recovered directly through the solution of a linear equation system. The algorithm supports weighting of data according to confidence, and we show how it may be incorporated into two robust estimation frameworks to detect and reject outlier data. We have integrated our method into a generalized multiview ICP surface matching system and tested it with synthetic and real data. These tests indicate that the technique is accurate and efficient. The algorithm also compares favorably to another multiview technique from the literature. (C) 2001 Academic Press.

    U2 - 10.1006/cviu.2000.0884

    DO - 10.1006/cviu.2000.0884

    M3 - Article

    VL - 81

    SP - 117

    EP - 142

    JO - Computer Vision and Image Understanding

    JF - Computer Vision and Image Understanding

    SN - 1077-3142

    ER -