Two thresholds are better than one

The concept of the Bayesian optimal single threshold is a well established and widely used classification technique. In this paper, we prove that when spatial cohesion is assumed for targets, a better classification result than the "optimal" single threshold classification can be achieved. Under the assumption of spatial cohesion and certain prior knowledge about the target and background, the method can be further simplified as dual threshold classification. In core-dual threshold classification, spatial cohesion within the target core allows "continuation" linking values to fall between the two thresholds to the target core; classical Bayesian classification is employed beyond the dual thresholds. The core-dual threshold algorithm can be built into a Markov random field model (MRF). From this MRF model, the dual thresholds can be obtained and optimal classification can be achieved. In some practical applications, a simple method called symmetric subtraction may be employed to determine effective dual thresholds in real time. Given dual thresholds, the quasi-connected component algorithm is shown to be a deterministic implementation of the MRF core-dual threshold model combining the dual thresholds, extended neighborhoods and efficient connected component computation.

[1]  Svetha Venkatesh,et al.  Dynamic Threshold Determination by Local and Global Edge Evaluation , 1995, CVGIP Graph. Model. Image Process..

[2]  J. Kittler,et al.  Adaptive estimation of hysteresis thresholds , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  Azriel Rosenfeld,et al.  Threshold Selection Using Quadtrees , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Wen-Nung Lie,et al.  An efficient threshold-evaluation algorithm for image segmentation based on spatial graylevel co-occurrences , 1993, Signal Process..

[5]  R. Kirby,et al.  A Note on the Use of (Gray Level, Local Average Gray Level) Space as an Aid in Threshold Selection. , 1979 .

[6]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[7]  Y. J. Zhang Two new concepts for N/sub 16/ space , 1999, IEEE Signal Processing Letters.

[8]  A. Rosenfeld,et al.  A Note on the Use of Second-Order Gray Level Statistics for Threshold Selection. , 1977 .

[9]  J. Besag Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[10]  J. Besag On the Statistical Analysis of Dirty Pictures , 1986 .

[11]  Stan Z. Li,et al.  Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.

[12]  John F. Canny A Variational Approach to Edge Detection , 1983, AAAI.

[13]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Chris A. Glasbey,et al.  An Analysis of Histogram-Based Thresholding Algorithms , 1993, CVGIP Graph. Model. Image Process..

[15]  V. Ramesh,et al.  Automatic selection of tuning parameters for feature extraction sequences , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[16]  Bülent Sankur,et al.  Survey over image thresholding techniques and quantitative performance evaluation , 2004, J. Electronic Imaging.

[17]  Terrance E. Boult,et al.  Into the woods: visual surveillance of noncooperative and camouflaged targets in complex outdoor settings , 2001, Proc. IEEE.