Please use this identifier to cite or link to this item: http://archives.univ-biskra.dz/handle/123456789/2341
Full metadata record
DC FieldValueLanguage
dc.contributor.authorL.Djerou-
dc.contributor.authorN. Khelil-
dc.contributor.authorN.H.Dehimi-
dc.contributor.authorM. Batouche-
dc.date.accessioned2014-04-18T11:31:22Z-
dc.date.available2014-04-18T11:31:22Z-
dc.date.issued2014-04-18-
dc.identifier.urihttp://archives.univ-biskra.dz/handle/123456789/2341-
dc.description.abstractThe aim of this work is to provide a comprehensive review of multiobjective optimization in the image segmentation problem based on image thresholding. The authors show that the inclusion of several criteria in the thresholding segmentation process helps to overcome the weaknesses of these criteria when used separately. In this context, they give a recent literature review, and present a new multi-level image thresholding technique, called Automatic Threshold, based on Multiobjective Optimization (ATMO). That combines the flexibility of multiobjective fitness functions with the power of a Binary Particle Swarm Optimization algorithm (BPSO), for searching the “optimum” number of the thresholds and simultaneously the optimal thresholds of three criteria: the between-class variances criterion, the minimum error criterion and the entropy criterion. Some examples of test images are presented to compare with this segmentation method, based on the multiobjective optimization approach with Otsu’s, Kapur’s, and Kittler’s methods. Experimental results show that the thresholding method based on multiobjective optimization is more efficient than the classical Otsu’s, Kapur’s, and Kittler’s methods. doi: 10.4018/978-1-4666-1830-5.ch011 Link http://www.igi-global.com/chapter/multilevel-thresholding-method-based-multiobjective/67292en_US
dc.language.isoenen_US
dc.titleA multilevel thresholding method based on multiobjective optimization for non-supervised image segmentationen_US
dc.typeArticleen_US
Appears in Collections:Publications Internationales



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.