<?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%">Kálmán Palágyi</style></author><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></authors><secondary-authors><author><style face="normal" font="default" size="100%">S Loncaric</style></author><author><style face="normal" font="default" size="100%">D Lerski</style></author><author><style face="normal" font="default" size="100%">H Eskola</style></author><author><style face="normal" font="default" size="100%">R Bregovic</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Topology-Preserving Equivalent Parallel and Sequential 4-Subiteration 2D Thinning Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Image and Signal Processing and Analysis (ISPA), 2015 9th International Symposium on</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2015 Sep</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%">Zagreb, Croatia</style></pub-location><pages><style face="normal" font="default" size="100%">304-309</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4673-8032-4</style></isbn><language><style face="normal" font="default" size="100%">english</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Thinning is a frequently applied technique for extracting centerlines from 2D binary objects. Parallel thinning algorithms can remove a set of object points simultaneously, while sequential algorithms traverse the boundary of objects, and consider the actually visited single point for possible removal. Two thinning algorithms are called equivalent if they produce the same result for each input picture. This paper presents the very first pair of equivalent 2D sequential and parallel subiteration-based thinning algorithms. These algorithms can be implemented directly on a conventional sequential computer or on a parallel computing device. Both of them preserve topology for (8, 4) pictures sampled on the square grid.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record></records></xml>