TY  - CONF
ID  - scholars1763
SP  - 706
TI  - Resource minimization in a real-time depth-map processing system on FPGA
KW  - Bandwidth constraint; Camera systems; Clock cycles; Clock frequency; depth-map; disparity algorithm; Frames per seconds; Hardware architecture; Logic elements; Mega-pixel; Memory controller; Parallel processing; Processing speed; Processing systems; Processor architectures; Resource consumption; Resource usage; Sum of absolute differences; Window Size
KW  -  Algorithms; Architecture; Computer architecture; Field programmable gate arrays (FPGA); Pixels
KW  -  Image matching
N1  - cited By 7; Conference of 2011 IEEE Region 10 Conference: Trends and Development in Converging Technology Towards 2020, TENCON 2011 ; Conference Date: 21 November 2011 Through 24 November 2011; Conference Code:88417
N2  - Depth-map algorithm allows camera system to estimate depth. It is a computational intensive algorithm, but can be implemented with high speed on hardware due to the parallelism property. When depth-map algorithm is implemented on FPGA, resource consumption is one of the issues. The problem is normally resolved by modifying the algorithm, but the problem can also be solved by implementing new hardware architectures without modification of the depth-map algorithm. This work implemented five different processor architectures for the sum of absolute difference (SAD) depth-map algorithm on FPGA in real-time. Resource usage and performance of these architectures were compared. Memory contention and bandwidth constraints were resolved by using self-initiative memory controller, FIFOs and line buffers. Parallel processing was utilized to achieve high processing speed at low clock frequency. Memory-based line buffers were used instead of register-based line buffers to save 62.4 of logic elements (LEs) used. Usage of registers to replace repetitive subtractors saves 24.75 of LEs. The system achieves performance of 295 mega pixel disparity per second(MPDS) for the architecture with 640x480 pixels image, 3x3 pixels window size, 32 pixels disparity range and 30 frames per second. It achieves processing speed of 590 MPDS for the 64 pixels disparity range architecture. The disparity matching module works at the frequency of 10 MHz and produces one pixel of result every clock cycle. © 2011 IEEE.
AV  - none
CY  - Bali
EP  - 710
A1  - Tan, N.H.
A1  - Hamid, N.H.
A1  - Sebastian, P.
A1  - Voon, Y.V.
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-84856861499&doi=10.1109%2fTENCON.2011.6129200&partnerID=40&md5=dda94d3e0ca59f55e04a433f1be4cd3e
SN  - 9781457702556
Y1  - 2011///
ER  -