By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 4 • Date Apr 1998

Filter Results

Displaying Results 1 - 11 of 11
  • Ordinal measures for image correspondence

    Publication Year: 1998, Page(s):415 - 423
    Cited by:  Papers (168)  |  Patents (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3124 KB)

    We present ordinal measures of association for image correspondence in the context of stereo. Linear correspondence measures like correlation and the sum of squared difference between intensity distributions are known to be fragile. Ordinal measures which are based on relative ordering of intensity values in windows-rank permutations-have demonstrable robustness. By using distance metrics between ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pixel dissimilarity measure that is insensitive to image sampling

    Publication Year: 1998, Page(s):401 - 406
    Cited by:  Papers (252)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    Because of image sampling, traditional measures of pixel dissimilarity can assign a large value to two corresponding pixels in a stereo pair, even in the absence of noise and other degrading effects. We propose a measure of dissimilarity that is provably insensitive to sampling because it uses the linearly interpolated intensity functions surrounding the pixels. Experiments on real images show tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of text regions from digital engineering drawings

    Publication Year: 1998, Page(s):431 - 439
    Cited by:  Papers (19)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    An algorithm for text/graphics separation is presented in this paper. The basic principle of the algorithm is to erase nontext regions from mixed text and graphics engineering drawings, rather than extract text regions directly. This algorithm can be used to extract both Chinese and Western characters, dimensions, and symbols and has few limitations on the kind of engineering drawings and noise le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust reweighted MAP motion estimation

    Publication Year: 1998, Page(s):353 - 365
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    This paper proposes a motion estimation algorithm that is robust to motion discontinuity and noise. The proposed algorithm is constructed by embedding the least median squares (LMedS) of robust statistics into the maximum a posteriori (MAP) estimator. Difficulties in accurate estimation of the motion field arise from the smoothness constraint and the sensitivity to noise. To cope robustly with the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Hough transform versus the UpWrite

    Publication Year: 1998, Page(s):396 - 400
    Cited by:  Papers (20)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    This paper compares the Hough transform and the UpWrite for the detection of lines, circles, and ellipses. Both ideal and noisy images are tested. The UpWrite is found to be more robust for images containing perturbation noise. For ideal images and images with speckle noise, the results are found to depend on the complexity of the object being detected, with more complex objects favoring the UpWri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental arc segmentation algorithm and its evaluation

    Publication Year: 1998, Page(s):424 - 431
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    We present an incremental arc segmentation algorithm, which recovers the vectorized arc fragments obtained by the vectorization of a piece of arc image in a stepwise fashion. Due to proper threshold selection and consistent checking of cocircularity of the assumed arc pieces, the algorithm accurately constructs arcs from the vector input. Nearly 200 synthetic arcs, ranging in radius from five to 5... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision rule for pattern classification by integrating interval feature values

    Publication Year: 1998, Page(s):440 - 448
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    Pattern classification based on Bayesian statistical decision theory needs a complete knowledge of the probability laws to perform the classification. In the actual pattern classification, however, it is generally impossible to get the complete knowledge as constant feature values are influenced by noise. Therefore, it is necessary to construct more flexible and robust theory for pattern classific... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error guided design of a 3D vision system

    Publication Year: 1998, Page(s):366 - 379
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    We argue that for a method to be useful in practice, it is necessary to perform its sensitivity analysis and to investigate its robustness to measurement errors. We present here a complete sensitivity analysis of the 3D reconstruction method based on projective geometry. We use this sensitivity analysis to best design a system for the inference of the shape of a block of granite from cameras place... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronous random fields and image restoration

    Publication Year: 1998, Page(s):380 - 390
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    We propose a general synchronous model of lattice random fields which could be used similarly to Gibbs distributions in a Bayesian framework for image analysis, leading to algorithms ideally designed for an implementation on massively parallel hardware. After a theoretical description of the model, we give an experimental illustration in the context of image restoration View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast chain coding of region boundaries

    Publication Year: 1998, Page(s):407 - 415
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    A fast single-pass algorithm to convert a multivalued image from a raster-based representation into chain codes is presented. All chain codes are obtained in linear time with respect to the number of chain segments that are generated at each raster according to a set of templates. A formal statement and the complexity and performance analysis of the algorithm are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Singularities and regularities on line pictures via symmetrical trapezoids

    Publication Year: 1998, Page(s):391 - 395
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    An algorithm that decomposes a line image into singular and regular regions is presented. We define a contour trapezoid as the building block of regular regions, and postulate a maximal trapezoid set as the core of regular regions. Then, we describe an algorithm that calculates a maximal trapezoid set of a polygon and show how to use it to find a skeleton of a polygonal approximation of a contour.... 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