By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 1 • Date Jan 1989

Filter Results

Displaying Results 1 - 9 of 9
  • Off-line cursive script word recognition

    Publication Year: 1989, Page(s):68 - 83
    Cited by:  Papers (148)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1452 KB)

    Cursive script word recognition is the problem of transforming a word from the iconic form of cursive writing to its symbolic form. Several component processes of a recognition system for isolated offline cursive script words are described. A word image is transformed through a hierarchy of representation levels: points, contours, features, letters, and words. A unique feature representation is ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authenticating edges produced by zero-crossing algorithms

    Publication Year: 1989, Page(s):43 - 57
    Cited by:  Papers (57)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3100 KB)

    It is shown that zero-crossing edge detection algorithms can produce edges that do not correspond to significant image intensity changes. Such edges are called phantom or spurious. A method for classifying zero crossings as corresponding to authentic or phantom edges is presented. The contrast of an authentic edge is shown to increase and the contrast of phantom edges to decrease with a decrease i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge detection and linear feature extraction using a 2-D random field model

    Publication Year: 1989, Page(s):84 - 95
    Cited by:  Papers (32)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1320 KB)

    The edge-detection problem is posed as one of detecting step discontinuities in the observed correlated image, using directional derivatives estimated with a random field model. Specifically, the method consists of representing the pixels in a local window by a 2-D causal autoregressive (AR) model, whose parameters are adaptively estimated using a recursive least-squares algorithm. The directional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction

    Publication Year: 1989, Page(s):2 - 12
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Piecewise continuous reconstruction of real-valued data can be formulated in terms of nonconvex optimization problems. Both stochastic and deterministic algorithms have been devised to solve them. The simplest such reconstruction process is the weak string. Exact solutions can be obtained for it and are used to determine the success or failure of the algorithms under precisely controlled condition... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Texture boundary detection based on the long correlation model

    Publication Year: 1989, Page(s):58 - 67
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    The problem of detecting texture boundaries without assuming any knowledge on the number of regions or the types of textures is considered. Texture boundaries are often regarded as better features than intensity edges, because a large class of images can be considered a composite of several different texture regions. An algorithm is developed that detects texture boundaries at reasonably high reso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree searched chain coding for subpixel reconstruction of planar curves

    Publication Year: 1989, Page(s):95 - 104
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Coding schemes for the quantization of line drawings that outperform basic chain codes are investigated. First, subpixel accuracy reconstruction is obtained by a simple linear filtering of the chain code points, which achieves a factor-of-three to-four reduction in average reconstruction distortion for smooth curves. Second, the basic chain encoding schemes are generalized to a multipath-tree-sear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a constraint equation for the estimation of displacement rates in image sequences

    Publication Year: 1989, Page(s):13 - 30
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1292 KB)

    The commonly used constraint equation ΔgTu+gt=0 for the estimation of optical flow can only be justified by assumptions that are, in general, far too restrictive for image sequences of real world scenes. B.G. Schunck (1985, 86) recently argued that a constraint equation for the estimation of what he called image flow has to include a term cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Threshold decomposition of gray-scale morphology into binary morphology

    Publication Year: 1989, Page(s):31 - 42
    Cited by:  Papers (50)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Recently, a superposition property called threshold decomposition and another property called stacking were introduced and shown to apply successfully to gray-scale morphological operations. This property allows gray-scale signals to be decomposed into multiple binary signals. The signals are processed in parallel, and the results are combined to produce the desired gray-scale result. The authors ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the detection of the axes of symmetry of symmetric and almost symmetric planar images

    Publication Year: 1989, Page(s):104 - 108
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    A simple algorithm is presented for finding all the axes of symmetry of symmetric and almost symmetric planar images having nonuniform gray-level (intensity images). The technique, which can also be used in conjunction with planar curves, is based on the identification of the centroids of the given image and other related sets of points, followed by a maximization of a specially defined coefficien... 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