Special Notice
IEEE Xplore is transitioning to HTTPS on 9 April 2018. Customer access via EZproxy will require version 6 or higher with TLS 1.1 or 1.2 enabled.
Review our EZproxy Upgrade Checklist to ensure uninterrupted access.

# IEEE Transactions on Pattern Analysis and Machine Intelligence

## Filter Results

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

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

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

Publication Year: 1982, Page(s): nil1
| PDF (277 KB)
• ### Matching Images to Models for Registration and Object Detection via Clustering

Publication Year: 1982, Page(s):229 - 241
Cited by:  Papers (185)  |  Patents (20)
| | PDF (5213 KB)

A new technique is presented for matching image features to maps or models. The technique forms all possible pairs of image features and model features which match on the basis of local evidence alone. For each possible pair of matching features the parameters of an RST (rotation, scaling, and translation) transformation are derived. Clustering in the space of all possible RST parameter sets revea... View full abstract»

• ### A Discrete Version of Green's Theorem

Publication Year: 1982, Page(s):242 - 249
Cited by:  Papers (26)
| | PDF (1843 KB)

We formulate a discrete version of Green's theorem such that a summation of a two-dimensional function over a discrete region can be evaluated by the use of a summation over its discrete boundary. In many cases, the discrete Green theorem can result in computational gain. Applications of the discrete Green theorem to several typical image processing problems are demonstrated. We also apply it to a... View full abstract»

• ### GODDESS: A Goal-Directed Decision Structuring System

Publication Year: 1982, Page(s):250 - 262
Cited by:  Papers (18)
| | PDF (3004 KB)

This paper describes an operational version of a computerized, domain-independent, decision support system which is based on a novel, goal-directed structure for representing decision problems. The structure allows the user to state relations among aspects, effects, conditions, and goals, in addition to actions and states which are the basic components of the traditional decision tree approach. Th... View full abstract»

• ### Studies in Global and Local Histogram-Guided Relaxation Algorithms

Publication Year: 1982, Page(s):263 - 277
Cited by:  Papers (19)  |  Patents (1)
| | PDF (9780 KB)

An image segmentation algorithm based on histogram clustering and probabilistic relaxation labeling is explored. The algorithm is evaluated by means of a set of artificially generated test images with known parameters. Two sources of pixel labeling errors are revealed. The first derives from distribution overlap in the histogram and leads to fragmented or missing regions in a segmentation. The sec... View full abstract»

• ### Cell Tracking: A Modeling and Minimization Approach

Publication Year: 1982, Page(s):277 - 291
Cited by:  Papers (12)  |  Patents (2)
| | PDF (6063 KB)

This paper presents a model of motion suitable for cell tracking. It includes a representation for cell dynamics enabling it to maintain a correspondence between successive images of cells undergoing morphological changes. This model is based on a minimization problem whose computational solution is similar in form to a Newton-Rhapson iteration. The model is supported by experimental results from ... View full abstract»

• ### Systematic Feature Extraction

Publication Year: 1982, Page(s):291 - 297
Cited by:  Papers (9)
| | PDF (2412 KB)

A systematic feature extraction procedure is proposed. It is based on successive extractions of features. At each stage a dimensionality reduction is made and a new feature is extracted. A specific example is given using the Gaussian minus-log-likelihood ratio as a basis for the extracted features. This form has the advantage that if both classes are Gaussianly distributed, only a single feature, ... View full abstract»

• ### Distance Transform for Images Represented by Quadtrees

Publication Year: 1982, Page(s):298 - 303
Cited by:  Papers (42)
| | PDF (1323 KB)

The concept of distance used in binary array representations of images is adapted to a quadtree representation. The chessboard distance metric is shown to be particularly suitable for the quadtree. A chessboard distance transform for a quadtree is defined as the minimum distance in the plane from each BLACK node to the border of a WHiTE node. An algorithm is presented which computes this transform... View full abstract»

• ### On the Difficulties Involved in the Segmentation of Pictures

Publication Year: 1982, Page(s):304 - 306
Cited by:  Papers (25)
| | PDF (791 KB)

The problem of picture segmentation is widely believed to be practically unsolvable in its more general case formulation. However, as far as the authors know no formal argumentation has yet been given to this belief related to the segmentation problem. This correspondence provides some theoretical aspects of this phenomenon. View full abstract»

• ### A Counterexample to a Diameter Algorithm for Convex Polygons

Publication Year: 1982, Page(s):306 - 309
Cited by:  Papers (9)
| | PDF (873 KB)

Recently, Snyder and Tang [1] proposed an algorithm for finding the diameter of a convex polygon. In this note a family of convex polygons is described for which their algorithm fails. It is also pointed out that the diameter of an arbitrary simple n-vertex polygon can be computed in O(n) time. View full abstract»

• ### Comments on "A Counterexample to a Diameter Algorithm for Convex Polygons

Publication Year: 1982, Page(s): 309
Cited by:  Papers (1)
| | PDF (220 KB)

First Page of the Article
View full abstract»

• ### An Empirical Comparison of Backtracking Algorithms

Publication Year: 1982, Page(s):309 - 316
Cited by:  Papers (3)
| | PDF (1786 KB)

In this paper we report the results of experimental studies of zero-level, one-level, and two-level search rearrangement backtracking. We establish upper and lower limits for the size problem for which one-level backtracking is preferred over zero-level and two-level methods, thereby showing that the zero-level method is best for very small problems. The one-level method is best for moderate size ... View full abstract»

• ### A Method for Finding Pairs of Antiparallel Straight Lines

Publication Year: 1982, Page(s):316 - 323
Cited by:  Papers (7)
| | PDF (3268 KB)

A method of pairing antiparallel straight lines is presented and discussed. The pairing is based on the distance between the lines, the amount by which they overlap, and on whether or not other lines are interposed. Examples are shown of applying the method to high resolution aerial photographs. Results indicate that cultural features such as roads and buildings can be extracted and that a signifi... View full abstract»

• ### Feature Extraction Using Problem Localization

Publication Year: 1982, Page(s):323 - 326
Cited by:  Papers (5)
| | PDF (786 KB)

Feature extraction is considered as a mean-quare estimation of the Bayes risk vector. The problem is simplified by partitioning the distribution space into local subregions and performing a linear estimation in each subregion. A modified clustering algorithm is used to fimd the partitioning which minimizes the mean-square error. View full abstract»

• ### A Gestalt-Guided Heuristic Boundary Follower for X-Ray Images of Lung Nodules

Publication Year: 1982, Page(s):326 - 331
Cited by:  Papers (17)
| | PDF (2100 KB)

A piecewise heuristic'' follower of the boundaries of difficult-to-notice nonoverlapping blobs in digitized images is described. The technique was tested on 324 X-ray images of candidate lung nodules from eight radiographs with good results. This technique is several times faster than earlier detectors of the boundaries of lung nodules, while maintaining good fidelity of the detected boundaries. View full abstract»

• ### Scaling Binary Images with the Telescoping Template

Publication Year: 1982, Page(s):331 - 335
Cited by:  Papers (7)  |  Patents (12)
| | PDF (881 KB)

The importance of enlarging and reducing two-level images such as graphical and documentary matter by digital means continues to grow as more such images are digitally represented. A nonlinear scaling scheme is devised which exploits the simplicity of this binary nature, treating images logically instead of arithmetically; a convolution-like effect is achieved without a single addition or multipli... View full abstract»

• ### Dot Pattern Processing Using Voronoi Neighborhoods

Publication Year: 1982, Page(s):336 - 343
Cited by:  Papers (94)  |  Patents (3)
| | PDF (1913 KB)

A sound notion of the neighborhood of a point is essential for analyzing dot patterns. The past work in this direction has concentrated on identifying pairs of points that are neighbors. Examples of such methods include those based on a fixed radius, k-nearest neighbors, minimal spanning tree, relative neighborhood graph, and the Gabriel graph. This correspondence considers the use of the region e... View full abstract»

• ### Repeated Hypothesis Testing on a Growing Data Set

Publication Year: 1982, Page(s):343 - 345
| | PDF (548 KB)

In many problems, especially when data are collected over a long period of time, hypothesis testing is done repeatedly as new data arrive. It is shown both for one particular problem and for a more general class of problems that if testing is performed each time on the total amount of data accumulated, the true simple null hypothesis will be rejected at least once as the number of tests approaches... View full abstract»

• ### Similarity Measures Between Strings Extended to Sets of Strings

Publication Year: 1982, Page(s):345 - 347
| | PDF (538 KB)

Similarity measures between strings (finite-length sequences of symbols) are extended to apply to sets of strings in an intuitive way which also preserves some of the desired properties of the initial similarity measure. Two quite different measures are used in the examples: the first for applications where numerical computation of pointwise similarity is needed; the second for applications which ... View full abstract»

• ### On the Chain Code of a Line

Publication Year: 1982, Page(s):347 - 353
Cited by:  Papers (45)
| | PDF (1121 KB)

In 1970 Freeman suggested the following criteria which the chain code of a line must meet [1], [2]: 1) at most two basic directions are present and these can differ only by unity, modulo eight, 2) one of these values always occurs singly, 3) successive occurrences of the principal direction occurring singly are as uniformly spaced as possible. In this correspondence we give the following: 1) an al... View full abstract»

Publication Year: 1982, Page(s):354 - 356
| PDF (2758 KB)
• ### List of Contributors

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

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