Analysis of possible system-level hardware implementation of the selected shape description algorithms

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.