# IEEE Transactions on Pattern Analysis and Machine Intelligence

## Filter Results

Displaying Results 1 - 21 of 21
• ### [Front cover]

Publication Year: 1982, Page(s): c1
| PDF (713 KB)
• ### List of Contributors

Publication Year: 1982, Page(s): nil1
| PDF (276 KB)
• ### [Breaker page]

Publication Year: 1982, Page(s): nil1
| PDF (276 KB)
• ### Cluster Validity for the Fuzzy c-Means Clustering Algorithrm

Publication Year: 1982, Page(s):357 - 363
Cited by:  Papers (127)  |  Patents (1)
| | PDF (1998 KB)

The uniform data function is a function which assigns to the output of the fuzzy c-means (Fc-M) or fuzzy isodata algorithm a number which measures the quality or validity of the clustering produced by the algorithm. For the preselected number of cluster c, the Fc-M algorithm produces c vectors in the space in which the data lie, called cluster centers, which represent points about which the data a... View full abstract»

• ### Medial Axis Transformation of a Planar Shape

Publication Year: 1982, Page(s):363 - 369
Cited by:  Papers (204)  |  Patents (5)
| | PDF (2486 KB)

The medial axis transformation is a means first proposed by Blum to describe a shape. In this paper we present a 0(n log n) algorithm for computing the medial axis of a planar shape represented by an n-edge simple polygon. The algorithm is an improvement over most previously known results interms of both efficiency and exactness and has been implemented in Fortran. Some computer-plotted output of ... View full abstract»

• ### Rule-Based Learning for More Accurate ECG Analysis

Publication Year: 1982, Page(s):369 - 380
Cited by:  Papers (24)  |  Patents (1)
| | PDF (3982 KB)

Long-term electrocardiograms exhibit a small number of QRS morphologies (waveform shapes) whose analysis can reveal cardiac abnormalities. We considered the problem of accurately identifying instances of each in 24-h ECG recordings. A new learning algorithm was developed. Each QRS morphology is represented as a tree of rule activations, which associate attribute measurements with a rule. Each rule... View full abstract»

• ### Unsupervised Learning Approach to Adaptive Differential Pulse Code Modulation

Publication Year: 1982, Page(s):380 - 391
Cited by:  Papers (3)
| | PDF (3437 KB)

This research is concerned with investigating the problem of data compression utilizing an unsupervised estimation algorithm. This extends previous work utilizing a hybrid source coder which combines an orthogonal transformation with differential pulse code modulation (DPCM). The data compression is achieved in the DPCM loop, and it is the quantizer of this scheme which is approached from an unsup... View full abstract»

• ### Studies in Semi-Admissible Heuristics

Publication Year: 1982, Page(s):392 - 399
Cited by:  Papers (33)
| | PDF (2193 KB)

The paper introduces three extensions of the A* search algorithm which improve the search efficiency by relaxing the admissibility condition. 1) A*ϵ employs an admissible heuristic function but invokes quicker termination conditions while still guaranteeing that the cost of the solution found will not exceed the optimal cost by a factor greater than 1 + ϵ. 2) R*�... View full abstract»

• ### An Experimental Study of Some Algorithms for Unsupervised Learning

Publication Year: 1982, Page(s):400 - 405
Cited by:  Papers (1)
| | PDF (1322 KB)

Three well-known algorithms for unsupervised learning using a decision-directed approach are the random labeling of patterns according to the estimated a posteriori probabilities, the classification according to the estimated a posteriori probabilities, and the iterative solution of the maximum likelihood equations. The convergence properties of these algorithms are studied by using a sample of ab... View full abstract»

• ### A Graph-Theoretic Method for Decomposing Two-Dimensional Polygonal Shapes into Meaningful Parts

Publication Year: 1982, Page(s):405 - 408
Cited by:  Papers (10)
| | PDF (666 KB)

This note gives a new graph-theoretic shape decomposition procedure, extending the idea in the paper Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering'' by Shapiro and Haralick [1]. A binary matrix is used in order to express the LI relation. A solution for the problems connected with artificial separation of two CS cliques and the presence of a regular concavity is proposed.... View full abstract»

• ### Segmentation of Images Having Unimodal Distributions

Publication Year: 1982, Page(s):408 - 419
Cited by:  Papers (32)
| | PDF (7844 KB)

A gradient relaxation method based on maximizing a criterion function is studied and compared to the nonlinear probabilistic relaxation method for the purpose of segmentation of images having unimodal distributions. Although both methods provide comparable segmentation results, the gradient method has the additional advantage of providing control over the relaxation process by choosing three param... View full abstract»

• ### A Medial Axis Transformation for Grayscale Pictures

Publication Year: 1982, Page(s):419 - 421
Cited by:  Papers (6)
| | PDF (1554 KB)

Blum's medial axis transformation (MAT) for binary pictures yields medial axis points that lie midway between opposite borders of a region or along angle bisectors. This note discusses a generalization of the MAT in which a score is computed for each point P of a grayscale picture based on the gradient magnitudes at pairs of points that have P as their midpoint. These scores are high at points tha... View full abstract»

• ### An On-Line Procedure for Recognition of Handprinted Alphanumeric Characters

Publication Year: 1982, Page(s):422 - 427
Cited by:  Papers (5)
| | PDF (1118 KB)

This correspondence presents a procedure to recognize handprinted alphanumeric characters written on a graphic tablet. After preprocessing, the input character is segmented into a polygon using a simple segmentation procedure. A feature vector is formed by the parameters which describe the segments of the polygon. Classification is done in two steps, the first one based on structural information e... View full abstract»

• ### A Nonparametric Two-Dimensional Display for Classification

Publication Year: 1982, Page(s):427 - 436
Cited by:  Papers (10)
| | PDF (1768 KB)

A two-dimensional display whose coordinates are related to the distance to the kth-nearest neighbor of each class is presented. Applications of the display to minimum error, minimum cost, minimax, and Neyman-Pearson type classifier designs are given. The display is shown to present risk information in a manner that easily allows the specification of reject regions. Two methods of error estimation ... View full abstract»

• ### Performance Evaluations of Correlations of Digital Images Using Different Separability Measures

Publication Year: 1982, Page(s):436 - 441
Cited by:  Papers (9)
| | PDF (1369 KB)

A comparison of four separability measures which are useful in the registration of two-dimensional images is presented. Bayes probability of error, Chernoff bound, Bhattacharyya bound, and Fisher's criteria are used in the selection of the appropriate reference images from a set of aerial pictures, each exhibiting a different view of a scene, i.e., down-looking and target-looking. The experiment i... View full abstract»

• ### Hierarchical Classifier Design Using Mutual Information

Publication Year: 1982, Page(s):441 - 445
Cited by:  Papers (109)  |  Patents (5)
| | PDF (1053 KB)

A nonparametric algorithm is presented for the hierarchical partitioning of the feature space. The algorithm is based on the concept of average mutual information, and is suitable for multifeature multicategory pattern recognition problems. The algorithm generates an efficient partitioning tree for specified probability of error by maximizing the amount of average mutual information gain at each p... View full abstract»

• ### Fuzzy Tree Automata and Syntactic Pattern Recognition

Publication Year: 1982, Page(s):445 - 449
Cited by:  Papers (19)
| | PDF (877 KB)

An approach of representing patterns by trees and processing these trees by fuzzy tree automata is described. Fuzzy tree automata are defined and investigated. The results include that the class of fuzzy root-to-frontier recognizable Σ-trees is closed under intersection, union, and complementation. Thus, the class of fuzzy root-to-frontier recognizable Σ-trees forms a Boolean algeb... View full abstract»

• ### Computational Cost of Image Registration with a Parallel Binary Array Processor

Publication Year: 1982, Page(s):449 - 455
Cited by:  Papers (5)
| | PDF (2578 KB)

The application of a simulated binary array processor (BAP) to the rapid analysis of a sequence of images has been studied. Several algorithms have been developed which may be implemented on many existing parallel processing machines. The characteristic operations of a BAP are discussed and analyzed. A set of preprocessing algorithms are described which are designed to register two images of TV-ty... View full abstract»

• ### Information about the Society

Publication Year: 1982, Page(s): 456
| PDF (105 KB)
• ### List of Contributors

Publication Year: 1982, Page(s): nil2
| PDF (197 KB)
• ### [Front cover]

Publication Year: 1982, Page(s): c2
| PDF (662 KB)

## Aims & Scope

The IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) is published monthly. Its editorial board strives to present most important research results in areas within TPAMI's scope.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Sven Dickinson
University of Toronto
e-mail: sven@cs.toronto.edu