By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 3 • Date May 1984

Filter Results

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

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

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

    Publication Year: 1984, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (177 KB)
    Freely Available from IEEE
  • Tactile Recognition and Localization Using Object Models: The Case of Polyhedra on a Plane

    Publication Year: 1984, Page(s):257 - 266
    Cited by:  Papers (80)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2508 KB)

    This paper discusses how data from multiple tactile sensors may be used to identify and locate one object, from among a set of known objects. We use only local information from sensors: 1) the position of contact points and 2) ranges of surface normals at the contact points. The recognition and localization process is structured as the development and pruning of a tree of consistent hypotheses abo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Quantization: Two Adaptive Data Structures for Multidimensional Spaces

    Publication Year: 1984, Page(s):266 - 280
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4114 KB)

    Two new data structures are defined for use in multidimensional histogramming. Their purpose is to cover a parameter space with a limited number of histogram bins so that fine precision is maintained where it is needed. The original motivation for these data structures was to implement Hough-like transforms in high-dimensional parameter spaces. The two data structures share the ability to adapt to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Converging Squares Algorithm: An Efficient Method for Locating Peaks in Multidimensions

    Publication Year: 1984, Page(s):280 - 288
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4164 KB)

    The converging squares algorithm is a method for locating peaks in sampled data of two dimensions or higher. There are two primary advantages of this algorithm over conventional methods. First, it is robust with respect to noise and data type. There are no empirical parameters to permit adjustment of the process, so results are completely objective. Second, the method is computationally efficient.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Extremum Principle for Shape from Contour

    Publication Year: 1984, Page(s):288 - 301
    Cited by:  Papers (83)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3562 KB)

    An extremum principle is developed that determines three-dimensional surface orientation from a two-dimensional contour. The principle maximizes the ratio of the area to the square of the perimeter, a measure of the compactness or symmetry of the three-dimensional surface. The principle interprets regular figures correctly and it interprets skew symmetries as oriented real symmetries. The maximum ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition

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

    Earley's algorithm has been commonly used for the parsing of general context-free languages and the error-correcting parsing in syntactic pattern recognition. The time complexity for parsing is 0(n3). This paper presents a parallel Earley's recognition algorithm in terms of an ``X*'' operator. By restricting the input context-free grammar to be ¿-free, the parallel algorithm can be executed on a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Global Nearest Neighbor Metric

    Publication Year: 1984, Page(s):314 - 318
    Cited by:  Papers (64)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1869 KB)

    A quadratic metric dAO (X, Y) =[(X - Y)T AO(X - Y)]¿ is proposed which minimizes the mean-squared error between the nearest neighbor asymptotic risk and the finite sample risk. Under linearity assumptions, a heuristic argument is given which indicates that this metric produces lower mean-squared error than the Euclidean metric. A nonparametric estimate of Ao is developed. If samples appear to com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual and Conceptual Hierarchy: A Paradigm for Studies of Automated Generation of Recognition Strategies

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

    The purpose of this correspondence is to show the design considerations in the choice of mechanisms when a flexible querysystem of visual scenes is being constructed. More concretely, the issues are: ¿ flexibility in adding new information to the knowledge base; ¿ power of inferencing; ¿ avoiding unnecessary generation of hypotheses where a great deal of image processing has to be perfected in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theory for Invariant Object Recognition in the Frontoparallel Plane

    Publication Year: 1984, Page(s):325 - 331
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1616 KB)

    We suggest a new computational theory for position, size, and orientation invariant recognition of planar gray-scale forms in frontoparallel view. The theory employs a spatial-frequency representation which approximates the complex-logarithmic conformally mapped Wigner distribution of a gray-scale image. Our discussion emphasizes the theoretical significance, method of computation, and practical u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental Acquisition of a Three-Dimensional Scene Model from Images

    Publication Year: 1984, Page(s):331 - 340
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5594 KB)

    We describe the current state of the 3-D Mosaic project, whose goal is to incrementally acquire a 3-D model of a complex urban scene from images. The notion of incremental acquisition arises from the observations that 1) single images contain only parfial information about a scene, 2) complex images are difficult to fully interpret, and 3) different features of a given scene tend to be easier to e... View full abstract»

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

    Publication Year: 1984, Page(s):340 - 351
    Cited by:  Papers (113)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6790 KB)

    A three-dimensional scene analysis system for the shape matching of real world 3-D objects is presented. Various issues related to representation and modeling of 3-D objects are addressed. A new method for the approximation of 3-D objects by a set of planar faces is discussed. The major advantage of this method is that it is applicable to a complete object and not restricted to single range view w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Syntactic Approach to 3-D Object Representation

    Publication Year: 1984, Page(s):351 - 364
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3757 KB)

    A 3-D object representation scheme which uses surfaces as primitives and grammatical production rules as structural relationship descriptors is proposed. Possible selections of surface primitives are discussed. Examples are given to illustrate the object description method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Encoding Boundaries with Quadtrees

    Publication Year: 1984, Page(s):365 - 369
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    The ``line quadtree'' data structure hierarchically represents a region and its boundary. Based on the standard quadtree, each node in this structure stores adjacency information as well. While line quadtrees use the same amount of space as standard qaudtrees, they facilitate several region processing algorithms. In particular, we describe efficient algorithms for boundary and superimposing two ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Relaxation Labeling

    Publication Year: 1984, Page(s):369 - 372
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (773 KB)

    Current implementation of probabilistic relaxation labeling (PRL) is based on stationary compatibility coefficients (SCC's). Such labeling frequently diverges from an achieved minimum labeling error. In this correspondence it is shown that by having nonstationary compatibility coefficients (NSCC's) the PRL stabilizes about the minimum error which is obtained during the early iterations. Also, a no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital Disks

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

    Geometric properties of digital disks are discussed. An algorithm is presented that determines whether or not a given digital region is a digital disk. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Two-Stage Cross Correlation Approach to Template Matching

    Publication Year: 1984, Page(s):374 - 378
    Cited by:  Papers (97)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2537 KB)

    Two-stage template matching with sum of absolute differences as the similarity measure has been developed by Vanderburg and Rosenfeld [1], [2]. This correspondence shows the development of two-stage template matching with cross correlation as the similarity measure. The threshold value of the first-stage is derived analytically and its validity is verified experimentally. Considerable speed-up ove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification Bias of the k-Nearest Neighbor Algorithm

    Publication Year: 1984, Page(s):379 - 381
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (575 KB)

    The k-nearest neighbor classifier has been used extensively in pattern analysis applications. This classifier can, however, have substantial bias when there is little class separation and the sample sizes are unequal. This classification bias is examined for the two-class situation and formulas presented that allows selection of values of k that yields minimum bias. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers

    Publication Year: 1984, Page(s): 382
    Request permission for commercial reuse | PDF file iconPDF (175 KB)
    Freely Available from IEEE
  • [Advertisement]

    Publication Year: 1984, Page(s): 383
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1984, Page(s): 383
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • Call for Papers

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

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

    Publication Year: 1984, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (135 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
David A. Forsyth
University of Illinois
e-mail: daf@illinois.edu