# IEEE Transactions on Pattern Analysis and Machine Intelligence

## Filter Results

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

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

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

Publication Year: 1982, Page(s): nil1
| PDF (275 KB)
• ### Opinion

Publication Year: 1982, Page(s): 1
| PDF (118 KB)
• ### A Model and Tracking Algorithm for a Class of Video Targets

Publication Year: 1982, Page(s):2 - 10
Cited by:  Papers (52)  |  Patents (4)
| | PDF (2212 KB)

Algorithms are developed for a real-time, automatic system capable of tracking two-dimensional (2-D) targets in complex scenes. A mathematical model of 2-D image spatial and temporal evolution applicable to certain classes of targets and target perturbations is developed. It is shown that for small target perturbations the 2-D tracking problem may be approximated as a 1-D time-varying parameter es... View full abstract»

• ### Minimum Cross-Entropy Pattern Classification and Cluster Analysis

Publication Year: 1982, Page(s):11 - 17
Cited by:  Papers (58)  |  Patents (1)
| | PDF (2149 KB)

This paper considers the problem of classifying an input vector of measurements by a nearest neighbor rule applied to a fixed set of vectors. The fixed vectors are sometimes called characteristic feature vectors, codewords, cluster centers, models, reproductions, etc. The nearest neighbor rule considered uses a non-Euclidean information-theoretic distortion measure that is not a metric, but that n... View full abstract»

• ### Recognition of Distorted Patterns Using the Viterbi Algorithm

Publication Year: 1982, Page(s):18 - 25
Cited by:  Papers (6)
| | PDF (2185 KB)

In this paper a new recognition system of distorted patterns is presented, where the Viterbi algorithm and a modified trellis incorporating a pertinent statistics of distorted patterns are used. The system works in a manner quite similar to our own human decision process. The trellis is so constructed that it can eliminate all the irrelevant pattern classes at the outset and leave only the most pr... View full abstract»

• ### The Use of Tree Derivatives and a Sample Support Parameter for Inferring Tree Systems

Publication Year: 1982, Page(s):25 - 34
Cited by:  Papers (9)
| | PDF (2969 KB)

Tree systems have been studied in the theoretical setting as an extension of finite automata. They have been found useful in the practical domain when applied to syntactic pattern recognition. The practical applications of tree systems have motivated the examination of inference techniques for tree grammars and tree automata. In this paper we present a tree automaton inference algorithm which inco... View full abstract»

• ### Approximations of Bayes and Minimax Risks and the Least Favorable Distribution

Publication Year: 1982, Page(s):35 - 40
Cited by:  Papers (1)
| | PDF (1680 KB)

In this paper we present a method for approximating the risks and Bayes risk associated with a Bayes decision procedure. Additionally, our method leads to approximating the least favorable distribution and the risk associated with the minimax decision procedure. We assume two states of nature (or classes of patterns) and multivariate probability density functions. Taylor series expansions are used... View full abstract»

• ### Boundary Detection in Multidimensions

Publication Year: 1982, Page(s):41 - 50
Cited by:  Papers (48)
| | PDF (3524 KB)

The development of image processing algorithms for time-varying imagery and computerized tomography data calls for generalization of the concepts of adjacency, connectivity, boundary, etc., to three and four-dimensional discrete spaces. This paper defines these basic concepts in unified terminology and presents algorithms for a boundary detection task in multidimensional space. The performance of ... View full abstract»

• ### A Refinement of a Spherical Decomposition Algorithm

Publication Year: 1982, Page(s): 51
Cited by:  Papers (2)
| | PDF (163 KB)

A refinement is suggested to the O'Rourke-Badler spherical decomposition algorithm which reduces its complexity from 0(n3) to 0(n2) View full abstract»

• ### An Automated Approach to the Design of Decision Tree Classifiers

Publication Year: 1982, Page(s):51 - 57
Cited by:  Papers (29)
| | PDF (1410 KB)

The classification of large dimensional data sets arising from the merging of remote sensing data with more traditional forms of ancillary data causes a significant computational problem. Decision tree classification is a popular approach to the problem. This type of classifier is characterized by the property that samples are subjected to a sequence of decision rules before they are assigned to a... View full abstract»

• ### Scene-Based Nonuniformity Compensation for Imaging Sensors

Publication Year: 1982, Page(s):57 - 61
Cited by:  Papers (2)  |  Patents (6)
| | PDF (2079 KB)

Multidetector imaging focal plane arrays like CCD TV cameras and infrared arrays possess large detector-to-detector dark current (offset) and responsivity (gain) variations which can completely mask the useful information. Conventional compensation techniques require temperature references of constant radiance over the entire field of view and a mechanical/electrooptical shutter to calibrate the f... View full abstract»

• ### A Maximum Likelihood Approach to Texture Classification

Publication Year: 1982, Page(s):61 - 68
Cited by:  Papers (38)
| | PDF (4545 KB)

A new approach to texture classification is described which is based on measurements of the spatial gray-level co-occurrence probability matrix. This approach can make use of assumed stochastic models for texture in imagery and is an approximation to the statistically optimum maximum likelihood classifier. The efficacy of the approach is demonstrated through experimental results obtained with real... View full abstract»

• ### A Core-Line Tracing Algorithm Based on Maximal Square Moving

Publication Year: 1982, Page(s):68 - 74
Cited by:  Papers (17)  |  Patents (2)
| | PDF (1529 KB)

This paper newly proposes and discusses a maximal square moving (MSM) algorithm for tracing the core lines or medial lines of objects in a digitized binary picture, by which structure-descriptive core-line representations are directly obtained. The MSM algorithm could be considered to be an extension of the medial axis transform (MAT) definition to discrete images since maximal squares are sub-sti... View full abstract»

• ### A Method for Selecting Constrained Hand-Printed Character Shapes for Machine Recognition

Publication Year: 1982, Page(s):74 - 78
Cited by:  Papers (11)
| | PDF (799 KB)

Since handwritten characters vary in shape and writing-stroke sequence, it is desirable to develop a standard set of characters that are of high quality, so that not only are they easy to write, but they are also most suitable for machine recognition. A database of more than 100 000 alphanumeric patterns was assembled. It consisted of 174 models of the alphanumeric characters written by both left-... View full abstract»

• ### Pixel Classification Based on Gray Level and Local Busyness''

Publication Year: 1982, Page(s):79 - 84
Cited by:  Papers (13)  |  Patents (2)
| | PDF (1416 KB)

An image can be segmented by classifying its pixels using local properties as features. Two intuitively useful properties are the gray level of the pixel and the busyness,'' or gray level fluctuation, measured in its neighborhood. Busyness values tend to be highly vari-able in busy regions; but great improvements in classification accuracy can be obtained by smoothing these values prior to class... View full abstract»

• ### On Bayes Risk Consistent Pattern Recognition Procedures in a Quasi-Stationary Environment

Publication Year: 1982, Page(s):84 - 87
Cited by:  Papers (9)
| | PDF (679 KB)

Van Ryzin and Greblicki showed that pattern recognition procedures derived from orthogonal series estimates of a probability density function are Bayes risk consistent. In this note it is proved that these procedures do not lose-under some additional conditions-their asymptotic properties even if the random environment is nonstationary. View full abstract»

• ### Analysis of Dot Product Space'' Shape Descriptions

Publication Year: 1982, Page(s):87 - 90
Cited by:  Papers (5)
| | PDF (929 KB)

A convenient representation for blob-like figures in an image consists of the orientation, length, and width of a bounding rect-angle. One fast algorithm for producing such a bounding rectangle is based upon a dot product space. The analysis of the dot product space shape representation is improved to handle certain pathological cases, and it is shown how to generalize this analysis to accommodate... View full abstract»

• ### Threshold Selection Using Quadtrees

Publication Year: 1982, Page(s):90 - 94
Cited by:  Papers (31)  |  Patents (1)
| | PDF (3997 KB)

A simple class of piecewise constant approximations to an image is constructed as follows: start with the entire image, subdivide it into quadrants if its gray level standard deviation is high, and repeat the process for each quadrant. This yields a decomposition of the image into blocks, each having low standard deviation, so that each of them can be approximated by a constant value, namely, its ... View full abstract»

• ### Information for authors

Publication Year: 1982, Page(s): 95
| PDF (234 KB)

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

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

Publication Year: 1982, Page(s): c2
| PDF (1879 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