By Topic

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Issue 6 • Date Jun 1991

Filter Results

Displaying Results 1 - 9 of 9
  • Efficiently computing and representing aspect graphs of polyhedral objects

    Publication Year: 1991 , Page(s): 542 - 551
    Cited by:  Papers (28)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1056 KB)  

    An efficient algorithm and a data structure for computing and representing the aspect graph of polyhedral objects under orthographic projection are presented. The aspect graph is an approach to representing 3-D objects by a set of 2-D views, for the purpose of object recognition. In this approach the viewpoint space is partitioned into regions such that in each region the qualitative structure of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On navigating between friends and foes

    Publication Year: 1991 , Page(s): 602 - 606
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB)  

    The problem of determining the optimal straight path between a planar set of points is considered. Each point contributes to the cost of a path a value that depends on the distance between the path and the point. The cost function, quantifying this dependence, can be arbitrary and may be different for different points. An algorithm to solve this problem using an extension of the Hough transform is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculating Dempster-Shafer plausibility

    Publication Year: 1991 , Page(s): 599 - 602
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (380 KB)  

    A sufficient condition for the equality of the plausibility and commonality measures of the Dempster-Shafer belief calculus is developed. When the condition is met, an efficient method to calculate relative plausibility is available. In particular, the method can be used to calculate the relative plausibility of atomic hypotheses and, therefore, it can be used to find the choice that maximizes thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pose determination from line-to-plane correspondences: existence condition and closed-form solutions

    Publication Year: 1991 , Page(s): 530 - 541
    Cited by:  Papers (36)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (888 KB)  

    A class of pose determination problems in which the sensory data are lines and the corresponding reference data are planes is discussed. The lines considered are different from edge lines in that they are not the intersection of boundary faces of the object. The author describes a polynomial approach that does not require a priori knowledge about the object location. Closed-form solutions for orth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive smoothing: a general tool for early vision

    Publication Year: 1991 , Page(s): 514 - 529
    Cited by:  Papers (105)  |  Patents (12)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1728 KB)  

    A method to smooth a signal while preserving discontinuities is presented. This is achieved by repeatedly convolving the signal with a very small averaging mask weighted by a measure of the signal continuity at each point. Edge detection can be performed after a few iterations, and features extracted from the smoothed signal are correctly localized (hence, no tracking is needed). This last propert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theoretical aspects of gray-level morphology

    Publication Year: 1991 , Page(s): 568 - 582
    Cited by:  Papers (28)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1136 KB)  

    After a brief discussion of the extension of mathematical morphology to complete lattices, the space of gray-level functions is considered and the concept of a threshold set is introduced. It is shown how one can use binary morphological operators and thresholding techniques to build a large class of gray-level morphological operators. Particular attention is given to the class of so-called flat o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Watersheds in digital spaces: an efficient algorithm based on immersion simulations

    Publication Year: 1991 , Page(s): 583 - 598
    Cited by:  Papers (922)  |  Patents (68)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1792 KB)  

    A fast and flexible algorithm for computing watersheds in digital gray-scale images is introduced. A review of watersheds and related motion is first presented, and the major methods to determine watersheds are discussed. The algorithm is based on an immersion process analogy, in which the flooding of the water in the picture is efficiently simulated using of queue of pixel. It is described in det... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the kinematics and structure of a rigid object from a sequence of monocular images

    Publication Year: 1991 , Page(s): 497 - 513
    Cited by:  Papers (60)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1852 KB)  

    The problem considered involves the use of a sequence of noisy monocular images of a three-dimensional moving object to estimate both its structure and kinematics. The object is assumed to be rigid, and its motion is assumed to be smooth. A set of object match points is assumed to be available, consisting of fixed features on the object, the image plane coordinates of which have been extracted fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust classifiers by mixed adaptation

    Publication Year: 1991 , Page(s): 552 - 567
    Cited by:  Papers (6)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1352 KB)  

    The production of robust classifiers by combining supervised training with unsupervised training is discussed. A supervised training phase exploits statistically scene invariant labeled data to produce an initial classifier. This is followed by an unsupervised training phase that exploits clustering properties of unlabeled data. This two-phase process is termed mixed adaptation. A probabilistic mo... 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