Paper
22 October 1993 Fast two-dimensional entropic thresholding algorithm
Wen-Tsuen Chen, Chia-Hsien Wen, Chin-Wen Yang
Author Affiliations +
Proceedings Volume 2094, Visual Communications and Image Processing '93; (1993) https://doi.org/10.1117/12.157873
Event: Visual Communications and Image Processing '93, 1993, Cambridge, MA, United States
Abstract
Two-dimensional entropic thresholding is one of the important thresholding techniques for image segmentation. Usually, the global threshold vector is selected from L2 (gray level, local average) pairs through a `maximum' optimization procedure with O(L4) computation complexity. This paper proposes a fast two-phase 2D entropic thresholding algorithm. In order to reduce the computation time, we estimate 9L2/3 candidate threshold vectors from a quantized image of the original in advance. The global threshold vector is then obtained by checking candidates only. The optimal computation complexity is O(L8/3) by quantizing the gray level in L2/3 levels. Experimental results show that the processing time of each image is reduced from more than two hours to about two minutes. The required memory space is also greatly reduced.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wen-Tsuen Chen, Chia-Hsien Wen, and Chin-Wen Yang "Fast two-dimensional entropic thresholding algorithm", Proc. SPIE 2094, Visual Communications and Image Processing '93, (22 October 1993); https://doi.org/10.1117/12.157873
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image processing algorithms and systems

Optimization (mathematics)

Image processing

Plutonium

Algorithms

Computer science

Back to Top