By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 3 • Date May 1985

Filter Results

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

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

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

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

    Publication Year: 1985, Page(s): 245
    Request permission for commercial reuse | PDF file iconPDF (656 KB)
    Freely Available from IEEE
  • A Knowledge Based System for Analysis of Gated Blood Pool Studies

    Publication Year: 1985, Page(s):246 - 259
    Cited by:  Papers (38)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6759 KB)

    A system for obtaining a complete diagnostic description of an image sequence taken in nuclear medicine from the human heart has been developed, implemented, and tested. The knowledge about these images is represented in a semantic net, conclusions are drawn by a production rule approach, and scoring of alternative diagnoses is based on fuzzy membership functions. On the low level, image pixels ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Computational Approach to Approximate and Plausible Reasoning with Applications to Expert Systems

    Publication Year: 1985, Page(s):260 - 283
    Cited by:  Papers (140)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5768 KB)

    The intended purpose of this paper is twofold: proposing a common basis for the modeling of uncertainty and imprecision, and discussing various kinds of approximate and plausible reasoning schemes in this framework. Together with probability, different kinds of uncertainty measures (credibility and plausibility functions in the sense of Shafer, possibility measures in the sense of Zadeh and the du... View full abstract»

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

    Publication Year: 1985, Page(s):284 - 298
    Cited by:  Papers (35)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7105 KB)

    Quadtrees are a compact hierarchical method of representation of images. In this paper, we explore a number of hierarchical image representations as applied to binary images, of which quadtrees are a single exemplar. We discuss quadtrees, binary trees, and an adaptive hierarchical method. Extending these methods into the third dimension of time results in several other methods. All of these method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Waveform Correlation by Tree Matching

    Publication Year: 1985, Page(s):299 - 305
    Cited by:  Papers (38)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1913 KB)

    A waveform correlation scheme is presented. The scheme consists of four parts: 1) the representation of waveforms by trees, 2) the definition of basic operations on tree nodes and tree distance, 3) a tree matching algorithm, and 4) a backtracking procedure to find the best node-to-node correlation. This correlation scheme has been implemented. Results show that the scheme has the capability of han... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-Time Domain Expansion Approach to VLSI and Its Application to Hierarchical Scene Matching

    Publication Year: 1985, Page(s):306 - 319
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4536 KB)

    VLSI technology has recently received increasing attention due to its high performance and high reliability. Designing a VLSI structure systematically for a given task becomes a very important problem to many computer engineers. In this paper, we present a method to transform a recursive computation task into a VLSI structure systematically. The main advantages of this approach are its simplicity ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Recovery of Three-Dimensional Structure from Image Curves

    Publication Year: 1985, Page(s):320 - 326
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1627 KB)

    A class of inferences is described which allows the recovery of three-dimensional structures from the two-dimensional curves in an image. Unlike most previous methods, these inferences do not require restrictive assumptions or prior knowledge regarding the scene. They are based on the assumption that the camera viewpoint and the positions of the illumination sources are independent of the objects ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Wedge Filter Technique for Convex Boundary Estimation

    Publication Year: 1985, Page(s):326 - 332
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2932 KB)

    This paper describes a method for segmentation of convex shaped image regions. The wedge filter technique first employs the converging squares algorithm [1] to locate a region of interest. Then a region oriented boundary estimation technique, called the wedge filter, is applied. This wedge filter entails angular filtering and subsampling, and boundary interpolation. The technique is more capable o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contour Map Registration Using Fourier Descriptors of Gradient Codes

    Publication Year: 1985, Page(s):332 - 338
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1394 KB)

    To estimate the position of a subpicture P1 (with unknown angular misaligment) in a contour map P2, a method based on Fourier descriptors of multidirectional gradient codes is suggested. It is assumed that P2 is characterized by a set of magnitudes at equally spaceddiscrete points over a rectangular area; and P1 is described by a set of magnitudes at discrete points on directional axes emanated fr... View full abstract»

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

    Publication Year: 1985, Page(s):338 - 344
    Cited by:  Papers (65)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2718 KB)

    A rotationally invariant template matching using normalized invariant moments is described. It is shown that if normalized invariant moments in circular windows are used, then template matching in rotated images becomes similar to template matching in translated images. A speedup technique based on the idea of two-stage template matching is also described. In this technique, the zeroth-order momen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Quadtrees from Vector Representations of Polygons

    Publication Year: 1985, Page(s):344 - 349
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2198 KB)

    A new algorithm is presented which produces various forms of linear quadtrees directly from a vector representation of a polygon. This algorithm takes advantage of specific properties of linear quadtrees and associated linear keys to infer the colors of all parts of the region not cut by the polygon boundary. The method is further extended to multicolored (rather than binary) linear quadtrees whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Feature Design for Optical Character Recognition Using an Evolutionary Search Procedure

    Publication Year: 1985, Page(s):349 - 355
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1485 KB)

    An automatic evolutionary search is applied to the problem of feature extraction in an OCR application. A performance measure based on feature independence is used to generate features which do not appear to suffer from peaking effects [17]. Features are extracted from a training set of 30 600 machine printed 34 class alphanumeric characters derived from British mail. Classification results on the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monotonicity of Linear Separability Under Translation

    Publication Year: 1985, Page(s):355 - 358
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (825 KB)

    A set of n pattern vectors are given in d-space and classified arbitrarily into two sets. The sets of patterns are said to be linearly separable if there exists a hyperplane that separates them. We ask whether translation of one of these sets in an arbitrary direction helps separability. Sometimes yes and sometimes no, but yes on the average. The average is taken over all classifications of the pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Effect of Noise on the Moore-Penrose Generalized Inverse Associative Memory

    Publication Year: 1985, Page(s):358 - 360
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Monte Carlo simulations of the continuous Moore-Penrose generalized inverse associative memory (Kohonen [l]) have shown that the noise-to-signal ratio is improved on recall in the autoassociative case as long as the number of vector pairs stored is less than the number of components per vector. In the heteroassociative case, however, the noise-to-signal ratio may actually be greatly increased upon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Structures in Kernel Density Estimation

    Publication Year: 1985, Page(s):360 - 366
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1394 KB)

    We analyze and compare several data structures and algorithms for evaluating the kernel density estimate. Frequent evaluations of this estimate are for example needed for plotting, error estimation, Monte Carlo estimation of probabilities and functionals, and pattern classification. An experimental comparison is included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Loose-Pattern Process Approach to Clustering Fuzzy Data Sets

    Publication Year: 1985, Page(s):366 - 372
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    A loose-pattern process approach to clustering sets consists of three main computations: loose-pattern reject option, tight-pattern classifcation, and loose-pattern assigning classes. The loose-pattern rejection is implemented using a rule based on q nearest neighbors of each point. Two clustering methods, GLC and OUPIC, are introduced as tight-pattern clustering techniques. The decisions of loose... View full abstract»

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

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

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