How Does Image Complexity Affect the Accuracy of an Interactive Image Segmentation Algorithm?

Authors

  • Kok Luong Goh Faculty of Computing and Software Engineering, i-CATS University College, Jalan Stampin Timur, 93350 Kuching, Sarawak, Malaysia
  • Soo See Chai Faculty of Computer Science & Information Technology, University Malaysia Sarawak, Kota Samarahan, 94300 Sarawak, Malaysia
  • Muzaffar Hamzah Faculty of Computing & Informatics, University Malaysia Sabah, 88400 Kota Kinabalu, Sabah, Malaysia
  • Emily Siew Sing Kiang Faculty of Computing and Software Engineering, i-CATS University College, Jalan Stampin Timur, 93350 Kuching, Sarawak, Malaysia

DOI:

https://doi.org/10.37934/araset.47.1.94104

Keywords:

Interactive image segmentation, Image complexity, Superpixel

Abstract

This study investigates the impact of image complexity on the accuracy of interactive image segmentation algorithms. Image complexity plays a crucial role in segmentation performance, yet previous studies have primarily relied on subjective methods, leaving a gap in understanding how objective measures impact accuracy. The purpose of this research is to explore the relationship between image complexity and segmentation performance and to propose an adaptive approach for improving accuracy based on complexity measures. The study utilizes objective measures, namely entropy and fractal dimension, to quantify image complexity. An interactive image segmentation algorithm is employed, with a bounding box as the background and strokes as the foreground annotations. The number of strokes is dynamically adjusted based on complexity measures, ensuring a tailored segmentation approach. Comparative evaluations are conducted to assess the effectiveness of dynamic and fixed stroke allocation strategies. The principal results reveal a significant influence of image complexity on segmentation accuracy. The dynamic stroke allocation strategy outperforms fixed allocation, highlighting the importance of adapting to complexity. Moreover, the optimal combination of strokes and superpixel sizes is explored, providing valuable insights for practitioners. The findings emphasize the need to consider image complexity in segmentation algorithms to achieve accurate results. In conclusion, this study contributes to the understanding of the relationship between image complexity and interactive image segmentation. By introducing a dynamic stroke allocation approach and evaluating different configurations, the research provides insights into optimizing accuracy based on image complexity. The adaptive strategy improves segmentation performance and guides the development of robust algorithms. Future research can further refine the adaptive approach, explore additional complexity measures, and incorporate advanced machine learning techniques to enhance interactive image segmentation. Overall, this study advances the field by highlighting the importance of image complexity, providing guidance for practitioners, and paving the way for more efficient segmentation algorithms.

Downloads

Download data is not yet available.

Author Biographies

Kok Luong Goh, Faculty of Computing and Software Engineering, i-CATS University College, Jalan Stampin Timur, 93350 Kuching, Sarawak, Malaysia

klgoh@icats.edu.my

Soo See Chai, Faculty of Computer Science & Information Technology, University Malaysia Sarawak, Kota Samarahan, 94300 Sarawak, Malaysia

sschai@unimas.my

Muzaffar Hamzah, Faculty of Computing & Informatics, University Malaysia Sabah, 88400 Kota Kinabalu, Sabah, Malaysia

muzaffar@ums.edu.my

Emily Siew Sing Kiang, Faculty of Computing and Software Engineering, i-CATS University College, Jalan Stampin Timur, 93350 Kuching, Sarawak, Malaysia

emily@icats.edu.my

Published

2024-06-21

Issue

Section

Articles