By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 4 • Date July 1981

Filter Results

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

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

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

    Publication Year: 1981, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (249 KB)
    Freely Available from IEEE
  • Representing and Processing Grammatical Modifiers

    Publication Year: 1981, Page(s):357 - 367
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2753 KB)

    Representing English adjectives and adverbs in a logically perspicuous notation (extended semantic networks [17]) and their computational accommodation for natural language comprehension within a state-based paradigm [4] are discussed herewith. Where appropriate, explicit comparisons are made between this representational method and other related approaches such as those in [2], [9], [11], [12], [... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape Segmentation Using Relaxation

    Publication Year: 1981, Page(s):368 - 375
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1235 KB)

    Relaxation is applied to the segmentation of closed boundary curves of shapes. The ambiguous segmentation of the boundary is represented by a directed graph structure whose nodes represent segments, where two nodes are joined by an arc if the segments are consecutive along the boundary. A probability vector is associated with each node; each component of this vector provides an estimate of the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steps Toward Knowledge-Based Machine Translation

    Publication Year: 1981, Page(s):376 - 392
    Cited by:  Papers (14)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4513 KB)

    This paper considers the possibilities for knowledge-based automatic text translation in the light of recent advances in artificial intelligence. It is argued that competent translation requires some reasonable depth of understanding of the source text, and, in particular, access to detailed contextual information. The following machine translation paradigm is proposed. First, the source text is a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods

    Publication Year: 1981, Page(s):393 - 402
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2873 KB)

    Assessing the stability of a clustering method involves the measurement of the extent to which the generated clusters are affected by perturbations in the input data. A measure which specifies the disturbance in a set of clusters as the minimum number of operations required to restore the set of modified clusters to the original ones is adopted. A number of well-known graph theoretic clustering me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Locally Adaptive Peano Scanning Algorithm

    Publication Year: 1981, Page(s):403 - 412
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2220 KB)

    This paper describes an algorithm which builds a ``Peano scanning,'' i.e., the reciprocal mapping, from [0, 1]n to [0, 1], of the well-known ``Peano curve.'' This Peano scanning is applied to a set of points in [0, 1]n and gives a one-dimensional image of it. Several applications of this technique have already been developed and are presented in this paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach

    Publication Year: 1981, Page(s):412 - 424
    Cited by:  Papers (108)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4366 KB)

    We approach the problem of labeling a set of objects from a quantitative standpoint. We define a world model in terms of transition probabilities and propose a definition of a class of global criteria that combine both ambiguity and consistency. A projected gradient algorithm is developed to minimize the criterion. We show that the minimization procedure can be implemented in a highly parallel man... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Generalized Distance Transformation of Digitized Pictures

    Publication Year: 1981, Page(s):424 - 443
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6377 KB)

    In this paper, we present a generalization of the distance transformation of a digitized picture in two different aspects. First, we define the generalized distance transformation of a binary picture (GDTB). A subclass of GDTB, called a local minimum filter family of GDTB (LMF-GDTB), characterized by a series of local minimum filters with varying neighborhoods, is discussed in detail. A skeleton i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Mathematical and Representational Aspects of Solid Modeling

    Publication Year: 1981, Page(s):444 - 453
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3341 KB)

    An approach is presented to the tripartite problem of modeling physical solids mathematically, representing the models in a computer, and using representations in geometric algorithms. Examples are primarily from the domain of manufacturing and design of discrete goods, but the results reported here have wider significance. Mathematical definitions can formalize many of our intuitions about three-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Influence of Sample Set Structure on Decision Rule Quality for the Case of a Linear Discriminant Function

    Publication Year: 1981, Page(s):454 - 459
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1258 KB)

    The influence of sample set structure on decision rule quality for the case of a linear discriminant function is considered. Specifically, the case of missing data in the sample set and the case when the multivariate random variable is to be registered with the help of a single-channel device are investigated. Some rather unusual phenomena are discussed, such as when some new samples are added to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relaxation: Evaluation and Applications

    Publication Year: 1981, Page(s):459 - 469
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4763 KB)

    Probabilistic relaxation labeling processes are iterative parallel schemes that use contextual information to reduce local ambiguities. The behavior of these processes can be described by examining the rates of change and entropies of the probability vectors at each iteration. Examples are given comparing three relaxation processes as applied to several basic image analysis tasks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ANDAL: A Nonparametric Discrimination And Learning Algorithm for Recognition in Imperfectly Supervised Environments

    Publication Year: 1981, Page(s):469 - 476
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1761 KB)

    The problem of recognition in nonparametric environments under imperfect supervision is not amenable to solution through classical statistical approaches based on identification of finite mixtures, which require an a priori knowledge of the probabilistic descriptions of the classes. Accordingly, the problem is viewed in this study as one of optimal linear/nonlinear partitioning of the imperfectly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Notes on Cellular Logic Operators

    Publication Year: 1981, Page(s):476 - 481
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    Cellular logic machines used for feature extraction in pattern recognition have increased in speed to the point of making it possible to execute programs equivalent to 1 billion general-purpose computer instructions in 1 TV frame time. Unfortunately, most cellular logic operators (CLO's) are designed ad hoc. It is important, therefore, to begin to systematize the generation of algorithms using CLO... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional Edge Detection by Hypersurface Fitting

    Publication Year: 1981, Page(s):482 - 486
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2918 KB)

    One way to define operators for detecting edges in digital images is to fit a surface (plane, quadric,...) to a neighborhood of each image point and take the magnitude of the gradient of the surface as an estimate of the rate of change of gray level in the image at that point. This approach is extended to define edge detectors applicable to multidimensional arrays of data-e.g., three-dimensional a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Advertisement]

    Publication Year: 1981, Page(s): 487
    Request permission for commercial reuse | PDF file iconPDF (770 KB)
    Freely Available from IEEE
  • [Advertisement]

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

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

    Publication Year: 1981, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (131 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
David A. Forsyth
University of Illinois
e-mail: daf@illinois.edu