Multilevel thresholding by fast PNN-based algorithm

Olli Virmajoki; Pasi Franti

doi:10.1117/12.477741

28 May 2003 Multilevel thresholding by fast PNN-based algorithm

Olli Virmajoki, Pasi Franti

Proceedings Volume 5014, Image Processing: Algorithms and Systems II; (2003) https://doi.org/10.1117/12.477741
Event: Electronic Imaging 2003, 2003, Santa Clara, CA, United States

Abstract

We propose a fast PNN-based O(N log N) time algorithm for multilevel non-parametric thresholding, where N denotes the size of the image histogram. The proposed PNN based multilevel thresholding algorithm is considerably faster than optimal thresholding. On a set of 8-16 bits per pixel real images, experimental results also reveal that the proposed method provides better quality than the Lloyd-Max quantizer alone. Since the time complexity of the proposed thresholding algorithm is log-linear, it is applicable in real-time image processing applications.

Citation Download Citation

Olli Virmajoki and Pasi Franti "Multilevel thresholding by fast PNN-based algorithm", Proc. SPIE 5014, Image Processing: Algorithms and Systems II, (28 May 2003); https://doi.org/10.1117/12.477741

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available