By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 1 • Date Jan. 1980

Filter Results

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

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

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

    Publication Year: 1980, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (256 KB)
    Freely Available from IEEE
  • A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms

    Publication Year: 1980, Page(s):1 - 8
    Cited by:  Papers (173)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1971 KB)

    In this paper the convergence of a class of clustering procedures, popularly known as the fuzzy ISODATA algorithms, is established. The theory of Zangwill is used to prove that arbitrary sequences generated by these (Picard iteration) procedures always terminates at a local minimum, or at worst, always contains a subsequence which converges to a local minimum of the generalized least squares objec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Area Segmentation of Images Using Edge Points

    Publication Year: 1980, Page(s):8 - 15
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7652 KB)

    A new method for segmenting images using abrupt changes in intensity (edge points) to separate regions of smoothly varying intensity is discussed. Region segmentation using edge points has not been very successful in the past because small gaps would allow merging of dissimilar regions. The present method uses an expansion-contraction technique in which the edge regions are first expanded to close... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting and Labeling Boundary Segments in Natural Scenes

    Publication Year: 1980, Page(s):16 - 27
    Cited by:  Papers (23)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5854 KB)

    This paper describes a set of algorithms used to perform segmentation of natural scenes through boundary analysis. The techniques include preprocessing, differentiation using a very simple operator, relaxation using case analysis, and postprocessing. The system extracts line segments as connected sets of edges, labels them, and computes features for them such as length and confidence. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a Method of Binary-Picture Representation and Its Application to Data Compression

    Publication Year: 1980, Page(s):27 - 35
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2823 KB)

    A method of representing a binary pictorial pattern is developed. Its original idea comes from a sequence of terminal symbols of a context-free grammar. It is a promising technique of data compression for ordinary binary-valued pictures such as texts, documents, charts, etc. Fundamental notions like complexity, primitives, simplifications, and other items about binary-valued pictures are introduce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces

    Publication Year: 1980, Page(s):35 - 46
    Cited by:  Papers (44)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3335 KB)

    Two algorithms for parametric piecewise polynomial evaluation and generation are described. The mathematical development of these algorithms is shown to generalize to new algorithms for obtaining curve and surface intersections and for the computer display of parametric curves and surfaces. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Real-Time Video Tracking System

    Publication Year: 1980, Page(s):47 - 56
    Cited by:  Papers (40)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3580 KB)

    Object identification and tracking applications of pattern recognition at video rates is a problem of wide interest, with previous attempts limited to very simple threshold or correlation (restricted window) methods. New high-speed algorithms together with fast digital hardware have produced a system for missile and aircraft identification and tracking that possesses a degree of ``intelligence'' n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Sensitivity of the Probability of Error Rule for Feature Selection

    Publication Year: 1980, Page(s):57 - 61
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1110 KB)

    The low sensitivity of the probability of error rule (Pe rule) for feature selection is demonstrated and discussed. It is shown that under certain conditions features with significantly different discrimination power are considered as equivalent by the Pe rule. The main reason for this phenomenon lies in the fact that, directly, the Pe rule depends only on the most probable class and that, under t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Decision Theory Approach to the Approximation of Discrete Probability Densities

    Publication Year: 1980, Page(s):61 - 67
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1181 KB)

    The problem of approximating a probability density function by a simpler one is considered from a decision theory viewpoint. Among the family of candidate approximating densities, we seek the one that is most difficult to discriminate from the original. This formulation leads naturaliy to the density at the smallest Bhattacharyya distance. The resulting optimization problem is analyzed in detail. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nosing Around the Neighborhood: A New System Structure and Classification Rule for Recognition in Partially Exposed Environments

    Publication Year: 1980, Page(s):67 - 71
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1140 KB)

    The scope of the classical k-NN classification techniques is enlarged under this study to cover partially exposed environments. The modified classification system structure required for successful operation in environments, wherein all the inherent pattern classes are not exposed to the system prior to deployment, is developed and illustrated with the aid of a specific classification rule-the neig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Relaxation Method for Multispectral Pixel Classification

    Publication Year: 1980, Page(s):72 - 75
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2626 KB)

    Three approaches to reducing errors in multispectral pixel classification were compared: 1) postprocessing (iterated reclassification based on comparison with the neighbors' classes); 2) preprocessing (iterated smoothing, by averaging with selected neighbors, prior to classification); and 3) relaxation (probabilistic classification followed by iterative probability adjustment). In experiments usin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three-Dimensional Skeletonization: Principle and Algorithm

    Publication Year: 1980, Page(s):75 - 77
    Cited by:  Papers (23)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1309 KB)

    An algorithm is proposed for skeletonization of 3-D images. The criterion to preserve connectivity is given in two versions: global and local. The latter allows local decisions in the erosion process. A table of the decisions for all possible configurations is given in this paper. The algorithm using this table can be directly implemented both on general purpose computers and on dedicated machiner... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Automating the Visual Inspection of Printed Wiring Boards

    Publication Year: 1980, Page(s):77 - 82
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1205 KB)

    The application of pattern recognition techniques to manufacturing processes is a rapidly developing technology. Automatic verification of the quality of printed wiring boards (PWB's) using pattern recognition techniques is one potential application in this field. Qualitatively, this problem is finding small, irregular features in an environment of complicated, but larger and well-defined geometri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic Gray Code as a Multikey Hashing Function

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

    In this paper, we extend the binary Gray code to symbolic Gray code. We then show that this symbolic Gray code can be used as a multikey hashing function for storing symbolic records. The record stored at location k and the record stored at location k + 1 will be nearest neighbors if this hashing function is used. Thus, this symbolic Gray code hashing function exhibits some kind of clustering prop... View full abstract»

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

    Publication Year: 1980, Page(s):91 - 92
    Request permission for commercial reuse | PDF file iconPDF (267 KB)
    Freely Available from IEEE
  • Information for authors

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

    Publication Year: 1980, Page(s):94 - 95
    Request permission for commercial reuse | PDF file iconPDF (254 KB)
    Freely Available from IEEE
  • [Advertisement]

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

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

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