Please use this identifier to cite or link to this item:
http://archives.univ-biskra.dz/handle/123456789/3480
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | L. DJEROU | - |
dc.contributor.author | N. KHELIL | - |
dc.contributor.author | N. H. DEHIMI | - |
dc.contributor.author | M. BATOUCHE | - |
dc.date.accessioned | 2013-06-08T07:13:59Z | - |
dc.date.available | 2013-06-08T07:13:59Z | - |
dc.date.issued | 2013-06-08 | - |
dc.identifier.uri | http://archives.univ-biskra.dz/handle/123456789/3480 | - |
dc.description.abstract | In this paper, we present a new multi-level image thresholding technique, called Automatic Threshold based on Multi-objective Optimization “ATMO” that combines the flexibility of multi-objective 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 our segmentation method, based on the multi-objective optimization approach with Otsu’s, Kapur’s and Kittler’s methods. Our experimental results show that the thresholding method based on multi-objective optimization is more efficient than the classical Otsu’s, Kapur’s and Kittler’s methods | en_US |
dc.language.iso | en | en_US |
dc.subject | Binary Particle Swarm Optimization, Image segmentation, Image thresholding, Multi-objective Optimization, Non-pare to approach | en_US |
dc.title | Automatic Multi-Level Thresholding Segmentation Based on Multi-Objective Optimization | en_US |
dc.type | Article | en_US |
Appears in Collections: | Publications Internationales |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Automatic Multi-Level Thresholding Segmentation Based on Multi-Objective.pdf | 117,23 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.