<?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%">Kálmán Palágyi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A 3D parallel shrinking algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Acta Cybernetica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><publisher><style face="normal" font="default" size="100%">University of Szeged</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">201-211</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Shrinking is a frequently used preprocessing step in image processing. This paper presents an efficient 3D parallel shrinking algorithm for transforming a binary object into its topological kernel. The applied strategy is called directional: each iteration step is composed of six subiterations each of which can be executed in parallel. The algorithm makes easy implementation possible, since deletable points are given by 3x3x3 matching templates. The topological correctness of the algorithm is proved for (26,6) binary pictures. &lt;tt&gt; &lt;/tt&gt;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Journal Article</style></work-type></record></records></xml>