<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>736</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2018-06-04</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets</title>
    <abstract language="eng">There are many nearest neighbor algorithms tailor made for ICP,but most of them require Special input data like range Images or triangle meshes. &#13;
We focus on efﬁcient nearest neighbor algorithms that do not impose this limitation, and thus can also be used with 3-D point sets generated by structure-frommotion techniques. We shortly present the evaluated algorithms and introduce the modiﬁcations we made to improve their efﬁciency. &#13;
&#13;
In particular, several enhancements to the well-known k-D tree algorithm are described. The ﬁrst part of our Performance Analysis consists of Experiments on synthetic point sets, whereas the second part features experiments with the ICP algorithm on real point sets. Both parts are completed by a thorough evaluation of the obtained results.</abstract>
    <parentTitle language="eng">Vision, Modeling, and Visualization 2003</parentTitle>
    <enrichment key="review.accepted_by">2</enrichment>
    <author>T. Zinßer</author>
    <author>Jochen Schmidt</author>
    <author>H. Niemann</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ICP Algorithm</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>3D Point-Sets</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="">Fakultät für Informatik</collection>
    <thesisPublisher>Technische Hochschule Rosenheim</thesisPublisher>
  </doc>
  <doc>
    <id>735</id>
    <completedYear>2003</completedYear>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2018-06-04</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Refined ICP Algorithm for Robust 3-D Correspondence Estimation</title>
    <abstract language="eng">Robust registration of two 3-D point sets is a common problem in computer vision. &#13;
&#13;
The iterative closest point (ICP) algorithm is undoubtedly the most popular algorithm for solving this kind of problem. In this paper, we present the Picky ICP algorithm, which has been created by merging several extensions of the standard ICP algorithm, thus improving its robustness and computation time.&#13;
&#13;
Using pure 3-D point sets as input data, we do not consider additional information like point color or neighborhood relations. In addition to the standard ICP algorithm and the Picky ICP algorithm proposed in this paper, a robust algorithm due to Masuda and Yokoya and the RICP algorithm by Trucco et al. are evaluated. &#13;
&#13;
We have experimentally determined the basin of convergence, robustness to noise and outliers, and computation time of these four ICP based algorithms</abstract>
    <parentTitle language="eng">Proceedings of the IEEE International Conference on Image Processing, volume 2, pages 695-698, Barcelona, Spain</parentTitle>
    <enrichment key="review.accepted_by">2</enrichment>
    <author>T. Zinßer</author>
    <author>Jochen Schmidt</author>
    <author>H. Niemann</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Iterative closest point algorithm</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Iterative algorithms</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Noise robustnes</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Computer vision</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="">Fakultät für Informatik</collection>
    <thesisPublisher>Technische Hochschule Rosenheim</thesisPublisher>
  </doc>
</export-example>
