A Flexible and Customizable Architecture for the Relaxation Labeling Algorithm

This brief presents a flexible and customizable architecture for the probabilistic relaxation labeling (PRL) algorithm. The algorithm has been restructured by using a hardware-friendly process that is executed on the proposed architecture. This enables the design to handle different numbers of objects and labels flexibly. Moreover, in the design, the proposed PRL unit can be easily duplicated for
K
times according to the available resources on the field-programmable gate array (FPGA). In this brief,
K
can be scalable up to 10 by using a Virtex-6 FPGA XC6VLX240T platform. Compared with existing architectures that are not suitable for a large number of objects, the proposed architecture reduces the time complexity from
O
(
N
×
M
) to
O
(
N
) with the same
O
(
N
×
M
²
) space complexity, where
N
and
M
are the numbers of objects and labels, respectively. The experimental results show that the execution time of our design is about 15 times less for five objects and about 35 times less for a 128 × 64 image block than the software implementation running on a Quad-core Intel 32-nm machine.