Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10361342 | Pattern Recognition | 2005 | 6 Pages |
Abstract
The fuzzy c-partition entropy approach for threshold selection behaves well in segmenting images. But the size of search space increases very rapidly when the number of parameters needed to determine the membership function increases. The computation complexity of the fuzzy 2-partition entropy approach is bounded by O(L3). In this paper, a recursive scheme which decreases the computation complexity of the basic algorithm to O(L2) is proposed. The approach does not need the calculation of the membership function. The processing time of each image is reduced from more than 5Â min to less than 20Â s.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Souad Benabdelkader, Mohammed Boulemden,