By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 5 • Date Sept. 1987

Filter Results

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

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

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

    Publication Year: 1987, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (177 KB)
    Freely Available from IEEE
  • The Entry-Exit Method of Shadow Boundary Segmentation

    Publication Year: 1987, Page(s):597 - 607
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2605 KB)

    A new method has been developed for interpreting the shadows of arbitrarily shaped surfaces by segmenting and labeling the shadow boundary. The method is based on the fact that a linear projection of any light ray (the ray is assumed to originate at a single, distant source) across a shadow either enters or exits the shadow at its boundary. Hence, junctures of entry and exit segments form vertices... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmentation and Classification of Range Images

    Publication Year: 1987, Page(s):608 - 620
    Cited by:  Papers (130)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5925 KB)

    The recognition of objects in three-dimensional space is a desirable capability of a computer vision system. Range images, which directly measure 3-D surface coordinates of a scene, are well suited for this task. In this paper we report a procedure to detect connected planar, convex, and concave surfaces of 3-D objects. This is accomplished in three stages. The first stage segments the range image... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characteristics of Natural Scenes Related to the Fractal Dimension

    Publication Year: 1987, Page(s):621 - 627
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3677 KB)

    Many objects in images of natural scenes are so complex and erratic, that describing them by the familiar models of classical geometry is inadequate. In this paper, we exploit the power of fractal geometry to generate global characteristics of natural scenes. In particular we are concerned with the following two questions: 1) Can we develop a measure which can distinguish between different global ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bootstrap Techniques for Error Estimation

    Publication Year: 1987, Page(s):628 - 633
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1433 KB)

    The design of a pattern recognition system requires careful attention to error estimation. The error rate is the most important descriptor of a classifier's performance. The commonly used estimates of error rate are based on the holdout method, the resubstitution method, and the leave-one-out method. All suffer either from large bias or large variance and their sample distributions are not known. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bayes Error Estimation Using Parzen and k-NN Procedures

    Publication Year: 1987, Page(s):634 - 643
    Cited by:  Papers (32)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2496 KB)

    The use of k nearest neighbor (k-NN) and Parzen density estimates to obtain estimates of the Bayes error is investigated under limited design set conditions. By drawing analogies between the k-NN and Parzen procedures, new procedures are suggested, and experimental results are given which indicate that these procedures yield a significant improvement over the conventional k-NN and Parzen procedure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision-Directed Multivariate Empirical Bayes Classification with Nonstationary Priors

    Publication Year: 1987, Page(s):644 - 660
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2799 KB)

    A decision-directed learning strategy is presented to recursively estimate (i.e., track) the time-varying a priori distribution for a multivariate empirical Bayes adaptive classification rule. The problem is formulated by modeling the prior distribution as a finite-state vector Markov chain and using past decisions to estimate the time evolution of the state of this chain. The solution is obtained... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence and Consistency of Fuzzy c-means/ISODATA Algorithms

    Publication Year: 1987, Page(s):661 - 668
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2021 KB)

    The fuzzy c-means/ISODATA algorithm is usually described in terms of clustering a finite data set. An equivalent point of view is that the algorithm clusters the support points of a finite-support probability distribution. Motivated by recent work on the hard version of the algorithm, this paper extends the definition to arbitrary distributions and considers asymptotic properties. It is shown that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Isomorphisms of Positional Board Games

    Publication Year: 1987, Page(s):669 - 675
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1769 KB)

    A model is proposed for a class of two-person games based on the occupation of positions on a board. Well-known games that can be rephrased within or with the help of the model are, for example, tic-tac-toe, qubic, go-moku, hex, and connect-four. The model is formulated in terms of a composite algebraic structure called board. A notion of board isomorphism is defined, a few concepts fundamental fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognition of Noisy Subsequences Using Constrained Edit Distances

    Publication Year: 1987, Page(s):676 - 685
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2804 KB)

    Let X* be any unknown word from a finite dictionary H. Let U be any arbitrary subsequence of X*. We consider the problem of estimating X* by processing Y, which is a noisy version of U. We do this by defining the constrained edit distance between XH and Y subject to any arbitrary edit constraint involving the number and type of edit operations to be performed. An algorithm to compute this constrai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of Partial 2-D Shapes Using Fourier Descriptors

    Publication Year: 1987, Page(s):686 - 690
    Cited by:  Papers (43)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1009 KB)

    We present a method for the classification of 2-D partial shapes using Fourier descriptors. We formulate the problem as one of estimating the Fourier descriptors of the unknown complete shape from the observations derived from an arbitrarily rotated and scaled shape with missing segments. The method used for obtaining the estimates of the Fourier descriptors minimizes a sum of two terms; the first... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Adaptive Hough Transform

    Publication Year: 1987, Page(s):690 - 698
    Cited by:  Papers (123)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3559 KB)

    We introduce the Adaptive Hough Transform, AHT, as an efficient way of implementing the Hough Transform, HT, method for the detection of 2-D shapes. The AHT uses a small accumulator array and the idea of a flexible iterative "coarse to fine" accumulation and search strategy to identify significant peaks in the Hough parameter spaces. The method is substantially superior to the standard HT implemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Least-Squares Fitting of Two 3-D Point Sets

    Publication Year: 1987, Page(s):698 - 700
    Cited by:  Papers (603)  |  Patents (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Two point sets {pi} and {p'i}; i = 1, 2,..., N are related by p'i = Rpi + T + Ni, where R is a rotation matrix, T a translation vector, and Ni a noise vector. Given {pi} and {p'i}, we present an algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 × 3 matrix. This new algorithm is compared to two earlier algorithms with respe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Registration of Translated and Rotated Images Using Finite Fourier Transforms

    Publication Year: 1987, Page(s):700 - 703
    Cited by:  Papers (129)  |  Patents (129)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1441 KB)

    A well-known method for image registration is based on a conventional correlation between phase-only, or whitened, versions of the two images to be realigned. The method, covering rigid translational movements, is characterized by an outstanding robustness against correlated noise and disturbances, such as those encountered with nonuniform, time varying illumination. This correspondence discusses ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multispectral Texture Synthesis Using Fractal Concepts

    Publication Year: 1987, Page(s):703 - 707
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1824 KB)

    Natural textures are synthesized across several spectral bands using no more than a single second-order descriptor for each band. The Fractal model for monochrome textures is used as a null-hypothesis. The eye's sensitivity to Fractal dimension under specific conditions is determined. Multispectral camouflage is generated to imitate a range of natural textures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of Sleep Patterns by Means of Markov Modeling and Correspondence Analysis

    Publication Year: 1987, Page(s):707 - 710
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (931 KB)

    Shown is how correspondence analysis can be used to track changes in an individuals' sleep pattern. Correspondence analysis was applied to sleep stage transition matrices computed from all-night sleep of normal, obese, and apnoetic subjects. Differences between the groups, and intraindividual changes in sleep patterns could be visualized better than with a x2-based clustering approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding Substitution Ciphers by Means of Word Matching with Application to OCR

    Publication Year: 1987, Page(s):710 - 715
    Cited by:  Papers (16)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1541 KB)

    A substitution cipher consists of a block of natural language text where each letter of the alphabet has been replaced by a distinct symbol. As a problem in cryptography, the substitution cipher is of limited interest, but it has an important application in optical character recognition. Recent advances render it quite feasible to scan documents with a fairly complex layout and to classify (cluste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method of Recognition of Arabic Cursive Handwriting

    Publication Year: 1987, Page(s):715 - 722
    Cited by:  Papers (53)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1273 KB)

    In spite of the progress of machine recognition techniques of Latin, Kana, and Chinese characters over the two past decades, the machine recognition of Arabic characters has remained almost untouched. In this correspondence, a structural recognition method of Arabic cursively handwritten words is proposed. In this method, words are first segmented into strokes. Those strokes are then classified us... View full abstract»

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

    Publication Year: 1987, Page(s): 723
    Request permission for commercial reuse | PDF file iconPDF (109 KB)
    Freely Available from IEEE
  • Future Events

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

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

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