Real-time color image segmentation based on mean shift algorithm using an FPGA

Abstract

Image segmentation is one of the most important tasks in the image processing, and mean shift algorithm is often used for color image segmentation because of its high quality. The computational cost of the mean shift algorithm, however, is high, and it is difficult to realize its real time processing on microprocessors, though many techniques for reducing the cost have been researched. In this paper, we describe an FPGA system for the image segmentation based on the mean shift algorithm. In the image segmentation based on the mean shift algorithm, the image is once over-segmented, and then the small regions are merged considering the similarity between the over-segmented regions in order to obtain better segmentation. In our system, the mean shift filter is accelerated using a cache memory which can access to all pixels in a w s × w s pixel window at arbitrary position. This cache memory allows us to process w s × w s pixels in parallel every clock cycle. The region merging is also accelerated by not strictly managing the list structures used for the merging. This loose management introduces the redundant and out-of-date data into the list structures, but it makes the pointer dereferences unnecessary, and the overhead by those data can be hidden by pipeline processing. The performance for 768 × 512 pixel images is fast enough for real-time applications.

Filtering and Wavelet Transform Algorithm for Old Document Image Restoration

“…The frequency of the image is affected by the existing color gradation on the image. Image with gradation (threshold level) tends to have a lower frequency and vice versa (Trieu & Maruyama, 2015).…”

A pre‐processing technique to decrease inspection time in glass tube production lines

“…These devices are typically suitable for exploiting the specific parallelism of low-level image processing algorithms [43][44][45]. There are many implementations of defect and edge detection algorithms in literature [43,44,46], but also in the case of FPGA the processing time of an image depends on the image size [44].…”

FPGA Implementation of Mean Shift Algorithm for Real Time Image Segmentation

“…In recent years, new methods are adopted to reduce the computational complexity in Mean shift algorithm and many architecture for the Mean shift algorithm is developed [10][11][12][13][14][15]. To speed up the clustering operation, Dang Ba Khac Trio and Tsutomu Maruyama [13] has designed a cache memory to access the windows at arbitrary position and an algorithm for region merging. To reduce the execution time in FPGAs, Stefan Craciun et al [12] computed Mean shift of the pixels in parallel.…”