An algorithm of decomposition and combinatorial optimisation based on 3-Otsu
by Liejun Wang; Junhui Wu; Jiwei Qin
International Journal of Information and Communication Technology (IJICT), Vol. 16, No. 1, 2020

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.

Online publication date: Thu, 13-Feb-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com