Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/37374
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMa, Jun-
dc.contributor.authorXunhuan, Ren-
dc.contributor.authorTsviatkou, V. Yu.-
dc.contributor.authorKonopelko, V. K.-
dc.date.accessioned2019-11-19T06:08:50Z-
dc.date.available2019-11-19T06:08:50Z-
dc.date.issued2019-
dc.identifier.citationParallel skeleton algorithm with one-subiteration / Ma Jun [и др.] // Информационные технологии и системы 2019 (ИТС 2019) = Information Teсhnologies and Systems 2019 (ITS 2019) : материалы международной научной конференции, Минск, 30 октября 2019 г. / Белорусский государственный университет информатики и радиоэлектроники; редкол. : Л. Ю. Шилин [и др.]. – Минск, 2019. – С. 240 – 241.ru_RU
dc.identifier.urihttps://libeldoc.bsuir.by/handle/123456789/37374-
dc.description.abstractThe skeletonize of the binary image has crucial application in the field of target recognition. The thinning result of the Zhang’s fast parallel thinning algorithm maintains the connection of the original image, has a good structural form and has no burs. However, Zhang’s fast parallel thinning algorithm consists two subiterations in where the most of operations are similar, which cause the waste of the resources of the calculate. Besides, it can’t ensure the single pixel width, which brings difficulties for post-processing.ru_RU
dc.language.isoenru_RU
dc.publisherБГУИРru_RU
dc.subjectматериалы конференцийru_RU
dc.subjectskeletonizationru_RU
dc.subjectZhang’s Algorithmru_RU
dc.titleParallel skeleton algorithm with one-subiterationru_RU
dc.typeСтатьяru_RU
Appears in Collections:ИТС 2019

Files in This Item:
File Description SizeFormat 
Ma_Parallel.pdf485.06 kBAdobe PDFView/Open
Show simple item record Google Scholar

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.