8605

Parallel Cosegmentation via Submodular Optimization on Anisotropic Diffusion

Dinesh Majeti, Aditya Prakash, S. Balasubramanian, PK Baruah
Sri Sathya Sai Institute of Higher Learning, Prasanthi Nilayam,India
IEEE International Conference on High Performance Computing (HiPC), 2012

@article{majeti2012parallel,

   title={Parallel Cosegmentation via Submodular Optimization on Anisotropic Diffusion},

   author={Majeti, D. and Prakash, A. and Balasubramanian, S. and Baruah, PK},

   year={2012}

}

Download Download (PDF)   View View   Source Source   

824

views

With large number of related images being used for applications such as MR spectroscopy imaging, Object of interest 3D modelling and photo collages, the need of the hour is to accelerate image cosegmentation algorithms. Cosegmentation refers to the process of segmenting common regions from multiple related images. A novel distributed algorithm, CoSand [1], for cosegmentation of large-scale image collections was proposed. CoSand involves preprocessing, solving multiple systems of linear equations and clustering for every image, thereby making it computationally intensive. In this work various approaches to parallelize the MATLAB code for this problem were considered. The most time consuming part of code which is solving multiple systems of linear equations was offloaded to the GPU. Other operations have been performed on multicores. Further, unlike other parallelized image processing algorithms that require a single image data transfer to GPU, CoSand requires a set of image data (500 in our case) accounting for a substantial data transfer overhead. Even in this scenario, the parallel implementation on GPU has achieved a significant performance gain which is comparable to the multicore implementation of the entire application.
Rating: 2.5. From 1 vote.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: