Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.

# IEEE Transactions on Pattern Analysis and Machine Intelligence

## Filter Results

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

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

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

Publication Year: 1981, Page(s): nil1
| PDF (293 KB)
• ### On the Cellular Convexity of Complexes

Publication Year: 1981, Page(s):617 - 625
Cited by:  Papers (36)
| | PDF (2202 KB)

In this paper we discuss cellular convexity of complexes. A new definition of cellular convexity is given in terms of a geometric property. Then it is proven that a regular complex is celiularly convex if and only if there is a convex plane figure of which it is the cellular image. Hence, the definition of cellular convexity by Sklansky [7] is equivalent to the new definition for the case of regul... View full abstract»

• ### Parallel Region Property Computation by Active Quadtree Networks

Publication Year: 1981, Page(s):626 - 633
Cited by:  Papers (7)
| | PDF (5070 KB)

Given a binary image stored in a cellular array, a local reconfiguration process can be used to reconnect some of the cells into a quadtree network representing the image. This quadtree can also be roped,'' i.e., nodes representing adjacent image blocks of the same size can be joined. Using the roped quadtree network as a parallel (cellular) computer, image properties such as perimeter and genus... View full abstract»

• ### Semantic Description of Aerial Images Using Stochastic Labeling

Publication Year: 1981, Page(s):633 - 642
Cited by:  Papers (41)
| | PDF (4247 KB)

This paper discusses the application of stochastic labeling to a general symbolic image description problem. A method used to compute initial likelihoods and compatibilities is described. It was derived from an earlier symbolic matching procedure, but was modified to provide the data needed for application of the labeling method. This labeling procedure differs from simpler ones, in that it minimi... View full abstract»

• ### Optimal Solution of Linear Inequalities with Applications to Pattern Recognition

Publication Year: 1981, Page(s):643 - 655
Cited by:  Papers (6)
| | PDF (3060 KB)

An algorithm for the optimal solution of consistent and inconsistent linear inequalities is presented, where the optimality criterion is the maximization of the number of constraints satisfied. In the terminology of pattern recognition, the algorithm finds a linear decision function which minimizes the number of patterns misclassified. The algorithm is developed as a nonenumerative search procedur... View full abstract»

• ### Real-Time Adaptive Contrast Enhancement

Publication Year: 1981, Page(s):655 - 661
Cited by:  Papers (45)  |  Patents (22)
| | PDF (3726 KB)

A recursive filter approach is introduced to simplify real-time implementation of an adaptive contrast enhancement scheme for imaging sensors. With this scheme, even scenes possessing large global dynamic ranges (>40 dB) can be accommodated by the limited dynamic range (20 dB) of a display without losing the local contrast essential for image interpretation. This paper describes the recursive filt... View full abstract»

• ### Determining Surface Orientations of Specular Surfaces by Using the Photometric Stereo Method

Publication Year: 1981, Page(s):661 - 669
Cited by:  Papers (184)  |  Patents (2)
| | PDF (3335 KB)

The orientation of patches on the surface of an object can be determined from multiple images taken with different illumination, but from the same viewing position. The method, referred to as photometric stereo, can be implemented using table lookup based on numerical inversion of reflectance maps. Here we concentrate on objects with specularly reflecting surfaces, since these are of importance in... View full abstract»

• ### Some Results in the Processing of the Holy Shroud of Turin

Publication Year: 1981, Page(s):670 - 676
Cited by:  Papers (1)
| | PDF (5079 KB)

We illustrate some new developments in the three-dimensional (3-D) processing of the image of the Shroud of Turin. After analyzing the various possibilities of obtaining a clean'' two-dimensional (2-D) image, i.e., without noise due to rows and spots, we present the processed image used as a starting point for the three-dimensional processing. Moreover, we describe the mathematical methods used ... View full abstract»

• ### A Simple Contour Matching Algorithm

Publication Year: 1981, Page(s):676 - 678
Cited by:  Papers (5)
| | PDF (444 KB)

Two similarity measures between strings are proposed. This correspondence also describes an experiment performed to illustrate the inadequacy of a commonly used measure. View full abstract»

• ### Image Smoothing Based on Neighbor Linking

Publication Year: 1981, Page(s):679 - 683
Cited by:  Papers (8)  |  Patents (1)
| | PDF (3443 KB)

A new method for smoothing images by local weighted averaging is presented. The weights are computed as strengths of links between neighbors. These link strengths are averages of the variations in gray level over paths of length 2. It is shown that the method preserves edges, thin lines, and average gray levels. Moreover, it transforms the images into slowly varying regions with sharp borders, hav... View full abstract»

• ### Computing Perimeters of Regions in Images Represented by Quadtrees

Publication Year: 1981, Page(s):683 - 687
Cited by:  Papers (33)  |  Patents (2)
| | PDF (1004 KB)

An algorithm is presented for computing the total perimeter of a region in a binary image represented by a quadtree. The algorithm explores each segment of the boundary of the region once and only once. Analysis of the algorithm shows that its average execution time is proportional to the number of leaf nodes in the quadtree. View full abstract»

• ### Image Approximation from Gray Scale Medial Axes''

Publication Year: 1981, Page(s):687 - 696
Cited by:  Papers (5)
| | PDF (6238 KB)

Several types of gray-weighted medial axes'' have been defined. This paper shows that one of them, the min-max medial axis, can be used to reconstruct good approximations to the original image based on a relatively small amount of information. View full abstract»

• ### Comments on "Nosing Around the Neighborhood: A New System Structure and Classification Rule for Recognition in Partially Exposed Environments

Publication Year: 1981, Page(s):696 - 697
| | PDF (1116 KB)

Observations are made relative to the definition and generation of a consistent training sample set. We show that the consistency assumption is crucial to the method described in the above correspondence,1 and that, in general, the proposed solution to the generation problem, namely k-NN editing, fails to produce consistent sets. View full abstract»

• ### An Efficient Two-Dimensional FFT Algorithm

Publication Year: 1981, Page(s):698 - 701
Cited by:  Papers (3)
| | PDF (837 KB)

A new version of the radix-2 row-column method for computing two-dimensional fast Fourier transforms is proposed. It uses a multiple vector'' FFT algorithm to compute the transforms of all the columns in an array simultaneously while avoiding all trivial multiplications. The minicomputer implementation of the algorithm runs faster than the 2 Ã 2 vector radix FFT algorithm. Analysis of the numbe... View full abstract»

• ### Evaluation of Projection Algorithms

Publication Year: 1981, Page(s):701 - 708
Cited by:  Papers (57)  |  Patents (14)
| | PDF (1467 KB)

A number of linear and nonlinear mapping algorithms for the projection of patterns from a high-dimensional space to two dimensions are available. These two-dimensional representations allow quick visual observation of a data set. A combination of two popular mapping algorithms-Sammon's mean-square error technique and the triangulation method-is proposed to overcome the limitations in the individua... View full abstract»

• ### Elastic Matching of Line Drawings

Publication Year: 1981, Page(s):708 - 713
Cited by:  Papers (113)  |  Patents (5)
| | PDF (1298 KB)

Recently a dynamic elastic model [1] was proposed for automatic image matching. Examples were shown applying the model to dot patterns and gray scale pictures. This paper extends the model to line drawings. Examples are shown on handprint and animation, suggesting the use of dynamic matching for shape recognition and for motion correspondence. View full abstract»

• ### Remote Sensing: The Quantitative Approach

Publication Year: 1981, Page(s):713 - 714
| PDF (556 KB)
• ### Pattern-Directed Inference Systems

Publication Year: 1981, Page(s):714 - 715
Cited by:  Papers (1)
| PDF (337 KB)
• ### 1981 Index - IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-3

Publication Year: 1981, Page(s):716 - 722
| PDF (1499 KB)

Publication Year: 1981, Page(s):723 - 724
| PDF (350 KB)
• ### List of Contributors

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

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