OPTIMAL THRESHOLDING USING MULTISTATE STOCHASTIC CONNECTIONIST APPROACH

Authors
BABU GP MURTY MN
Citation
Gp. Babu et Mn. Murty, OPTIMAL THRESHOLDING USING MULTISTATE STOCHASTIC CONNECTIONIST APPROACH, Pattern recognition letters, 16(1), 1995, pp. 11-18
Citations number
17
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Artificial Intelligence
Journal title
Pattern recognition letters → ACNP
ISSN journal
01678655
Volume
16
Issue
1
Year of publication
1995
Pages
11 - 18
Database
ISI
SICI code
0167-8655(1995)16:1<11:OTUMSC>2.0.ZU;2-K
Abstract
In this paper, we describe the applicability of the K-means clustering algorithm for locating thresholds in a given histogram. In order to f ind optimal thresholds a probabilistic method called Multi-state Stoch astic Connectionist Approach (MSCA) is employed. Mean Field Annealing (MFA), a deterministic counterpart of MSCA, is also studied in this co ntext. A parallel model to parallelize the above methods is presented. Results of MFA and MSCA are compared with that of the K-means algorit hm.