Fast recursive algorithms for two-dimensional thresholding

✍ Scribed by Jian Gong; Liyuan Li; Weinan Chen

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 425 KB
• Volume: 31
• Category: Article
• ISSN: 0031-3203
• DOI: 10.1016/s0031-3203(97)00043-5

✦ Synopsis

thresholding behaves well in segmenting images of low siginal-to-noise ratio. But the computation complexity of the conventional 2D entropic algorithm is bounded by O(L4). In this paper, firstly, a fast recursive 2D entropic thresholding algorithm is proposed. By rewriting the formula for calculation of entropy in recurrence form, a lengthy calculation is saved. Analysis shows that the computation complexity of 2D entropic thresholding is reduced to O(L2). The fast recursive algorithm is also used successfully in 2D Otsu thresholding method. Experimental results show that the processing time of each image is reduced from more than 2 h to less than 10 s. The required memory space is also greatly reduced.