<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csaba Domokos</style></author><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Joseph M Francos</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Parametric estimation of affine deformations of binary images</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">March 2008</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Las Vegas, NV, USA</style></pub-location><pages><style face="normal" font="default" size="100%">889 - 892</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4244-1483-3 </style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches usually require established correspondences or the solution of nonlinear optimization problems. Herein we show that it is possible to formulate the problem as the solution of a system of up to third order polynomial equations. These equations are constructed in a simple way using some basic geometric information of binary images. It does not need established correspondences nor the solution of complex optimization problems. The resulting algorithm is fast and provides a direct solution regardless of the magnitude of transformation. ©2008 IEEE.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><accession-num><style face="normal" font="default" size="100%">9973096 </style></accession-num><notes><style face="normal" font="default" size="100%">UT: 000257456700223ScopusID: 51449098982doi: 10.1109/ICASSP.2008.4517753</style></notes></record></records></xml>