Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/37999
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJun Ma-
dc.contributor.authorTsviatkou, V. Y.-
dc.contributor.authorKonopelko, V. K.-
dc.date.accessioned2019-12-30T07:18:48Z-
dc.date.available2019-12-30T07:18:48Z-
dc.date.issued2019-
dc.identifier.citationJun Ma. Fast fully parallel one-subiteration thinning algorithm / Jun Ma, V. Yu. Tsviatkou, V. K. Konopelko // Телекоммуникации: сети и технологии, алгебраическое кодирование и безопасность данных = Telecommunications: Networks and Technologies, Algebraic Coding and Data Security : материалы международного научно-технического семинара, Минск, ноябрь-декабрь 2019 г. / Белорусский государственный университет информатики и радиоэлектроники ; ред. Бобов М. Н. [и др.]. – Минск : БГУИР, 2019. – С. 5–10.ru_RU
dc.identifier.urihttps://libeldoc.bsuir.by/handle/123456789/37999-
dc.description.abstractFast thinning algorithm with one-subiteration was proposed. Results of implementing the proposed algorithm, on a variety of binary images and comparison with ZS algorithm and OPTA algorithm show better results in terms of thinning speed, thinning rate and visual quality.ru_RU
dc.language.isoenru_RU
dc.publisherБГУИРru_RU
dc.subjectматериалы конференцийru_RU
dc.subjectThinning algorithmru_RU
dc.subjectBinary imagesru_RU
dc.subjectThinning Rateru_RU
dc.subjectThinning speedru_RU
dc.titleFast fully parallel one-subiteration thinning algorithmru_RU
dc.typeСтатьяru_RU
Appears in Collections:Телекоммуникации 2019

Files in This Item:
File Description SizeFormat 
Jun_Fast.pdf442.79 kBAdobe PDFView/Open
Show simple item record Google Scholar

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