| N. K. Ratha, A. K. Jain, "Computer Vision Algorithms on Reconfigurable Logic Arrays," IEEE Trans. on Parallel and Distributed Systems, vol. 10, no. 1, pp. 29-43, January 1999. |
....providing flexible, high speed processing, since it combines the advantages of software and application specific hardware. It allows user level programmability at a low level and facilitates general purpose computing due to its reconfigurability. Thus, many applications can use the same hardware [13], 8] Dynamic or run time reconfiguration (RTR) of FPGAs is recognised as an advanced application area within reconfigurable computing. However, a lot of research still has to be accomplished to fully understand and evaluate RTR and quantify the trade offs of run time reconfigurable devices and ....
....It is shown that compile time reconfiguration gives the best area time product for the application used, whereas the suitability of run time reconfiguration strongly depends on the number of reconfigurations. However, it is concluded that the results are application and technology dependent. In [13], the suitability of using reconfigurable computing for implementing computer vision algorithms of different levels of regularity has been investigated. This includes a systolic correlation that can be used for template matching. However, the design presented there is not shape adaptive, and ....
N. K. Ratha, A. K. Jain, "Computer Vision Algorithms on Reconfigurable Logic Arrays," IEEE Trans. on Parallel and Distributed Systems, vol. 10, no. 1, pp. 29-43, January 1999.
....providing flexible, high speed processing, since it combines the advantages of software and application specific hardware. It allows user level programmability at a low level and facilitates general purpose computing due to its reconfigurability. Thus, many applications can use the same hardware [5], 17] Input Frame Output Frame Template Image (Arbitrary Shape) reconfigurable architecture (SONIC) 9] best match Dynamic or run time reconfiguration of FPGAs is recognised as an advanced application area within reconfigurable computing. However, a lot of research still has to be done ....
....that compile time reconfiguration gives the best area time product for the application used, whereas the suitability of runtime reconfiguration strongly depends on the number of reconfigurations. However, it is concluded that the results are application dependent and technology dependent. In [5], the suitability of using reconfigurable computing for implementing computer vision algorithms of different levels of regularity has been investigated. This includes a systolic correlation that can be used for template matching. However, the design presented here is not shape adaptive, and ....
N. K. Ratha, A. K. Jain, "Computer Vision Algorithms on Reconfigurable Logic Arrays," IEEE Trans. on Parallel and Distributed Systems, vol. 10, no. 1, pp. 29-43, January 1999.
....need to be fabricated with every new application, they are often employed for fast prototyping and save a considerable amount of time in design and implementation of algorithms. CCMs have been used as a high performance alternative in many applications such as image processing [5] computer vision [29], and DNA sequence matching [8] The CCMs can be programmed with varying granularity of instructions. Further the availability of a variety of communication support makes them highly suitable for all the three layers (low level, intermediate level and high level) of computer vision tasks [31, 30, ....
N. K. Ratha. Computer Vision Algorithms on Reconfigurable Logic Arrays. PhD thesis, Michigan State University, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC