69 KB858 KB43 KB200020242003Dejnožková, EvaDokládal, Eva12 straništevilka:2letnik:22str. 121-132ISSN:1580-3139COBISSID:16596441URN:URN:NBN:SI:doc-CJT3MK6HenDruštvo za stereologijo in kvantitativno analizo slike, Medicinska fakultetaImage analysis and stereologyAlgorithmsAlgoritmianaliza slikImage Processing, Computer-AssistedPattern RecognitionSlika, obdelava z računalnikomvzorciVzorec, razpoznavanjeA parallel architecture for curve-evolution partial differential equations|The computation of the distance function is a crucial and limiting element in many applications of image processing. This is particularly true for the PDE-based methods, where the distance is used to compute various geometric properties of the travelling curve. Massive Marching is a parallel algorithm computing the distance function by propagating the solution from the sources and permitting simultaneous spreading of component labels in the influence zones. Its hardware implementation is conceivable as no sorted data structuresare used. The feasibility is demonstrated here on a set of parallely-operating Processing Units arranged in a linear array. The text concludes by a study of the accuracy and the implementation costTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaDruštvo za stereologijo in kvantitativno analizo slike