By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 4 • Apr 1991

Filter Results

Displaying Results 1 - 10 of 10
  • Recognizing sources of random strings

    Publication Year: 1991, Page(s):386 - 394
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    The identification of a source given a sequence of random strings is discussed. Two modes of random string generation are analyzed. In the first mode, arbitrary strings are generated in which the individual symbols occur exactly once in each random string. The latter case corresponds to the situation in which the sources generate random permutations. In both cases, the best match to the distributi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel technique for signal-level perceptual organization

    Publication Year: 1991, Page(s):317 - 325
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1964 KB)

    Due to the potential for essentially unbounded scene complexity, it is often necessary to translate the sensor-derived signals into richer symbolic representations. A key initial stage in this abstraction process is signal-level perceptual organization (SLPO) involving the processes of partitioning and identification. A parallel SLPO algorithm that follows the global hypothesis testing paradigm, b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The topology of locales and its effects on position uncertainty

    Publication Year: 1991, Page(s):380 - 386
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The precision to which the position of a target in a digital image can be estimated may be analyzed by considering the possible digital representations of the target. Such an analysis leads to regions of indistinguishable target position, referred to as locales. By considering the density, distribution, and shape of these locales, the available precision can be estimated. Previously, such analyses... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical image analysis using irregular tessellations

    Publication Year: 1991, Page(s):307 - 316
    Cited by:  Papers (75)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1376 KB)

    A novel multiresolution image analysis technique based on hierarchies of irregular tessellations generated in parallel by independent stochastic processes is presented. Like traditional image pyramids these hierarchies are constructed in a number of steps on the order of log(image-size) steps. However, the structure of a hierarchy is adapted to the image content and artifacts of rigid resolution r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimized feature extraction and the Bayes decision in feed-forward classifier networks

    Publication Year: 1991, Page(s):355 - 364
    Cited by:  Papers (54)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The problem of multiclass pattern classification using adaptive layered networks is addressed. A special class of networks, i.e., feed-forward networks with a linear final layer, that perform generalized linear discriminant analysis is discussed, This class is sufficiently generic to encompass the behavior of arbitrary feed-forward nonlinear networks. Training the network consists of a least-squar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Least-squares estimation of transformation parameters between two point patterns

    Publication Year: 1991, Page(s):376 - 380
    Cited by:  Papers (567)  |  Patents (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    In many applications of computer vision, the following problem is encountered. Two point patterns (sets of points) {xi} and {xi}; i=1, 2, . . ., n are given in m-dimensional space, and the similarity transformation parameters (rotation, translation, and scaling) that give the least mean squared error between these point patterns ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal partitioning for classification and regression trees

    Publication Year: 1991, Page(s):340 - 354
    Cited by:  Papers (112)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1308 KB)

    An iterative algorithm that finds a locally optimal partition for an arbitrary loss function, in time linear in N for each iteration is presented. The algorithm is a K-means-like clustering algorithm that uses as its distance measure a generalization of Kullback's information divergence. Moreover, it is proven that the globally optimal partition must satisfy a nearest neighbour c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Camera calibration by vanishing lines for 3-D computer vision

    Publication Year: 1991, Page(s):370 - 376
    Cited by:  Papers (79)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A novel approach to camera calibration by vanishing lines is proposed. Calibrated parameters include the orientation, position, and focal length of a camera. A hexagon is used as the calibration target to generate a vanishing line of the ground plane from its projected image. It is shown that the vanishing line includes useful geometric hints about the camera orientation parameters and the focal l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of methods of choosing the smoothing parameter in image restoration by regularization

    Publication Year: 1991, Page(s):326 - 339
    Cited by:  Papers (167)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 KB)

    The method of regularization is portrayed as providing a compromise between fidelity to the data and smoothness, with the tradeoff being determined by a scalar smoothing parameter. Various ways of choosing this parameter are discussed in the case of quadratic regularization criteria. They are compared algebraically, and their statistical properties are comparatively assessed from the results of al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for structuring element decompositions

    Publication Year: 1991, Page(s):365 - 369
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    A theoretical lower bound on the number of points required in the decomposition of morphological structuring elements is described. It is shown that the decomposition of an arbitrary N-point structuring element will require at least [3 ln N/ln 3]points. Using this lower bound it is possible to find the optimal decompositions (in terms of the minimum number of unions or the minimu... 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
Sven Dickinson
University of Toronto
e-mail: sven@cs.toronto.edu