@Article{Chetverikov-IVC2005,
  IS = { zkontrolovano 30 Nov 2005 },
  UPDATE  = { 2005-07-18 },
  author =     { Chetverikov, Dmitry and Stepanov, Dmitry 
                 and Krsek, Pavel},
  title =      { Robust Euclidean alignment of {3D} point sets: 
                 the trimmed iterative closest point algorithm },
  year =       { 2005 },
  month =      { March },
  pages =      { 299-309 },
  journal =    { Image and Vision Computing },
  publisher =  { Elsevier B.V. },
  address =    { New York, US },
  issn =       { 0262-8856 },
  volume =     { 23 },
  number =     { 3 },
  importance = { 1 },
  authorship = { 40-30-30 },
  annote = { A new robustified extension of the popular Iterative
    Closest Point (ICP) algorithm for registration of 3D point sets is
    presented. The new algorithm is based on the use of the Least
    Trimmed Squares method. Convergence is proved and an
    implementation is discussed. The algorithm is fast, applicable to
    overlaps under 50%, robust to erroneous and incomplete
    measurements. A tests compare TrICP and the Iterative Closest
    Reciprocal Point algorithm.},
  keywords =   { iterativ closest point, 3D registration, point set },
  project =    { LN00B096, 1M0567 },
  psurl =      { PDF available via Science Direct,
                 [PDF 320KB]},
  www =        { },
}