A fast 2D entropic thresholding method by wavelet decomposition

Qing Wang, Qiurang Wang, David Dagan Feng, Rongchun Zhao, Zheru Chi

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

4 Citations (Scopus)


Compare with 1D 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 2D histogram. In the paper, a fast algorithm using wavelet decomposition is proposed, with which a set of candidates of 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 find the threshold vector as same as Brink's method but also save computation costs in a large degree, using up only 0.53% of processing time taken by the exhaustive searching.
Original languageEnglish
Title of host publicationIEEE International Conference on Image Processing
Publication statusPublished - 1 Jan 2002
EventInternational Conference on Image Processing (ICIP'02) - Rochester, NY, United States
Duration: 22 Sept 200225 Sept 2002


ConferenceInternational Conference on Image Processing (ICIP'02)
Country/TerritoryUnited States
CityRochester, NY

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering


Dive into the research topics of 'A fast 2D entropic thresholding method by wavelet decomposition'. Together they form a unique fingerprint.

Cite this