TY - JOUR
T1 - Relation of binary image complexity to gray‐scaled image thresholding
AU - Taniguchi, Rin‐Ichiro ‐I
AU - Kawaguchi, Eiji
PY - 1987
Y1 - 1987
N2 - Conventional gray‐scaled image thresholding consists in finding the threshold according to the bimodality of a gray‐level histogram of an input image. However, few discussions have been made on the thresholding problem from the viewpoint of the optimality of the results. As far as image perception (human perception) is concerned, we naturally see the image as simply as possible. Taking such situation into account, the threshold for image thresholding operation should be determined on the same basis. This paper presents a principle in which the optimality of the thresholding process is evaluated according to the complexity change of the binarized picture against the change of the threshold value. Specifically, we show that the complexity curves are categorized into either unimodal or multimodal. For the multimodal case, we show that a good thresholding can be obtained by choosing a minimal point on the curve as the threshold. For a unimodal case we introduce another strategy which depends on the local multimodality of the complexity curve.
AB - Conventional gray‐scaled image thresholding consists in finding the threshold according to the bimodality of a gray‐level histogram of an input image. However, few discussions have been made on the thresholding problem from the viewpoint of the optimality of the results. As far as image perception (human perception) is concerned, we naturally see the image as simply as possible. Taking such situation into account, the threshold for image thresholding operation should be determined on the same basis. This paper presents a principle in which the optimality of the thresholding process is evaluated according to the complexity change of the binarized picture against the change of the threshold value. Specifically, we show that the complexity curves are categorized into either unimodal or multimodal. For the multimodal case, we show that a good thresholding can be obtained by choosing a minimal point on the curve as the threshold. For a unimodal case we introduce another strategy which depends on the local multimodality of the complexity curve.
UR - http://www.scopus.com/inward/record.url?scp=0023452450&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0023452450&partnerID=8YFLogxK
U2 - 10.1002/scj.4690181110
DO - 10.1002/scj.4690181110
M3 - Article
AN - SCOPUS:0023452450
VL - 18
SP - 91
EP - 101
JO - Systems and Computers in Japan
JF - Systems and Computers in Japan
SN - 0882-1666
IS - 11
ER -