Some new algorithms and software implementation methods for pattern recognition research

This paper, in two parts, describes some novel algorithms for pattern recognition research and a framework for efficient development, maintenance, and sharing of Interactive software amongst several users and diverse application areas. This modular interactive software system (MISS) forms the basis of a general purpose image analysis and pattern recognition research system (IPS) implemented in the Macdonald Stewart Biomedical Image Processing Laboratory at McGill University. The first part of the paper discusses the algorithms and some preliminary results. Two algorithms are singled out. The first is an interactive approach to nouparametric feature selection via two-dimensional mapping of the multidimension al minimal spanning tree of the features in pattern space. Some preliminary results of the performance of the algorithm, in the automatic mode, applied to feature selection for cervical cell classification, are presented. The second algorithm is an exact procedure for condensing the training data, in the nearest neighbor decision rule, which yields a minimal set of points that implements precisely the original nearest neighbor decision boundary. The second part of the paper describes the MISS and IPS software systems. The MISS software implementation framework insures software colbpati bility and sharing among many individuals and diverse applications, provides safeguard against software loss, and supports an extendable high level interactive language with on-line document ation. MISS language support includes a BASE LAN GUAGE interpreter (implementing a variant of FORTRAN) plus an EXTENDED LANGUAGE interpreter that facilitates addition of new groups of language statements. Each group of statements is associated with a particular function, application area, or programmer. A-11 IPS software has been implemented within the MISS framework. The present IPS implementation includes over 300 EXTENDED LANGUAGE statements in twenty groups facilitating such functions as: image acquisition and display, simulation of a hardware image processor, data management, image manipulation and filtering, graphics, image segmentation and feature extraction, feature selection, classification, and classification per formance measurement. The overall design philosophy of the MISS and IPS software systems and the ease with which new software can be added and documented are described.

[1]  G. Gates,et al.  The reduced nearest neighbor rule (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[2]  Thomas M. Cover,et al.  The Best Two Independent Measurements Are Not the Two Best , 1974, IEEE Trans. Syst. Man Cybern..

[3]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[4]  Julian R. Ullmann Automatic selection of reference data for use in a nearest-neighbor method of pattern classification (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[5]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[6]  Peter E. Hart,et al.  The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.

[7]  Godfried T. Toussaint,et al.  Note on optimal selection of independent binary-valued features for pattern recognition (Corresp.) , 1971, IEEE Trans. Inf. Theory.

[8]  I. Tomek,et al.  Two Modifications of CNN , 1976 .

[9]  Lee J. White,et al.  A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them , 1978, Pattern Recognit..

[10]  C. W. Swonger SAMPLE SET CONDENSATION FOR A CONDENSED NEAREST NEIGHBOR DECISION RULE FOR PATTERN RECOGNITION , 1972 .

[11]  Hugh B. Woodruff,et al.  An algorithm for a selective nearest neighbor decision rule (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[12]  Richard C. T. Lee,et al.  A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space , 1977, IEEE Transactions on Computers.