Efficient circular thresholding

Lai, Yukun ORCID: https://orcid.org/0000-0002-2094-5680 and Rosin, Paul L. ORCID: https://orcid.org/0000-0002-4965-3884 2014. Efficient circular thresholding. IEEE Transactions on Image Processing 23 (3) , pp. 992-1001. 10.1109/TIP.2013.2297014

Preview

PDF - Accepted Post-Print Version Download (3MB) | Preview

Abstract

Otsu's algorithm for thresholding images is widely used, and the computational complexity of determining the threshold from the histogram is O(N) where N is the number of histogram bins. When the algorithm is adapted to circular rather than linear histograms then two thresholds are required for binary thresholding. We show that, surprisingly, it is still possible to determine the optimal threshold in O(N) time. The efficient optimal algorithm is over 300 times faster than traditional approaches for typical histograms and is thus particularly suitable for real-time applications. We further demonstrate the usefulness of circular thresholding using the adapted Otsu criterion for various applications, including analysis of optical flow data, indoor/outdoor image classification, and non-photorealistic rendering. In particular, by combining circular Otsu feature with other colour/texture features, a 96.9% correct rate is obtained for indoor/outdoor classification on the well known IITM-SCID2 data set, outperforming the state-of-the-art result by 4.3%.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords:	Circular histograms; thresholding; classification; segmentation.
Additional Information:	Pdf uploaded in accordance with the publisher’s policy at http://www.sherpa.ac.uk/romeo/issn/1057-7149/ (accessed 10/07/2014)
Publisher:	Institute of Electrical & Electronic Engineers
ISSN:	1057-7149
Date of First Compliant Deposit:	30 March 2016
Last Modified:	23 Nov 2024 19:30
URI:	https://orca.cardiff.ac.uk/id/eprint/61181

Citation Data

Cited 56 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item