An Efficient Agglomerative Algorithm Cooperating with Louvain Method for Implementing Image Segmentation

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The idea that brings social networks analysis domain into image segmentation quite satisfies with most authors and harmony in those researches. However, the community detection based image segmentation often produces over-segmented results. To address this problem, we propose an efficient agglomerative homogeneous regions algorithm by considering image histograms which are contributed into bins of the color group properties. Our method is tested on the publicly available Berkeley Segmentation Dataset. And experimental results show that the proposed algorithm produces sizable segmentation and outperforms almost other known image segmentation methods in term of accuracy and comparative PRI scores.

Cite

CITATION STYLE

APA

Nguyen, T. K., Coustaty, M., & Guillaume, J. L. (2018). An Efficient Agglomerative Algorithm Cooperating with Louvain Method for Implementing Image Segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11182 LNCS, pp. 150–162). Springer Verlag. https://doi.org/10.1007/978-3-030-01449-0_13

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