By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 2 • March 1984

Filter Results

Displaying Results 1 - 19 of 19
  • [Front cover]

    Publication Year: 1984, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (791 KB)
    Freely Available from IEEE
  • List of Contributors

    Publication Year: 1984, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1984, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • An Intelligent Control Strategy for Computer Consultation

    Publication Year: 1984, Page(s):129 - 136
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2147 KB)

    Expert consultant systems often perform computations on a directed graph of associated propositions. Each proposition is represented by a node. Edges connecting these nodes are associated with rules which organize the propositions into antecedent/consequent relationships. A node may be assigned a value through the edges that bind it to its antecedents. Various strategies are employed to determine ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape Matching of Two-Dimensional Objects

    Publication Year: 1984, Page(s):137 - 156
    Cited by:  Papers (127)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6359 KB)

    In this paper we present results in the areas of shape matching of nonoccluded and occluded two-dimensional objects. Shape matching is viewed as a ``segment matching'' problem. Unlike the previous work, the technique is based on a stochastic labeling procedure which explicitly maximizes a criterion function based on the ambiguity and inconsistency of classification. To reduce the computation time,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Representation for Shape Based on Peaks and Ridges in the Difference of Low-Pass Transform

    Publication Year: 1984, Page(s):156 - 170
    Cited by:  Papers (124)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6525 KB)

    This paper defines a multiple resolution representation for the two-dimensional gray-scale shapes in an image. This representation is constructed by detecting peaks and ridges in the difference of lowpass (DOLP) transform. Descriptions of shapes which are encoded in this representation may be matched efficiently despite changes in size, orientation, or position. Motivations for a multiple resoluti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local Shading Analysis

    Publication Year: 1984, Page(s):170 - 187
    Cited by:  Papers (192)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (10197 KB)

    Local analysis of image shading, in the absence of prior knowledge about the viewed scene, may be used to provide information about the scene. The following has been proved. Every image point has the same image intensity and first and second derivatives as the image of some point on a Lambertian surface with principal curvatures of equal magnitude. Further, if the principal curvatures are assumed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge Location to Subpixel Values in Digital Imagery

    Publication Year: 1984, Page(s):188 - 201
    Cited by:  Papers (174)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3953 KB)

    A new method for locating edges in digital data to subpixel values and which is invariant to additive and multiplicative changes in the data is presented. For one-dimensional edge patterns an ideal edge is fit to the data by matching moments. It is shown that the edge location is related to the so-called ``Christoffel numbers.'' Also presented is the study of the effect of additive noise on edge l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features

    Publication Year: 1984, Page(s):201 - 211
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2875 KB)

    Contextual template matching refers to situations where the feature sets of the two templates under consideration may not be identical, but are rather contingent on the context within which these templates are observed. This paper addresses context-dependent template matching where the relevancy of certain features to a given object is contingent on the value of higher level features. In such situ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Computation of the Difference of Low-Pass Transform

    Publication Year: 1984, Page(s):212 - 222
    Cited by:  Papers (56)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2313 KB)

    This paper defines the difference of low-pass (DOLP) transform and describes a fast algorithm for its computation. The DOLP is a reversible transform which converts an image into a set of bandpass images. A DOLP transform is shown to require O(N2) multiplies and produce O(N log(N)) samples from an N sample image. When Gaussian low-pass filters are used, the result is a set of images which have bee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compact Region Extraction Using Weighted Pixel Linking in a Pyramid

    Publication Year: 1984, Page(s):222 - 229
    Cited by:  Papers (75)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2161 KB)

    This correspondence describes a method of image segmentation based on a ``pyramid'' of reduced-resolution versions of the image. It defines link strengths between pixels at adjacent levels of the pyramid, based on proximity and similarity, and iteratively recomputes the pixel values and adjusts the link strengths. After a few iterations, the strengths stabilize, and the links that remain strong de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting Compact Objects Using Linked Pyramids

    Publication Year: 1984, Page(s):229 - 237
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6396 KB)

    This correspondence describes a method of extracting compact regions from images using three multiresolution (``pyramid'') representations of image features. The method makes use of a gray-level pyramid in which linking of similar nodes at successive levels smooths the image into uniform regions; an edge pyramid in which linking of similarly oriented edge elements serves to delineate the boundarie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy-Based Texture Analysis in the Spatial Frequency Domain

    Publication Year: 1984, Page(s):237 - 243
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1318 KB)

    An approach which uses regional entropy measures in the spatial frequency domain for texture discrimination is presented. The measures provide texture discriminating information independent of that contained in the usual summed energy within based frequency domain features. Performance of the entropy features as measured by a between-to-within-class scatter criterion is comparable to that of tradi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space and Time Efficient Virtual Quadtress

    Publication Year: 1984, Page(s):244 - 247
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (801 KB)

    The quadtree has recently become a major data structure in image processing. This correspondence investigates ways in which quadtrees may be efficiently stored as a forest of quadtrees and as a new structure we call a compact quadtree. These new structures are called virtual quadtrees because the basic operations we expect to perform in moving about within a quadtree can also be performed on the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Segmentation: A Comment on ``Studies in Global and Local Histogram-Guided Relaxation Algorithms''

    Publication Year: 1984, Page(s):247 - 249
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2082 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authors' reply

    Publication Year: 1984, Page(s): 249
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (981 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tree-Matching Algorithm Based on Node Splitting and Merging

    Publication Year: 1984, Page(s):249 - 256
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2114 KB)

    An algorithm that computes the best matching of two trees is described. The degree of mismatch, i.e., the distance, is measured in terms of the number of node splitting and merging operations required. The proposed tree distance is a more appropriate measurement of structural defonnation than the tree distance measure in terms of the number of insertions, deletions, and substitutions of tree nodes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List of Contributors

    Publication Year: 1984, Page(s): nil2
    Request permission for commercial reuse | PDF file iconPDF (207 KB)
    Freely Available from IEEE
  • [Front cover]

    Publication Year: 1984, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (198 KB)
    Freely Available from IEEE

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