<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05297696</id>
  <dt>a</dt>
  <an>05297696</an>
  <augroup>
    <au>Domokos, Csaba</au>
    <au>Kato, Zoltan</au>
  </augroup>
  <ti>Binary image registration using covariant Gaussian densities.</ti>
  <so>Campilho, Aur\'elio (ed.) et al., Image analysis and recognition. 5th international conference, ICIAR 2008, P\'ovoa de Varzim, Portugal, June 25--27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69811-1/pbk). Lecture Notes in Computer Science 5112, 455-464 (2008).</so>
  <py>2008</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-540-69812-8_45</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We consider the estimation of 2D affine transformations aligning a known binary shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the two images and then compute the transformation parameters from these landmarks. In this paper, we propose a novel approach where the exact transformation is obtained as a least-squares solution of a linear system. The basic idea is to fit a Gaussian density to the shapes which preserves the effect of the unknown transformation. It can also be regarded as a consistent coloring of the shapes yielding two rich functions defined over the two shapes to be matched. The advantage of the proposed solution is that it is fast, easy to implement, works without established correspondences and provides a unique and exact solution regardless of the magnitude of transformation.</ab>
    <rv></rv>
  </abgroup>
</item>