# IEEE Transactions on Pattern Analysis and Machine Intelligence

## Filter Results

Displaying Results 1 - 25 of 27
• ### [Front cover]

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

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

Publication Year: 1981, Page(s): nil1
| |PDF (246 KB)
• ### Continuous Relaxation and Local Maxima Selection: Conditions for Equivalence

Publication Year: 1981, Page(s):117 - 127
Cited by:  Papers (28)
| |PDF (2436 KB)

Relaxation labeling processes are a class of iterative algorithms for using contextual information to reduce local ambiguities. This paper introduces a new perspective toward relaxation-that of considering it as a process for reordering labels attached to nodes in a graph. This new perspective is used to establish the formal equivalence between relaxation and another widely used algorithm, local m... View full abstract»

• ### Pattern Recognition via Observation Correlations

Publication Year: 1981, Page(s):128 - 133
Cited by:  Papers (4)  |  Patents (2)
| |PDF (1931 KB)

In some pattern recognition tasks multiple observations of an observation vector Y = {Y1, Y2, ..., YM} are available for each object and the covariances of the Yi are characteristic of the object. With the assistance of a model of the generating process for Y a theoretical basis for the comparison of the covariance matrices is developed. Measurements based on synthetic data support the theory, and... View full abstract»

• ### From Local Maxima to Connected Skeletons

Publication Year: 1981, Page(s):134 - 143
Cited by:  Papers (58)
| |PDF (2651 KB)

In picture processing it is often convenient to deal with a stick-like version (skeleton) of binary digital images. Although skeleton connectedness is not necessary for storage and retrieval purposes, this property is desirable when a structural description of images is of interest. In this paper a parallel procedure is described which, applied to a connected image, originates a connected skeleton... View full abstract»

• ### Global Shape Analysis by k-Syntactic Similarity

Publication Year: 1981, Page(s):144 - 155
Cited by:  Papers (13)
| |PDF (4772 KB)

The k-syntactic similarity approach is couched in graphical representation terms and its ability to provide global recognition capability while retaining a low time complexity is explored. One potential application domain, that of composite shape decomposition into approximately convex subshapes, is described. This is shown to be equivalent to finding cycles within a particular graph. The approach... View full abstract»

• ### Statistical Pattern Classification with Binary Variables

Publication Year: 1981, Page(s):155 - 163
Cited by:  Papers (3)
| |PDF (3077 KB)

Binary random variables are regarded as random vectors in a binary-field (modulo-2) linear vector space. A characteristic function is defined and related results derived using this formulation. Minimax estimation of probability distributions using an entropy criterion is investigated, which leads to an A-distribution and bilinear discriminant functions. Nonparametric classification approaches usin... View full abstract»

• ### An Approximate Solution to Normal Mixture Identification with Application to Unsupervised Pattern Classification

Publication Year: 1981, Page(s):163 - 179
Cited by:  Papers (36)
| |PDF (3591 KB)

In this paper, an approach to unsupervised pattern classifiation is discussed. The classification scheme is based on an approximation of the probability densities of each class under the assumption that the input patterns are of a normal mixture. The proposed technique for identifying the mixture does not require prior information. The description of the mixture in terms of convexity allows to det... View full abstract»

• ### On the Performance of Chain Codes for Quantization of Line Drawings

Publication Year: 1981, Page(s):180 - 185
Cited by:  Papers (41)
| |PDF (1713 KB)

A class of quantization schemes is presented which generalizes various existing chain coding methods. For the general case, simple expressions are derived for the probabilities of the directional elements from which we can determine the number of curve points and the length of the quantized curve. These results allow for the comparison of performance of the various encoding schemes. View full abstract»

• ### Hough Transform from the Radon Transform

Publication Year: 1981, Page(s):185 - 188
Cited by:  Papers (139)  |  Patents (3)
| |PDF (1459 KB)

An appropriate special case of a transform developed by J. Radon in 1917 is shown to have the major properties of the Hough transform which is useful for finding line segments in digital pictures. Such an observation may be useful in further efforts to generalize the Hough transform. Techniques for applying the Radon transform to lines and pixels are developed through examples, and the appropriate... View full abstract»

• ### Pixel Labeling by Supervised Probabilistic Relaxation

Publication Year: 1981, Page(s):188 - 191
Cited by:  Papers (24)
| |PDF (919 KB)

A simple modification to existing probabilistic relaxation procedures is suggested which allows the information contained in initial labels to exert an influence on the direction of relaxation throughout the process. In this manner, the initial labels assume more importance than with conventional algorithms and are used in combination with the outcome of relaxation at each iteration to produce a c... View full abstract»

• ### A New Heuristic for Inferring Regular Grammars

Publication Year: 1981, Page(s):191 - 197
Cited by:  Papers (3)
| |PDF (1233 KB)

Modifications to a grammatical inference scheme by Feldman et al. are presented. A comparison of the relative performance of the original and modified schemes is made using the complexity measures of Feldman and Wharton. The case where a complex model is used to generate the sample set is then analyzed. A set of 104 samples was found that trained the program to infer the grammar that corresponded ... View full abstract»

• ### Hierarchical Representation of Three-Dimensional Objects Using Verbal Models

Publication Year: 1981, Page(s):197 - 204
Cited by:  Papers (6)  |  Patents (1)
| |PDF (1708 KB)

We present a formalism for the computer representation of three-dimensional shapes, that has as its goal to facilitate man-machine communication using verbal, graphic, and visual means. With this method, pieces may be assembled hierarchically using any of severalways of specifying attachment. The primitives of the representation are generalized cylinders, and the creating of assemblies may make us... View full abstract»

• ### Equivalence and Reduction of Expansive Tree Grammars

Publication Year: 1981, Page(s):204 - 206
| |PDF (652 KB)

The equivalence of nonterminals of an expansive tree grammar is considered. Algorithms are presented for constructing sets of equivalent nonterminals for an expansive tree grammar, for reducing the grammar, and for determining whether two grammars generate the same language. View full abstract»

• ### Pattern Recognition in Image Processing Using Interpixel Correlation

Publication Year: 1981, Page(s):206 - 208
Cited by:  Papers (1)
| |PDF (622 KB)

When within-object interpixel correlation varies appreciably from object to object, it may be important for the classifier to utilize this correlation, as well as the mean and variance of pixel intensities. In this correspondence interpixel correlation is brought into the classification scheme by means of a two-dimensional Markov model. View full abstract»

• ### A Min-Max Medial Axis Transformation

Publication Year: 1981, Page(s):208 - 210
Cited by:  Papers (46)
| |PDF (1602 KB)

Blum's medial axis transformation (MAT) of the set S of 1's in a binary picture can be defined by an iterative shrinking and reexpanding process which detects corners' on the contours of constant distance from S, and thereby yields a skeleton' of S. For unsegmented (gray level) pictures, one can use an analogous definition, in which local MIN and MAX operations play the roles of shrinking and ... View full abstract»

• ### Construction of a Distributed Associative Memory on the Basis of Bayes Discriminant Rule

Publication Year: 1981, Page(s):210 - 214
Cited by:  Papers (6)
| |PDF (1703 KB)

The purpose of this correspondence is to propose a new construction method of distributed associative memory which operates with discrete-valued signals. In this method, memorized pairs of vectors (cue vectors and data vectors) are recorded in the form of a matrix W and a vector T. From an input vector X, the data vector is recalled by an operation u(XW + T) where X is a cue vector or a noisy cue ... View full abstract»

• ### An Empirical Evaluation of Generalized Cooccurrence Matrices

Publication Year: 1981, Page(s):214 - 221
Cited by:  Papers (42)  |  Patents (1)
| |PDF (4502 KB)

A comparative study of generalized cooccurrence texture analysis tools is presented. A generalized cooccurrence matrix (GCM) reflects the shape, size, and spatial arrangement of texture features. The particular texture features considered in this paper are 1) pixel-intensity, for which generalized cooccurrence reduces to traditional cooccurrence; 2) edge-pixel; and 3) extended-edges. Three experim... View full abstract»

• ### Data Compression of the Kanji Character Patterns Digitized on the Hexagonal Mesh

Publication Year: 1981, Page(s):221 - 230
Cited by:  Papers (4)
| |PDF (4971 KB)

This correspondence describes new two-stage data compression algorithms of Kanji character patterns digitized on the hexagonal mesh. One third of the pattern elements are stored, and an additional small amount of data is used to correct effors in the recovered pattern. A data reduction of 60 percent has been achieved. View full abstract»

• ### CCD Implementation of a Three-Dimensional Video-Tracking Algorithm

Publication Year: 1981, Page(s):230 - 240
Cited by:  Papers (2)
| |PDF (1080 KB)

Implementation of a three-dimensional video tracking algorithm using CCD's is presented. The algorithm does not require conventional pattern recognition or continuous segmentation updating. The only requirements, for the class of targets presented, are that the sampling lattice contain only points inside the target and that the background vary slowly. Several well-known segmentation techniques are... View full abstract»

• ### Radial and Angular Moment Invariants for Image Identification

Publication Year: 1981, Page(s):240 - 242
Cited by:  Papers (97)
| |PDF (601 KB)

Radial and angular moments of images are presented and methods are shown for deriving moment functions that are invariant with respect to rotation, translation, reflection, and size changes without the aid of the theory of algebraic invariants. Hu's invariants are expressed in terms of these radial and angular moments and it is claimed that this facilitates visual inspection of invariance properti... View full abstract»

• ### Digital Image Processing

Publication Year: 1981, Page(s):242 - 243
| |PDF (497 KB)
• ### Picture Processing and Digital Filtering

Publication Year: 1981, Page(s):243 - 244
| |PDF (484 KB)
• ### Digital Image Processing

Publication Year: 1981, Page(s): 244
| |PDF (211 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