An approach based on simulated annealing to optimize the performance of extraction of the flower region using mean-shift segmentation

被引:11
作者
Karasulu, Bahadir [1 ]
机构
[1] Canakkale Onsekiz Mart Univ, Dept Comp Engn, Fac Engn, TR-17020 Canakkale, Turkey
关键词
Simulated annealing; Flower extraction; Mean shift segmentation; Quadratic assignment problem; Performance optimization; ALGORITHM; IMAGES;
D O I
10.1016/j.asoc.2013.07.019
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Flower identification and recognition are tedious and difficult tasks even for humans. Image segmentation based on automatic flower extraction is an essential step for computer-aided flower image recognition and retrieval processes. Furthermore, there is a challenge for segmentation of the object(s) s) from natural complex background in color images. In this study, a novel performance optimization approach for image segmentation, i.e. simulated annealing-based mean-shift segmentation (SAMS), is proposed and implemented. It is based on the simulated annealing solution of quadratic assignment problem model treated as an image segmentation process using feature-based mean-shift (MS) clustering on color images. The proposed approach is designed to realize a global and unsupervised (i.e., fully automatic) segmentation. It is a modified and optimized version of Backprojection-based mean-shift segmentation (BackMS) method. In conducted segmentation experiments, the performance results of SAMS approach are compared with the ones of BackMS method. Comparison of overall performance results and statistical analysis (i.e., Wilcoxon signed rank median test) show that SAMS approach improves the performance of BackMS method. It is measured as 49.33% when using object bounding boxes and as 51.33% when using object pixel regions. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:4763 / 4785
页数:23
相关论文
共 50 条
[1]
Aarts E., 2001, ESSAYS SURVEYS METAH, V1, P1
[2]
[Anonymous], 2011, BERKELEY IMAGE SEGME
[3]
[Anonymous], 2011, Computer Vision: Algorithms and Applications
[4]
[Anonymous], 2006, CVPR
[5]
[Anonymous], 2009, INTRO INFORM RETRIEV
[6]
[Anonymous], 2005, CAVIAR COMPUTER ASSI
[7]
Contour Detection and Hierarchical Image Segmentation [J].
Arbelaez, Pablo ;
Maire, Michael ;
Fowlkes, Charless ;
Malik, Jitendra .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (05) :898-916
[8]
Extraction of flower regions in color images using ant colony optimization [J].
Aydin, Dogan ;
Ugur, Aybars .
WORLD CONFERENCE ON INFORMATION TECHNOLOGY (WCIT-2010), 2011, 3
[9]
AUTOMATIC FLOWER BOUNDARY EXTRACTION USING IPSOAntK-MEANS ALGORITHM [J].
Aydin, Dogan ;
Ugur, Aybars .
CYBERNETICS AND SYSTEMS, 2010, 41 (06) :416-434
[10]
A Review and Comparison of Measures for Automatic Video Surveillance Systems [J].
Baumann, Axel ;
Boltz, Marco ;
Ebling, Julia ;
Koenig, Matthias ;
Loos, Hartmut S. ;
Merkel, Marcel ;
Niem, Wolfgang ;
Warzelhan, Jan Karl ;
Yu, Jie .
EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING, 2008, 2008 (1)