<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Andreas Haja</style></author><author><style face="normal" font="default" size="100%">Steffen Abraham</style></author><author><style face="normal" font="default" size="100%">Bernd Jähne</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Gerhard Rigoll</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Comparison of Region Detectors for Tracking</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition, Proceedings 30th DAGM Symposium, Munich, Germany, June 2008</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><volume><style face="normal" font="default" size="100%">5096</style></volume><pages><style face="normal" font="default" size="100%">112--121</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this work, the performance of five popular region detectors is compared in the context of tracking. Firstly, conventional nearest-neighbor matching based on the similarity of region descriptors is used to assemble trajectories from unique region-to-region correspondences. Based on carefully estimated homographies between planar object surfaces in neighboring frames of an image sequence, both their localization accuracy and length, as well as the percentage of successfully tracked regions is evaluated and compared. The evaluation results serve as a supplement to existing studies and facilitate the selection of appropriate detectors suited to the requirements of a specific application. Secondly, a novel tracking method is presented, which integrates for each region all potential matches into directed multi-edge graphs. From these, trajectories are extracted using Dijkstra's algorithm. It is shown, that the resulting localization error is significantly lower than with nearest-neighbor matching while at the same time, the percentage of tracked regions is increased.</style></abstract><custom3><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></custom3></record></records></xml>