This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Space-Time Domain Expansion Approach to VLSI and Its Application to Hierarchical Scene Matching
March 1985 (vol. 7 no. 3)
pp. 306-319
Heng-Da Cheng, School of Electrical Engineering, Purdue University, West Lafayette, IN 47907.
Wei-Chung Lin, School of Electrical Engineering, Purdue University, West Lafayette, IN 47907.
King-Sun Fu, School of Electrical Engineering, Purdue University, West Lafayette, IN 47907.
VLSI technology has recently received increasing attention due to its high performance and high reliability. Designing a VLSI structure systematically for a given task becomes a very important problem to many computer engineers. In this paper, we present a method to transform a recursive computation task into a VLSI structure systematically. The main advantages of this approach are its simplicity and completeness. Several examples, such as vector inner product, matrix multiplication, convolution, comparison operations in relational database and fast Fourier transformation (FFT), are given to demonstrate the transformation procedure. Finally, we apply the proposed method to hierarchical scene matching. Scene matching refers to the process of locating or matching a region of an image with a corresponding region of another view of the same image taken from a different viewing angle or at a different time. We first present a constant threshold estimation for hierarchical scene matching. The VLSI implementation of the hierarchical scene matching is then described in detail.
Citation:
Heng-Da Cheng, Wei-Chung Lin, King-Sun Fu, "Space-Time Domain Expansion Approach to VLSI and Its Application to Hierarchical Scene Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, no. 3, pp. 306-319, March 1985, doi:10.1109/TPAMI.1985.4767659
Usage of this product signifies your acceptance of the Terms of Use.