Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 1 • Jan. 1979

Filter Results

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

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

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

    Publication Year: 1979, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (235 KB)
    Freely Available from IEEE
  • Opinion

    Publication Year: 1979, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (123 KB)
    Freely Available from IEEE
  • A Hierarchical Syntactic Shape Analyzer

    Publication Year: 1979, Page(s):2 - 9
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2680 KB)

    In many cases a picture is described in terms of various plane objects and their shape. This paper describes a parser whose input is a piecewise linear encoding of a contour and whose output is a string of high-level descriptions: arcs, corners, protrusions, intrusions, etc. Such a representation can be used not only for description but also for recognition. Previous syntactic techniques for conto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering

    Publication Year: 1979, Page(s):10 - 20
    Cited by:  Papers (78)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2675 KB)

    This paper describes a technique for transforming a twodimensional shape into a binary relation whose clusters represent the intuitively pleasing simple parts of the shape. The binary relation can be defined on the set of boundary points of the shape or on the set of line segments of a piecewise linear approximation to the boundary. The relation includes all pairs of vertices (or segments) such th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Description Method of Handprinted Chinese Characters

    Publication Year: 1979, Page(s):20 - 24
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1915 KB)

    A description method of handprinted Chinese characters is presented. In the method, a Chinese character is composed of some partial patterns which are constructed using the concatenate relation, cross relation, and near relation. The relations of relative location among partial patterns are used for categorization of the partial pattems. A Chinese character is expressed from the results of categor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Intrinsic Dimensionality Estimator from Near-Neighbor Information

    Publication Year: 1979, Page(s):25 - 37
    Cited by:  Papers (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3217 KB)

    The intrinsic dimensionality of a set of patterns is important in determining an appropriate number of features for representing the data and whether a reasonable two- or three-dimensional representation of the data exists. We propose an intuitively appealing, noniterative estimator for intrinsic dimensionality which is based on nearneighbor information. We give plausible arguments supporting the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Frequency Domain Filter for Edge Detection in Digital Pictures

    Publication Year: 1979, Page(s):37 - 49
    Cited by:  Papers (79)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3055 KB)

    Edge detection and enhancement are widely used in image processing applications. In this paper we consider the problem of optimizing spatial frequency domain filters for detecting edges in digital pictures. The filter is optimum in that it produces maximum energy within a resolution interval of specified width in the vicinity of the edge. We show that, in the continuous case, the filter transfer f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Organization and Access of Image Data by Areas

    Publication Year: 1979, Page(s):50 - 60
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4449 KB)

    This paper concerns methods for indexing areas in twodimensional array data. A method for naming subpictures from rasterscan image data is presented with notation that eases their subsequent storage access. Equations are given for converting each subpicture name into a storage-location pointer. A function ``NUMERIC'' is described that aids this task. Algorithms enabling efficient retrieval of subp... View full abstract»

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

    Publication Year: 1979, Page(s):60 - 72
    Cited by:  Papers (155)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3276 KB)

    The problem of finding approximate matches of pieces of shapes to parts of larger shapes is investigated. The shapes are represented by polygonal approximations. Initially, figures of merit are assigned to the matches between pairs of angles on the two shapes. Relaxation methods are then used to find acceptable combinations of these matches. This approach was tested on a data base consisting of di... View full abstract»

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

    Publication Year: 1979, Page(s):73 - 80
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1269 KB)

    Ehrich and Foith have proposed an approach to the hierarchical representation of waveforms based on peak dominance relations. This correspondence proposes an alternative approach, derived from concepts of fuzzy connectedness. It also discusses the possibility of extending this approach to the description of curves and of images. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multivariate Autoregressive Feature Extraction and the Recognition of Multichannel Waveforms

    Publication Year: 1979, Page(s):80 - 86
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1315 KB)

    It is proposed that the autoregressive coefficient matrices appearing in a multivariate autoregressive model fitting may be used for feature extraction purposes in problems concerning recognition of multichannel waveforms. It is demonstrated how the information contained in the autoregressive parameters may be further compressed by applying the ordinary or a modified Karhunen-Loeve expansion. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Programming Algorithm for the Distance Between Two Finite Areas

    Publication Year: 1979, Page(s):86 - 88
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (531 KB)

    The problems of speech recognition and orthographic word correction have been greatly mitigated by the use of dynamic programming techniques for finding the distance between two finite sequences. This paper extends the technique into two dimensions, and presents an algorithm for finding the distance between two finite areas. Applications of the algorithm are suggested. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Thinning Algorithms for Gray-Scale Pictures

    Publication Year: 1979, Page(s):88 - 89
    Cited by:  Papers (51)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1162 KB)

    Elongated black objects in black-and-white pictures can be ``thinned'' to arcs and curves, without changing their connectedness, by (repeatedly) deleting black border points whose deletion does not locally disconnect the black points in their neighborhoods. This technique generalizes to gray-scale pictures if we use a weighted definition of connectedness: two points are ``connected'' if there is a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive Implementation of a Two-Step Nonparametric Decision Rule

    Publication Year: 1979, Page(s):90 - 94
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1097 KB)

    The two-step approach to nonparametric discrimination is that of estimating class-conditional densities and deriving the Bayes decision rule as if the estimates were true. Direct implementation of such a decision rule ecounters two computational problems. Complexity increases with sample size, and finite precision limits the decision rule domain. Here a recursive algorithm to reduce the expected n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of Natural Language Sentence Acceptors by a Supervised-Learning Technique

    Publication Year: 1979, Page(s):94 - 99
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1051 KB)

    The problem discussed here is to build automatically an acceptor for natural language sentences, a sample of sentences being given. We solve it in the context of computer-assisted instruction and database interrogation. This paper is focused toward the definition of a learning criterion, i.e., a quality measure on the set of the acceptors which are compatible with the sample. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalization of DPCM for Digital Image Compression

    Publication Year: 1979, Page(s):100 - 109
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5999 KB)

    A natural generalization of two-dimensional digital pulsecode modulations (DPCM) has been used to handle the compression of images for human eyes only. It shows that by ignoring the mean-square error (MSE) and wisely arranging the errors in the right place, a simple method can achieve very good results. View full abstract»

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

    Publication Year: 1979, Page(s):110 - 116
    Cited by:  Papers (24)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4109 KB)

    This correspondence describes research in the development of symbolic registration techniques directed toward the comparison of pairs of images of the same scene to ultimately generate descriptions of the changes in the scene. Unlike most earlier work in image registration, all the matching and analysis will be performed at a symbolic level rather than a signal level. We have applied this registra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Family of Similarity Measures Between Two Strings

    Publication Year: 1979, Page(s):116 - 118
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    We present a class of similarity measures for quantitatively comparing two strings, that is, two linearly ordered sets of elements. The strings can be of different lengths, the elements come from a single alphabet, and an element may appear any number of times. The limiting values of each measure are 0, when two completely different strings are compared, and 1, when the two strings are identical. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information for authors

    Publication Year: 1979, Page(s): 119
    Request permission for commercial reuse | PDF file iconPDF (266 KB)
    Freely Available from IEEE
  • IEEE copyright form

    Publication Year: 1979, Page(s):120 - 121
    Request permission for commercial reuse | PDF file iconPDF (260 KB)
    Freely Available from IEEE
  • [Advertisement]

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

    Publication Year: 1979, Page(s): 123
    Request permission for commercial reuse | PDF file iconPDF (106 KB)
    Freely Available from IEEE
  • Call for Papers

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