By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 6 • Date Jun 1997

Filter Results

Displaying Results 1 - 11 of 11
  • Techniques for assessing polygonal approximations of curves

    Publication Year: 1997, Page(s):659 - 666
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    Given the enormous number of available methods for finding polygonal approximations to curves techniques are required to assess different algorithms. Some of the standard approaches are shown to be unsuitable if the approximations contain varying numbers of lines. Instead, we suggest assessing an algorithm's results relative to an optimal polygon, and describe a measure which combines the relative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On dimensionality, sample size, and classification error of nonparametric linear classification algorithms

    Publication Year: 1997, Page(s):667 - 671
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    This paper compares two nonparametric linear classification algorithms $the zero empirical error classifier and the maximum margin classifier - with parametric linear classifiers designed to classify multivariate Gaussian populations. Formulae and a table for the mean expected probability of misclassification MEPN are presented. They show that the classification error is mainly determin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition of gray-scale morphological templates using the rank method

    Publication Year: 1997, Page(s):649 - 658
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    Convolutions are a fundamental tool in image processing. Nonlinear convolutions are used in such operations as the median filter, the medial axis transform, and erosion and dilation as defined in mathematical morphology. For large convolution masks or structuring elements, the computation cost resulting from implementation can be prohibitive. However, in many instances, this cost can be significan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Physically based adaptive preconditioning for early vision

    Publication Year: 1997, Page(s):594 - 607
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1340 KB)

    Several problems in early vision have been formulated in the past in a regularization framework. These problems, when discretized, lead to large sparse linear systems. In this paper, we present a novel physically based adaptive preconditioning technique which can be used in conjunction with a conjugate gradient algorithm to dramatically improve the speed of convergence for solving the aforemention... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structural matching by discrete relaxation

    Publication Year: 1997, Page(s):634 - 648
    Cited by:  Papers (93)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1344 KB)

    This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we focus on the issue of how relational inexactness may be quantified. We illustrate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The K1-map reduction for pattern classifications

    Publication Year: 1997, Page(s):616 - 622
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    A shortcut hand-reduction method known as the Karnaugh map (K map) is an efficient way of reducing Boolean functions to a minimum form for the purpose of minimizing hardware requirements. In this paper, by applying the prime group and the essential prime group concepts of the K maps to pattern classification problems, the K1-map reduction method is proposed. The K1-map reduction method can be used... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimum class-selective rejection rule

    Publication Year: 1997, Page(s):608 - 615
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    Class-selective rejection is an extension of simple rejection. That is, when an input pattern cannot be reliably assigned to one of the N classes in an N-class problem, it is assigned to a subset of classes that are most likely to issue the pattern, instead of simply being rejected. By selecting more classes, the risk of making an error can be reduced, at the price of subsequently having a larger ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • λτ-space representation of images and generalized edge detector

    Publication Year: 1997, Page(s):545 - 563
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3792 KB)

    An image and surface representation based on regularization theory is introduced in this paper. This representation is based on a hybrid model derived from the physical membrane and plate models. The representation, called the λτ-representation, has two dimensions; one dimension represents smoothness or scale while the other represents the continuity of the image or surface. It contains... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ligature modeling for online cursive script recognition

    Publication Year: 1997, Page(s):623 - 633
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Online recognition of cursive words is a difficult task owing to variable shape and ambiguous letter boundaries. The approach proposed is based on hidden Markov modeling of letters and inter-letter patterns called ligatures occurring in cursive script. For each of the letters and the ligatures we create one HMM that models temporal and spatial variability of handwriting. By networking the two kind... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In defense of the eight-point algorithm

    Publication Year: 1997, Page(s):580 - 593
    Cited by:  Papers (448)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The fundamental matrix is a basic tool in the analysis of scenes taken with two uncalibrated cameras, and the eight-point algorithm is a frequently cited method for computing the fundamental matrix from a set of eight or more point matches. It has the advantage of simplicity of implementation. The prevailing view is, however, that it is extremely susceptible to noise and hence virtually useless fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How easy is matching 2D line models using local search?

    Publication Year: 1997, Page(s):564 - 579
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    Local search is a well established and highly effective method for solving complex combinatorial optimization problems. Here, local search is adapted to solve difficult geometric matching problems. Matching is posed as the problem of finding the optimal many-to-many correspondence mapping between a line segment model and image line segments. Image data is assumed to be fragmented, noisy, and clutt... 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