Shape recognition has wide applications in many fields. Anattribute grammar approach to shape recognition combines both advantagesof syntactic and statistical methods and makes shape recognition moreaccurate and efficient. However, the time complexity of a sequentialshape recognition algorithm using attribute grammar is O(n3)where n is the length of an input string. The paper presents a parallelshape recognition algorithm and its implementation on a fixed-size VLSIarchitecture. The proposed algorithm has time complexityO(n3/k2). Experiments have also been conducted toverify the performance of the proposed algorithm. The proposed algorithmand architecture could be very useful for image processing, patternrecognition and related areas
展开▼
