<?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%">Péter Bodnár</style></author><author><style face="normal" font="default" size="100%">László Gábor Nyúl</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">L Linsen</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Barcode detection with uniform partitioning and distance transformation</style></title><secondary-title><style face="normal" font="default" size="100%">IASTED International Conference on Computer Graphics and Imaging (CGIM)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Feb 2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.actapress.com/PaperInfo.aspx?paperId=454988</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IASTED - Acta Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Innsbruck, Austria</style></pub-location><pages><style face="normal" font="default" size="100%">48 - 53</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Barcode detection is required in a wide range of real-lifeapplications. Imaging conditions and techniques vary considerably and each application has its own requirements for detection speed and accuracy. In our earlier works we used uniform partitioning with several approaches for detection of various types of 1D and 2D barcodes and showed their behaviour on a set of test images. In this work, we extend the partitioning idea and replace scan-line based methods with distance transformation to improve accuracy.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">doi: 10.2316/P.2013.797-022</style></notes></record><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%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">L Linsen</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Sufficient Conditions for Topology Preserving Additions and General Operators</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the IASTED International Conference on Computer Graphics and Imaging (CGIM)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Feb 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IASTED - Acta Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Calgary</style></pub-location><pages><style face="normal" font="default" size="100%">107 - 114</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;abstract-content formatted&quot; itemprop=&quot;description&quot;&gt;&lt;p class=&quot;first_paragraph&quot;&gt;&lt;span id=&quot;lblAbstract&quot;&gt;Topology preservation is a crucial issue of digital topology. Various applications of binary image processing rest on topology preserving operators. Earlier studies in this topic mainly concerned with reductions (i.e., operators that only delete some object points from binary images), as they form the basis for thinning algorithms. However, additions (i.e., operators that never change object points) also play important role for the purpose of generating discrete Voronoi diagrams or skeletons by influence zones (SKIZ). Furthermore, the use of general operators that may both add and delete some points to and from objects in pictures are suitable for contour smoothing. Therefore, in this paper we present some new sufficient conditions for topology preserving reductions, additions, and general operators. Two additions for 2D and 3D contour smoothing are also reported.&lt;/span&gt;&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record></records></xml>