By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 7 • Date Jul 2000

Filter Results

Displaying Results 1 - 9 of 9
  • A cooperative algorithm for stereo matching and occlusion detection

    Publication Year: 2000, Page(s):675 - 684
    Cited by:  Papers (229)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1812 KB)

    Presents a stereo algorithm for obtaining disparity maps with occlusion explicitly detected. To produce smooth and detailed disparity maps, two assumptions that were originally proposed by Marr and Poggio (1976, 1979) are adopted: uniqueness and continuity. That is, the disparity maps have a unique value per pixel and are continuous almost everywhere. These assumptions are enforced within a three-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complex representation of algebraic curves and its simple exploitation for pose estimation and invariant recognition

    Publication Year: 2000, Page(s):663 - 674
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Representations are introduced for handling 2D algebraic curves (implicit polynomial curves) of arbitrary degree in the scope of computer vision applications. These representations permit fast, accurate pose-independent shape recognition under Euclidean transformations with a complete set of invariants, and fast accurate pose-estimation based on all the polynomial coefficients. The latter is accom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fitting optimal piecewise linear functions using genetic algorithms

    Publication Year: 2000, Page(s):701 - 718
    Cited by:  Papers (18)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    Constructing a model for data in R2 is a common problem in many scientific fields, including pattern recognition, computer vision, and applied mathematics. Often little is known about the process which generated the data or its statistical properties. For example, in fitting a piecewise linear model, the number of pieces, as well as the knot locations, may be unknown. Hence, the method ... View full abstract»

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

    Publication Year: 2000, Page(s):733 - 737
    Cited by:  Papers (47)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    A method for deforming curves in a given image to a desired position in a second image is introduced. The algorithm is based on deforming the first image toward the second one via a partial differential equation (PDE), while tracking the deformation of the curves of interest in the first image with an additional, coupled PDE; both the images and the curves on the frame/slices of interest are used ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dominant-subspace invariants

    Publication Year: 2000, Page(s):649 - 662
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1552 KB)

    Object recognition requires robust and stable features that are unique in feature space. Lie group analysis provides a constructive procedure to determine such features, called invariants, when they exist. Absolute invariants are rare in general, so quasi-invariants relax the restrictions required for absolute invariants and, potentially, can be just as useful in real-world applications. The paper... View full abstract»

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

    Publication Year: 2000, Page(s):726 - 732
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    In the literature, methods for fitting superellipses to data tend to be computationally expensive due to the nonlinear nature of the problem. This paper describes and tests several fitting techniques which provide different trade-offs between efficiency and accuracy. In addition, we describe various alternative error of fit measures that can be applied by most superellipse fitting methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new structure-from-motion ambiguity

    Publication Year: 2000, Page(s):685 - 700
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Demonstrates the existence of an approximate, intrinsic ambiguity in Euclidean structure from motion (SFM) which occurs as generically as the bas-relief ambiguity but, unlike it, strengthens for scenes with more depth variation. The ambiguity does not occur in projective SFM, but the reasons for this make projective reconstructions more likely to have large errors. Our analysis gives a semiquantit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assessing a mixture model for clustering with the integrated completed likelihood

    Publication Year: 2000, Page(s):719 - 725
    Cited by:  Papers (310)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    We propose an assessing method of mixture model in a cluster analysis setting with integrated completed likelihood. For this purpose, the observed data are assigned to unknown clusters using a maximum a posteriori operator. Then, the integrated completed likelihood (ICL) is approximated using the Bayesian information criterion (BIC). Numerical experiments on simulated and real data of the resultin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boundary finding with prior shape and smoothness models

    Publication Year: 2000, Page(s):738 - 743
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    We propose a unified framework for boundary finding, where a Bayesian formulation, based on prior knowledge and the edge information of the input image (likelihood), is employed. The prior knowledge in our framework is based on principal component analysis of four different covariance matrices corresponding to independence, smoothness, statistical shape, and combined models, respectively. Indeed, ... 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