Scheduled System Maintenance
On Tuesday, September 26, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 3 • May 1983

Filter Results

Displaying Results 1 - 16 of 16
  • [Front cover]

    Publication Year: 1983, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (695 KB)
    Freely Available from IEEE
  • List of Contributors

    Publication Year: 1983, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (265 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1983, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (265 KB)
    Freely Available from IEEE
  • Contexts and Data Dependencies: A Synthesis

    Publication Year: 1983, Page(s):237 - 246
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2835 KB)

    Two data-organization devices that have come out of AI re-search are data pools (``contexts'') and data dependencies. The latter are more flexible than the former, and have supplanted them. Data pools offer certain advantages of efficiency, however, so it is worth trying to make the two mechanisms compatible. Doing this requires generalizing the mark-and-sweep algorithms that maintain consistency ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Planning in Time: Windows and Durations for Activities and Goals

    Publication Year: 1983, Page(s):246 - 267
    Cited by:  Papers (147)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6590 KB)

    A general purpose automated planner/scheduler is described which generates parallel plans to achieve goals with imposed time con-straints. Both durations and start time windows may be specified for sets of goal conditions. The parallel plans consist of not just actions but also of events (triggered by circumstances), inferences, and scheduled events (completely beyond the actor's control). Determi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Foundations of Relaxation Labeling Processes

    Publication Year: 1983, Page(s):267 - 287
    Cited by:  Papers (521)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5991 KB)

    A large class of problems can be formulated in terms of the assignment of labels to objects. Frequently, processes are needed which reduce ambiguity and noise, and select the best label among several possible choices. Relaxation labeling processes are just such a class of algorithms. They are based on the parallel use of local constraints between labels. This paper develops a theory to characteriz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Problem Reduction Representation for the Linguistic Analysis of Waveforms

    Publication Year: 1983, Page(s):287 - 298
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3605 KB)

    This paper shows how the nondirectional structural analysis of pattern data can be performed by matching a problem reduction representation (PRR) of pattern structure with sample data, using a best-first state space search algorithm called SSS*. The end result of the matching algorithm is a tree whose nodes represent recognized structures in the data. Tip nodes of the tree structure correspond to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-Window Parallel Adaptive Boundary Finding in Computer Vision

    Publication Year: 1983, Page(s):299 - 316
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8214 KB)

    The problem considered in this paper is the estimation of highly variable object boundaries in noisy images. Boundaries may be those of a tank in an IR image, a spinal canal in a CAT scan, a cloud in a visible light image, etc. Or they may be internal to an object such as the boundary between a spherical surface and a cylindrical surface in a manufactured object. The focus of the paper is on paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of Vector Fields to Image Processing

    Publication Year: 1983, Page(s):316 - 329
    Cited by:  Papers (50)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7536 KB)

    We use rotational and curvature properties of vector fields to identify critical features of an image. Using vector analysis and dif-ferential geometry, we establish the properties needed, and then use these properties in three ways. First, our results make it theoretically possible to identify extremal edges of an intensity function f(x, y) of two variables by considering the gradient vector fiel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Gradient Projection Algorithm for Relaxation Methods

    Publication Year: 1983, Page(s):330 - 332
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    We consider a particular problem which arises when apply-ing the method of gradient projection for solving constrained optimiza-tion and finite dimensional variational inequalities on the convex set formed by the convex hull of the standard basis unit vectors. The method is especially important for relaxation labeling techniques applied to problems in artificial intelligence. Zoutendijk's method f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Image Transform Coding Scheme Based on Spatial Domain Considerations

    Publication Year: 1983, Page(s):332 - 337
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3544 KB)

    Image transform coding is first briefly reviewed using conventional viewpoints. Then a new spatial domain interpretation is given to image transform coding. An improvement based on this viewpoint for the Fourier transform coding, which possesses simple spatial domain relations, is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification

    Publication Year: 1983, Page(s):337 - 344
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3919 KB)

    A two-dimensional recursive estimation algorithm based on the asymmetric half-plane model is described for the problem of MMSE (minimum mean-square error) filtering. The optimum filtering problem is solved by formulating the asymmetric half-plane ARMA (autoregressive moving average) model for two-dimensional data. The sequential parameter identification from the noisy two-dimensional data is also ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Pyramids to Define Local Thresholds for Blob Detection

    Publication Year: 1983, Page(s):345 - 349
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3939 KB)

    A method of detecting blobs in images is described. The method involves building a succession of lower resolution images and looking for spots in these images. A spot in a low resolution image corresponds to a distinguished compact region in a known position in the original image. Further, it is possible to calculate thresholds in the low resolution image, using very simple methods, and to apply t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Iterative Approach to Region Growing Using Associative Memories

    Publication Year: 1983, Page(s):349 - 352
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    The postulate is made that ``any computation which can be performed recursively can be performed easily and efficiently by iteration coupled with association.'' The ``easily and efficiently'' part of that postulate is nontrivial to prove, and is shown by examples in this paper. The use of association leads directly to potential implementation by content-addressable memories. The example addressed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List of Contributors

    Publication Year: 1983, Page(s): nil2
    Request permission for commercial reuse | PDF file iconPDF (199 KB)
    Freely Available from IEEE
  • [Front cover]

    Publication Year: 1983, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (102 KB)
    Freely Available from IEEE

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