FPGA Implementation of Mean Shift Algorithm for Real Time Image Segmentation

  • M.G* A
  • et al.
Citations of this article
Mendeley users who have this article in their library.
Get full text


Clustering is one of the major steps in image analysis. To speed up the analysis, FPGA implementation of Mean shift algorithm is proposed. The proposed architecture computes the Mean shift operation by using power of two approximations (POTA) for linearization of Gaussian distribution. Also general approach for indexing the window is proposed for selecting the kernel size. The architecture is developed using Verilog HDL and is simulated using Xilinx ISim simulator and synthesized using Virtex 6 FPGA. The Look up table or LUT utilization when the number of input pixels that can be simultaneously processed is varied and hardware cost is analysed. The architecture designed can process four pixels simultaneously with a maximum frequency of 30MHz. The analysis shows that the number of image frames that can be processed vary from 73 to 122 frames per second. This clearly indicates that the developed architecture can be used for various machine learning applications.




M.G*, Anuradha., & L, Basavaraj. (2019). FPGA Implementation of Mean Shift Algorithm for Real Time Image Segmentation. International Journal of Innovative Technology and Exploring Engineering, 9(2), 3298–3304. https://doi.org/10.35940/ijitee.b6276.129219

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free