By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 8 • Date Aug 1989

Filter Results

Displaying Results 1 - 9 of 9
  • Radial projection: an efficient update rule for relaxation labeling

    Publication Year: 1989, Page(s):886 - 889
    Cited by:  Papers (94)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Relaxation labeling uses contextual information for finding consistent labelings of graphs. Although relaxation labeling is parallel and iterative, the complexity of updating with standard rules is too costly for practical implementation. A description is given of a computationally more efficient updating rule that utilizes radial projection instead of normal projection to avoid the complexities i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of sample size in classifier design

    Publication Year: 1989, Page(s):873 - 885
    Cited by:  Papers (157)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    The effect of finite sample-size on parameter estimates and their subsequent use in a family of functions are discussed. General and parameter-specific expressions for the expected bias and variance of the functions are derived. These expressions are then applied to the Bhattacharyya distance and the analysis of the linear and quadratic classifiers, providing insight into the relationship between ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the detection of dominant points on digital curves

    Publication Year: 1989, Page(s):859 - 872
    Cited by:  Papers (160)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    A parallel algorithm is presented for detecting dominant points on a digital closed curve. The procedure requires no input parameter and remains reliable even when features of multiple sizes are present on the digital curve. The procedure first determines the region of support for each point based on its local properties, then computes measures of relative significance (e.g. curvature) of each poi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Bayesian approach to reconstruction from incomplete projections of a multiple object 3D domain

    Publication Year: 1989, Page(s):840 - 858
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1836 KB)

    An estimation approach is described for three-dimensional reconstruction from line integral projections using incomplete and very noisy data. Generalized cylinders parameterized by stochastic dynamic models are used to represent prior knowledge about the properties of objects of interest in the probed domain. The object models, a statistical measurement model, and the maximum a posteriori probabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trace inference, curvature consistency, and curve detection

    Publication Year: 1989, Page(s):823 - 839
    Cited by:  Papers (123)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1968 KB)

    An approach is described for curve inference that is based on curvature information. The inference procedure is divided into two stages: a trace inference stage, which is the subject of the present work, and a curve synthesis stage. It is shown that recovery of the trace of a curve requires estimating local models for the curve at the same time, and that tangent and curvature information are suffi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed associative memory (DAM) for bin-picking

    Publication Year: 1989, Page(s):814 - 822
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    The feasibility of using a distributed associative memory as the recognition component for a bin-picking system is established. The system displays invariance to metric distortions and a robust response in the presence of noise, occlusions, and faults. Although the system is primarily concerned with two-dimensional problems, eight extensions to the system allow the three-dimensional bin-picking pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous parameter estimation and segmentation of Gibbs random fields using simulated annealing

    Publication Year: 1989, Page(s):799 - 813
    Cited by:  Papers (234)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1588 KB)

    An adaptive segmentation algorithm is developed which simultaneously estimates the parameters of the underlying Gibbs random field (GRF)and segments the noisy image corrupted by additive independent Gaussian noise. The algorithm, which aims at obtaining the maximum a posteriori (MAP) segmentation is a simulated annealing algorithm that is interrupted at regular intervals for estimating the GRF par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature extraction from boundary models of three-dimensional objects

    Publication Year: 1989, Page(s):785 - 798
    Cited by:  Papers (63)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 KB)

    An algorithm for extracting certain classes of form features from a relational boundary model of an object, called the generalized edge-face graph (GEFG), is described. The GEFG provides a face-based topological description of the object boundary and encodes the minimum number of relations needed in the recognition process. The feature identification and classification are based on the analysis of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for finding a common structure shared by a family of strings

    Publication Year: 1989, Page(s):890 - 895
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    An algorithm is presented for extracting and localizing a common structure in a family of strings with time complexity O(N2 L2 log2 L) where N is the number of strings and L their maximum length. The method could be extended to two-dimensional image analysis. This structure appears as alignments of words which are simila... View full abstract»

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

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