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 calculatio
A fast recurring two-dimensional entropic thresholding algorithm
β Scribed by Xue-Jing Wu; Yi-Jun Zhang; Liang-Zheng Xia
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 343 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A new fast evanescent wave algorithm (FEWA) is introduced in the twoβdimensional (2βD) case. It expands the Green's function into propagating waves and directional evanescent waves. Applying the evanescent wave correction technique, a procedure similar to the traditional MLFMA can be ex
A novel algorithm is proposed for segmenting an image into multiple levels using its mean and variance. Starting from the extreme pixel values at both ends of the histogram plot, the algorithm is applied recursively on sub-ranges computed from the previous step, so as to find a threshold level and a