COMPLEXITY OF BINARY PICTURES AND IMAGE THRESHOLDING - AN APPLICATION OF DF - EXPRESSION TO THE THRESHOLDING PROBLEM.

Eiji Kawaguchi, Rin ichiro Taniguchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

In image thresholding problems, no clear answer has been given to the simple question of what the thresholding result should be. It is argued that image thresholding should produce a simple binary picture because a complicated picture is not easy for human perception. Three types of complexity measure for binary pictures are defined, and it is shown how they match the human perception of complexity. Then a minimal complexity measure thresholding method is proposed to get simple binary patterns from multivalued (or gray-scale) images. A hierarchical algorithm is also developed in which a depth-first picture expression (DF-expression) is used. Experimental studies have demonstrated the advantage of this method.

Original languageEnglish
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherIEEE
Pages1221-1225
Number of pages5
ISBN (Print)0818607424
Publication statusPublished - 1986

Publication series

NameProceedings - International Conference on Pattern Recognition

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Cite this