대한전자공학회:학술대회논문집 (Proceedings of the IEEK Conference)
- 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
- /
- Pages.438-441
- /
- 2004
Optimizing Speed For Adaptive Local Thresholding Algorithm U sing Dynamic Programing
- Due Duong Anh (Faculty of Information Technology University of Natural Sciences) ;
- Hong Du Tran Le (Faculty of Information Technology University of Natural Sciences) ;
- Duan Tran Duc (Faculty of Information Technology University of Natural Sciences)
- 발행 : 2004.08.01
초록
Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using foreground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.