期刊名称：Journal of Theoretical and Applied Computer Science
印刷版ISSN：2299-2634
电子版ISSN：2300-5653
出版年度：2012
卷号：6
期号：4
页码：51-58
出版社：Polska Akademia Nauk * Oddzial w Gdansku, Komisja Informatyki,Polish Academy of Sciences, Gdansk Branch, Computer Science Commission
摘要：This paper is devoted to the problem of the hardware implementation of selected shape description
algorithms. The properties and complexity of particular methods are discussed in order to find
those that are most applicable to a direct hardware implementation. Thus, the complexity of both
the approaches and the processed data should be minimised. In this paper the properties of the
Roundness, X/Y Feret, Point Distance Histogram, UNL, UNL-Fourier and Fourier Descriptors
methods were investigated. Two aspects were analysed — the efficiency of an exemplary practical
shape analysis application and the time consumption of the implemented algorithms
