<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><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></contributors><titles><title><style face="normal" font="default" size="100%">2D parallel thinning and shrinking based on sufficient conditions for topology preservation</style></title><secondary-title><style face="normal" font="default" size="100%">ACTA CYBERNETICA-SZEGED</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACTA CYBERN-SZEGED</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Szeged, Institute of Informatics</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">125 - 144</style></pages><isbn><style face="normal" font="default" size="100%">0324-721X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient conditions for topology preserving parallel reductions and fiftyfour new 2D parallel thinning and shrinking algorithms that are based on our conditions. The proposed thinning algorithms use five characterizations of endpoints.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 79960666919</style></notes></record></records></xml>