%0 Book Section
%T A Performance Characterization Algorithm for Symbol Localization
%A Mathieu Nicolas Delalandre
%A Jean-Yves Ramel
%A Ernest Valveny
%A Muhammad Muzzamil Luqman
%B Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers
%D 2010
%V 6020
%I Springer Berlin Heidelberg
%@ 0302-9743
%@ 978-3-642-13727-3
%F Mathieu Nicolas Delalandre2010
%O DAG
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=2406), last updated on Wed, 16 Jan 2019 10:28:24 +0100
%X In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution to characterize the performance. To achieve that, it exploits only single points as the result of localization and offers the possibility to reconsider the localization results provided by a system. We use the information about context in groundtruth, and overall localization results, to detect the ambiguous localization results. A probability score is computed for each matching between a localization point and a groundtruth region, depending on the spatial distribution of the other regions in the groundtruth. Final characterization is given with detection rate/probability score plots, describing the sets of possible interpretations of the localization results, according to a given confidence rate. We present experimentation details along with the results for the symbol localization system of [1], exploiting a synthetic dataset of architectural floorplans and electrical diagrams (composed of 200 images and 3861 symbols).
%U http://dx.doi.org/10.1007/978-3-642-13728-0_24
%P 260–271