Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9502
Title: A fast 2D entropic thresholding method by wavelet decomposition
Authors: Wang, Q
Wang, Q
Feng, D
Zhao, R
Chi, Z 
Keywords: Computational complexity
Entropy
Image segmentation
Wavelet transforms
Issue Date: 2002
Publisher: IEEE
Source: Proceedings 2002 International Conference on Image Processing : 22-25 September 2002, Rochester Riverside Convention Center, Rochester, New York, USA, v. 3, p. III265-III268 How to cite?
Abstract: Compared with ID grayscale histogram analysis, 2D entropic thresholding makes use of local average as well as pixel gray level. However, it is time consuming to search the threshold vector in the 2D histogram. In the paper, a fast algorithm using wavelet decomposition is proposed, with which a set of candidates of the vector was first obtained in the decomposed histogram. The optimal threshold vector is then obtained without exhaustive searching. Experimental results have shown that our algorithm not only finds the threshold vector as well as Brink's method (1992) but also saves computation costs, using up only 0.53% of the processing time taken by exhaustive searching.
URI: http://hdl.handle.net/10397/9502
ISBN: 0-7803-7622-6
ISSN: 1522-4880
DOI: 10.1109/ICIP.2002.1038956
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

25
Last Week
5
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.