REGION GROWING IMAGE SEGMENTATION ON LARGE DATASETS USING GPU
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2016, Vol 15, Issue 14
Abstract
Image segmentation is an important image processing, and it seems everywhere if we want to analyze what inside the image. There are varieties of applications of image segmentation such as the field of filtering noise from image, medical imaging, and locating objects in satellite images and in automatic traffic control systems, machine vision in problem of feature extraction and in recognition. This paper focuses on accelerating the image segmentation mechanism using region growing algorithm inside GPU (Graphical Processing Unit). In region growing algorithm, an initial set of small areas are iteratively merged according to similarity constraints. We have started by choosing an arbitrary seed pixel and compare it with neighboring pixels. Region is grown from the seed pixel by adding in neighboring pixels that are similar, increasing the size of the region. When the growth of one region stops we simply choose another seed pixel which does not yet belong to any region and start again. This whole process is continued until all pixels belong to some region. If any of the segment makers has the fusion cost lower than the maximum fusion cost (a given threshold), it is selected to grow. Avoid information overlapping like two threads attempting to merge its segment with the same adjacent segment. Experiments have demonstrated that the proposed shape features do not imply in a significant change of the segmentation results, as long as the algorithm’s parameters are properly adjusted. Moreover, experiments for performance evaluation indicated the potential of using GPUs to accelerate this kind of application. For a simple hardware (GeForce 630M GT), the parallel algorithm reached a maximum speed up of approximately 20-30% for different datasets. Considering that segmentation is responsible for a significant portion of the execution time in many image analysis applications, especially in object-oriented analysis of remote sensing images, the experimentally observed acceleration values are significant. Two variants of PBF (Parallel Best Fitting) and PLMBF (Parallel Local Mutual Best Fitting) have been used to analyze the best merging cost of the two segments. It has been found that the PLMBF has been performed better than PBF. It should also be noted that these performance gains can be obtained with low investment in hardware, as GPUs with increasing processing power are currently available on the market at declining prices. The parallel computational scheme is well suited for cluster computing, leading to a good solution for segmenting very large data sets.
Authors and Affiliations
Gurpreet Kaur, Sonika Jindal
Keywords
Related Articles
- EP ID EP650927
- DOI 10.24297/ijct.v15i14.5605
- Views 105
- Downloads 0
Enhancement of Sales promotion using Clustering Techniques in Data Mart
Clustering is an important research topic in wide range of unsupervised classification application. Clustering is a technique, which divides a data into meaningful groups. K-means algorithm is one of the popular clusteri...
HIGH SPEED CARRY SAVE MULTIPLIER BASED LINEAR CONVOLUTION USING VEDIC MATHAMATICS
VLSI applications include Digital Signal Processing, Digital control systems, Telecommunications, Speech and Audio processing for audiology and speech language pathology. The latest research in VLSI is the design and imp...
Optimized Load Balancing Strategy In Cloud Computing : A Review
Now a days every organization is migrating towards cloud computing as cloud computing is considered being more flexible and scalable as compared to other technologies. The technology simply means to provide the com...
A Collective Statistical Analysis of Outdoor Path Loss Models
This study encompasses nine path loss models (Erceg-Greenstein, Green-Obaidat, COST Hata, Hata Urban, Hata Rural, Hata Suburban, SUI, Egli and ECC-33) which were programmed on Python and studied for their results in an u...
Spline Computation for Solving Magnetohidrodynamics Free Convection Flow
In this paper, we construct numerical algorithms for solving Magnetohidrodynamics(MHD) free convection flow rate whichhas been discussed in detail. It is observed that, for a nonlinear system of differential equation, th...