By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 4 • Date Oct. 1979

Filter Results

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

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

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

    Publication Year: 1979, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (250 KB)
    Freely Available from IEEE
  • A Coding Method of Chinese Characters

    Publication Year: 1979, Page(s):333 - 341
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1293 KB)

    In this paper we propose a coding method of handprinted Chinese characters in which, defining a grammar, the process of block categorization is made to correspond to a process of sentential generation. We obtain two strings of production rules and block codes being equivalent to the descriptions of the structure and internal components of a character pattern, and a Chinese character is encoded eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DECA: A Discrete-Valued Data Clustering Algorithm

    Publication Year: 1979, Page(s):342 - 349
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1884 KB)

    This paper presents a new clustering algorithm for analyzing unordered discrete-valued data. This algorithm consists of a cluster initiation phase and a sample regrouping phase. The first phase is based on a data-directed valley detection process utilizing the optimal second-order product approximation of high-order discrete probability distribution, together with a distance measure for discrete-v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and Error Estimates for Boolean Classifiers with Limited Complexity

    Publication Year: 1979, Page(s):350 - 356
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1969 KB)

    This paper extends the notions of capacity and distribution-free error estimation to nonlinear Boolean classifiers on patterns with binary-valued features. We establish quantitative relationships between the dimensionality of the feature vectors (d), the combinational complexity of the decision rule (c), the number of samples in the training set (n), and the classification performance of the resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Sinusoidal Family of Unitary Transforms

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

    A new family of unitary transforms is introduced. It is shown that the well-known discrete Fourier, cosine, sine, and the Karhunen-Loeve (KL) (for first-order stationary Markov processes) transforms are members of this family. All the member transforms of this family are sinusoidal sequences that are asymptotically equivalent. For finite-length data, these transforms provide different approximatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic Properties of Discrete Unitary Transforms

    Publication Year: 1979, Page(s):366 - 371
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1668 KB)

    A method for studying the asymptotic behavior of discrete transformations is developed using numerical quadrature theory. This method allows a more convenient examination of the correlation properties of common unitary transforms for large block sizes. As a practical result of this method it is shown that the discrete cosine transform is asymptotically optimal for all finite-order Markov signals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum Likelihood Estimation of Markov-Process Blob Boundaries in Noisy Images

    Publication Year: 1979, Page(s):372 - 384
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2928 KB)

    Effective and elegant procedures have recently appeared in the published literature for determining by computer a highly variable blob boundary in a noisy image [1]-[3]. In this paper we point out that if the blob boundary is modeled as a Markov process and the additive noise is modeled as a white Gaussian noise field, then maximization of the joint likelihood of the hypothesized blob boundary and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital Image and Spectrum Restoration by Quadratic Programming and by Modified Fourier Transformation

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

    We consider the convolution equation f * h + e = d, where f is sought, h is a known ``point spread function,'' e represents random errors, and d is the measured data. All these functions are defined on the integers mod(N). A mathematical-statistical fonnulation of the problem leads to minff * hdA, where the A-norm is derived from the statistical distribution of e. If f is known to be nonnegative, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Variation on a Nonparametric Clustering Method

    Publication Year: 1979, Page(s):400 - 408
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    A single modification to a mode-seeking clustering algorithm proposed by Koontz, Narendra, and Fukunaga is shown to generate a novel clustering and to provide an indication of cluster stability. The modified method should provide better clusterings for ``uniform, touching'' clusters than the original, although the original should work better than the modified method for ``touching Gaussian'' clust... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Quantitative Study of the Orientation Bias of Some Edge Detector Schemes

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

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Nonseparability of Image Models

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

    Jain and Angel's proof of nonseparability of the nearest neighbor model is discussed. A simple and helpful method is given to investigate the (non)separability of the autocorrelation of arbitrary two-dimensional image models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dual Method for Maximum Entropy Restoration

    Publication Year: 1979, Page(s):411 - 414
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    A simple iterative dual algorithm for maximum entropy image restoration is presented. The dual algorithm involves fewer parameters than conventional minimization in the image space. Mini-computer test results for Fourier synthesis with inadequate phantom data are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simplified Derivation of Frei's Histogram Hyperbolization for Image Enhancement

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

    Frei has recently introduced a new technique (histogram hyperbolization) for image enhancement by the manipulation of the picture brightness levels. An alternative derivation of Frei's result, both simpler and more general, is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Decision Problems for Bottom-Up Triangle Acceptors

    Publication Year: 1979, Page(s):415 - 417
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (506 KB)

    It is proved that the emptiness problem for deterministic bottom-up triangle acceptors (BTA's) over a single input symbol is recursively unsolvable. From this result, it is also shown that certain decision problems involving BTA's and BPA's (deterministic bottom-up pyramid acceptors) are unsolvable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to ``Decomposition of Three-Dimensional Objects into Spheres''

    Publication Year: 1979, Page(s): 417
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (136 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to ``A Random Walk Procedure for Texture Discrimination''

    Publication Year: 1979, Page(s): 417
    Request permission for commercial reuse | PDF file iconPDF (136 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1979 Index - IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-1

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

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

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

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