IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 3 • May 1980

Filter Results

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

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

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

    Publication Year: 1980, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (251 KB)
    Freely Available from IEEE
  • The Consistent Labeling Problem: Part II

    Publication Year: 1980, Page(s):193 - 203
    Cited by:  Papers (43)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2704 KB)

    In this second part of a two-part paper, we explore the power and complexity of the g=fKP and g=vKP class of look-ahead operators which can be used to speed up the tree search in the consistent labeling problem. For a specified K and P we show that the fixedpoint power of g=fKP and g=vKP is the same, that g=fKP+1 is at least as powerful as g=fKP, and that g=vK+1p is at least as powerful at g=fKP. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theoretical Comparison of Texture Algorithms

    Publication Year: 1980, Page(s):204 - 222
    Cited by:  Papers (414)  |  Patents (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8900 KB)

    An evaluation of the ability of four texture analysis algorithms to perform automatic texture discrimination will be described. The algorithms which will be examined are the spatial gray level dependence method (SGLDM), the gray level run length method (GLRLM), the gray level difference method (GLDM), and the power spectral method (PSM). The evaluation procedure employed does not depend on the set... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Type Classification of Fingerprints: A Syntactic Approach

    Publication Year: 1980, Page(s):223 - 231
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2487 KB)

    A fingerprint classification procedure using a computer is described. It classifies the prints into one of ten defined types. The procedure is implemented using PICAP (picture array processor). The picture processing system includes a TV camera input and a special picture processor. The first part of the procedure is a transformation of the original print to a sampling matrix, where the dominant d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmentation of Muscle Cell Pictures: A Preliminary Study

    Publication Year: 1980, Page(s):232 - 242
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7473 KB)

    This paper describes a procedure for segmenting muscle cell pictures. The segmentation procedure is broken into two logical parts. The first part segments the picture into regions composed of cells or clumps of cells using a number of low-level operations. The second part of the procedure involves the segmentation of the cell clumps into individual cells. This is done by using a hierarchical clust... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Dimensionality, Sample Size, Classification Error, and Complexity of Classification Algorithm in Pattern Recognition

    Publication Year: 1980, Page(s):242 - 252
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2617 KB)

    This paper compares four classification algorithms-discriminant functions when classifying individuals into two multivariate populations. The discriminant functions (DF's) compared are derived according to the Bayes rule for normal populations and differ in assumptions on the covariance matrices' structure. Analytical formulas for the expected probability of misclassification EPN are de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Least Mean-Squared Error Approach to Syntactic Classification

    Publication Year: 1980, Page(s):252 - 255
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    The usual approach to numerical training in syntactic pattern recognition involves estimation of the production probabilities of stochastic context-free grammars. Here we describe a different approach, namely that of finding an LMSE discriminant hyperplane between sets of class samples in a space of ``structural indices'' determined by a context-free grammar. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Choice of Kernel Function for Density Estimation

    Publication Year: 1980, Page(s):255 - 258
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (671 KB)

    Let l=f^n(x) be the kernel estimate of a density f(x) from a sample of size n. Wahba [6] has developed an upper bound to E[f(x)-l=f^n(x)]2. In the present paper, we find the kernel function of finite support [m=-T, T] that minimizes Wahba's upper bound. It is Q(y) = (1 + am=-1) (2T)m=-1 [1-m=-a|y|a] where a = 2-pm=-1, p m=ge 1. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Probability Distribution of Conditional Classification Error

    Publication Year: 1980, Page(s):259 - 261
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    The probability distribution of the error incurred by a classification system on a given data set is derived. It is shown that the distribution is mixed binomial. A method for calculating the mixed binomial distribution recursively is proposed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensitivity Analysis in Bayesian Classification Models: Multiplicative Deviations

    Publication Year: 1980, Page(s):261 - 266
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1131 KB)

    The sensitivity of Bayesian pattern recognition models to multiplicative deviations in the prior and conditional probabilities is investigated for the two-class case. Explicit formulas are obtained for the factor K by which the computed posterior probabilities should be divided in order to eliminate the deviation effect. Numerical results for the case of binary features indicate that the Bayesian ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding the Extrema of a Region

    Publication Year: 1980, Page(s):266 - 269
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (817 KB)

    The computational difficulty of finding the extreme points (those two points furthest from each other) in a region of an image is examined. Various approaches are described, including computation of convex hulls, sophisticated search strategies, and a statistical method. Suitability of the various methods to particular applications is discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-Speed Multidimensional Convolution

    Publication Year: 1980, Page(s):269 - 273
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (935 KB)

    Fast computation algorithms are developed for twodimensional and general multidimensional convolutions. Two basic techniques (overlap-and-add, overlap-and-save) are described in detail. These techniques allow speed and storage requirement tradeoffs and they define a decomposition of the total convolution into partial convolutions that can be easily found by parallel use of fast sequential cyclic c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Corrections to ``Pattern Recognition as Conceptual Morphogenesis''

    Publication Year: 1980, Page(s):273 - 274
    Request permission for commercial reuse | PDF file iconPDF (287 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List of Reviewers

    Publication Year: 1980, Page(s):274 - 275
    Request permission for commercial reuse | PDF file iconPDF (147 KB)
    Freely Available from IEEE
  • Call for Papers

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

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

    Publication Year: 1980, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (1044 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