2010 2nd International Conference on Computer Engineering and Technology 2010
DOI: 10.1109/iccet.2010.5486029
|View full text |Cite
|
Sign up to set email alerts
|

An image segmentation algorithm using genetic strategy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…The effect of image segmentation directly affects the performance of the target recognition. Some common segmentation algorithms contain Otsu segmentation algorithm [5][6][7], genetic algorithm [8], fuzzy C-means segmentation algorithm [9,10] and so on, but they also have certain limitations, for example, they only fit for the image which contains the fuzziness and the nondeterminacy, and they need much time for the calculation of the center pixel neighborhood.Documents [11][12][13] have provided some improvements for the traditional maximum entropy segmentation algorithm which has a range of shortcomings, such as the low calculation accuracy and the poor segmentation results, and they have acquired some good segmentation results. However, the two dimensional (2-D) maximum entropy algorithm assumes that the background region and object region occupy the most regions of the twodimensional histogram, and it ignores the impact of the boundary region information on the segmentation results, so in many situations the segmentation effect is not good.…”
Section: Introductionmentioning
confidence: 99%
“…The effect of image segmentation directly affects the performance of the target recognition. Some common segmentation algorithms contain Otsu segmentation algorithm [5][6][7], genetic algorithm [8], fuzzy C-means segmentation algorithm [9,10] and so on, but they also have certain limitations, for example, they only fit for the image which contains the fuzziness and the nondeterminacy, and they need much time for the calculation of the center pixel neighborhood.Documents [11][12][13] have provided some improvements for the traditional maximum entropy segmentation algorithm which has a range of shortcomings, such as the low calculation accuracy and the poor segmentation results, and they have acquired some good segmentation results. However, the two dimensional (2-D) maximum entropy algorithm assumes that the background region and object region occupy the most regions of the twodimensional histogram, and it ignores the impact of the boundary region information on the segmentation results, so in many situations the segmentation effect is not good.…”
Section: Introductionmentioning
confidence: 99%
“…Some common segmentation algorithms contain Otsu segmentation algorithm [5][6][7], genetic algorithm [8], fuzzy C-means segmentation algorithm [9,10] and so on, but they also have certain limitations, for example, they only fit for the image which contains the fuzziness and the nondeterminacy, and they need much time for the calculation of the center pixel neighborhood.Documents [11][12][13] have provided some improvements for the traditional maximum entropy segmentation algorithm which has a range of shortcomings, such as the low calculation accuracy and the poor segmentation results, and they have acquired some good segmentation results. However, the two dimensional (2-D) maximum entropy algorithm assumes that the background region and object region occupy the most regions of the twodimensional histogram, and it ignores the impact of the boundary region information on the segmentation results, so in many situations the segmentation effect is not good.…”
Section: Introductionmentioning
confidence: 99%