By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 11 • Nov 1994

Filter Results

Displaying Results 1 - 11 of 11
  • Geometric reasoning for extraction of manufacturing features in iso-oriented polyhedrons

    Publication Year: 1994, Page(s):1087 - 1100
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1292 KB)

    This paper investigates the extraction of machining features from boundary descriptions of iso-oriented (having no inclined faces) polyhedrons. We prove that manufacturing the features proposed by our feature extractor results exactly in the desired part-in this respect, the approach is both sound and complete. Our method uses the adjacency information between faces to derive the features. This ke... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of surface geometry and segmentation using covariance techniques

    Publication Year: 1994, Page(s):1114 - 1116
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    In this correspondence, the application of covariance techniques to surface representation of 3-D objects is discussed and such ways of computing surface geometry are compared with traditional methods using differential geometry. It is shown how the covariance method provides surface descriptors that are invariant to rigid motions without explicitly using surface parameterizations or derivatives. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A game-theoretic approach to integration of modules

    Publication Year: 1994, Page(s):1074 - 1086
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1732 KB)

    This paper offers a new approach to integration of modules in an intelligent sensor system. Such a system requires that a set of modules-each doing a smaller portion of the overall task-be integrated within a unifying framework. From the perspective of computational systems, this problem holds a considerable interest because it is characterized by a set of coexisting mathematical objectives that n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Motion estimation via cluster matching

    Publication Year: 1994, Page(s):1128 - 1132
    Cited by:  Papers (10)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    A new method for estimating displacements in computer imagery through cluster matching is presented. Without reliance on any object model, the algorithm clusters two successive frames of an image sequence based on position and intensity. After clustering, displacement estimates are obtained by matching the cluster centers between the two frames using cluster features such as position, intensity, s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The morphological structure of images: the differential equations of morphological scale-space

    Publication Year: 1994, Page(s):1101 - 1113
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1140 KB)

    We introduce a class of nonlinear differential equations that are solved using morphological operations. The erosion and dilation act as morphological propagators propagating the initial condition into the “scale-space”, much like the Gaussian convolution is the propagator for the linear diffusion equation. The analysis starts in the set domain, resulting in the description of erosions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Depth and image recovery using a MRF model

    Publication Year: 1994, Page(s):1117 - 1122
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    This paper deals with the problem of depth recovery and image restoration from sparse and noisy image data. The image is modeled as a Markov random field and a new energy function is developed to effectively detect discontinuities in highly sparse and noisy images. The model provides an alternative to the use of a line process. Interpolation over missing data sites is first done using local charac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Poisson solvers and semi-direct methods for computing area based optical flow

    Publication Year: 1994, Page(s):1133 - 1138
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Simchony, Chellappa, and Shao (1990) proposed a semi-direct method for computing area based optical flow. Their method is based on the iterative application of a direct Poisson solver. This method is restricted to Dirichlet boundary conditions, i.e., it is applicable only when velocity vectors at the boundary of the domain are known a priori. The authors show, both experimentally and through analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SLIDE: subspace-based line detection

    Publication Year: 1994, Page(s):1057 - 1073
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1468 KB)

    An analogy is made between each straight line in an image and a planar propagating wavefront impinging on an array of sensors so as to obtain a mathematical model exploited in recent high resolution methods for direction-of-arrival estimation in sensor array processing. The new so-called SLIDE (subspace-based line detection) algorithm then exploits the spatial coherence between the contributions o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the hierarchical Bayesian approach to image restoration: applications to astronomical images

    Publication Year: 1994, Page(s):1122 - 1128
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    In an image restoration problem one usually has two different kinds of information. In the first stage, one has knowledge about the structural form of the noise and local characteristics of the restoration. These noise and image models normally depend on unknown hyperparameters. The hierarchical Bayesian approach adds a second stage by putting a hyperprior on the hyperparameters, where information... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmenting simply connected moving objects in a static scene

    Publication Year: 1994, Page(s):1138 - 1142
    Cited by:  Papers (23)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    A new segmentation algorithm is derived, based on an object-background probability estimate exploiting the experimental fact that the statistics of local image derivatives show a Laplacian distribution. The objects' simple connectedness is included directly into the probability estimate and leads to an iterative optimization approach that can be implemented efficiently. This new approach avoids ea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using symbolic computation to find algebraic invariants

    Publication Year: 1994, Page(s):1143 - 1149
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    Implicit polynomials have proved themselves as having excellent representation power for complicated objects, and there is growing use of them in computer vision, graphics, and CAD. A must for every system that tries to recognize objects based on their representation by implicit polynomials are invariants, which are quantities assigned to polynomials that do not change under coordinate transformat... 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