A method is presented to systematically transform a recursive computation task into a VLSI structure. Several examples, such as vector inner product, matrix multiplication, convolution, comparison operations in relational database and Fast Fourier Transformation, are given to demonstrate the transformation procedure. Finally, the transformation scheme is applied to hierarchical scene matching.
|Original language||English (US)|
|Title of host publication||Proceedings - International Conference on Pattern Recognition|
|Number of pages||3|
|State||Published - Dec 1 1984|
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition