You can view the full text of this article for free using the link below.

Title: An algorithm of decomposition and combinatorial optimisation based on 3-Otsu

Authors: Liejun Wang; Junhui Wu; Jiwei Qin

Addresses: School of Information Science and Engineering; School of Software, Xinjiang University, Urumqi, 830046, China ' School of Information Science and Engineering, Xinjiang University, Urumqi, 830046, China ' School of Education, Shaanxi Normal University, Xi'an, 710062, China

Abstract: Recently, the 3-Otsu (three-dimensional maximum between-class variance algorithm) has drawn great attention in image segmentation. However the time consumption and calculation amount of 3-Otsu is large, so this paper provide a compositing 3-Otsu decomposed algorithm. Firstly, the histogram of 3-Otsu is resolved into three two-dimensional histogram by projecting and the projection plane is three coordinate plane of its own space. Secondly, the two-dimensional histogram formed after segmented by using 2-Otsu, then three segmentation results are obtained. Finally, three segmentation results are combined in linear manner and combination result is the output of segmentation result, under the ideal noise-free, Gaussian noise, salt noise, pepper noise and salt and pepper mixture noise, respectively. The results show that the proposed algorithm is nearly 30 times smaller in time consumption than 3-Otsu, although slightly more than 2-Otsu, its value is still small. Meanwhile the anti-noise performance, especially for mixed noise, is better than two other algorithms.

Keywords: three-dimensional Otsu; decomposition; reduction; linear combination.

DOI: 10.1504/IJICT.2020.105107

International Journal of Information and Communication Technology, 2020 Vol.16 No.1, pp.68 - 83

Received: 06 Nov 2018
Accepted: 25 Dec 2018

Published online: 10 Feb 2020 *

Full-text access for editors Access for subscribers Free access Comment on this article