ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Image and Vision Computing
Volume 23, Issue 13, 29 November 2005, Pages 1159-1169
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (755 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.imavis.2005.07.012    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier Ltd All rights reserved.

Optimal threshold selection algorithm in edge detection based on wavelet transform

Yong WuCorresponding Author Contact Information, E-mail The Corresponding Author, Yuanjun He and Hongming Cai

Department of Computer Science and Technology, Shanghai Jiao Tong University, Shanghai 200030, China

Received 30 March 2003; 
revised 20 May 2004; 
accepted 26 July 2005. 
Available online 3 October 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

This paper presents an optimal threshold selection algorithm, which selects the de-noising threshold according to the turbulent degree of detected edge points, in edge detection based on wavelet transform. First of all, adjacent domain division algorithm (ADDA) and parabola fitting algorithm (PFA) are used to separate edge curves from each other after wavelet transform. Then, the entropies, corresponding to different possible thresholds are computed according to the number and length of all the edge curves detected above. The threshold, which giving the minimum entropy, is selected as the optimal one to filter the noises. The experimental results show that our method can get better threshold than other ones, in a subjective view.

Keywords: Optimal threshold selection; Edge detection; Wavelet transform; Minimum entropy

Article Outline

1. Introduction
2. Basic idea
3. Automatic selection of optimal threshold
3.1. Definition of entropy
3.2. Adjacent domain division algorithm
3.3. Parabola fitting algorithm
3.4. Optimal threshold selection algorithm
4. Result of experiments
5. Conclusion
Appendix A. Appendix
A.1. Some data structures
A.1.1. Data structure for edge point
A.1.2. Data structure for fitting curve
A.1.3. Data structure for entropy
A.2. Code of our algorithms
A.2.1. Code of ADDA
A.2.2. Code of PFA
A.2.3. Code of the whole algorithm
References
Vitae










Image and Vision Computing
Volume 23, Issue 13, 29 November 2005, Pages 1159-1169
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.