Hardware Algorithms for Polygon Matching
R. Sastry, Nagarajan Ranganathan, Horst Bunke · 2005
A bl s t rac t The recognition of polygons in 3-0 space is an important task in robot vision. Advances in VLSI technology have now made it possible to implement inexpenszve, efficient and very f ust custom designs. In this paper, two systolic architectures are proposed for this computetionally intensive tusk, wliiclr rnokc. we of U, set of locul shape descriptors for polygons uhich u,rt inua ri ant 11 n der afin e t ro nsfo rni oi I o n s, I. e. tra nslu t Io n, scalrng, rotation an d ortliographic projectiorr from 3-0 to any 2-0 plane. The 1.ecognitioir procedure is bused on the matchzny of edge-lenyth rataos my U smpl!,fied 11 e rsi o n of the d y n u m i c p royru iri in a n y 11 roce du re CO mm o n 1 y employed for st riii y rri ut ch i ng . TIL e ma t ch I, ng procedure also copes with pariial occlusions. The urchatectures fully wttlaze the principles of pipelining und parallelism an order to obtain high speed and throughput.