By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 4 • Date July 1987

Filter Results

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

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

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

    Publication Year: 1987, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (187 KB)
    Freely Available from IEEE
  • Localizing Overlapping Parts by Searching the Interpretation Tree

    Publication Year: 1987, Page(s):469 - 482
    Cited by:  Papers (150)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4927 KB)

    This paper discusses how local measurements of positions and surface normals may be used to identify and locate overlapping objects. The objects are modeled as polyhedra (or polygons) having up to six degrees of positional freedom relative to the sensors. The approach operates by examining all hypotheses about pairings between sensed data and object surfaces and efficiently discarding inconsistent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Polygons to Recognize and Locate Partially Occluded Objects

    Publication Year: 1987, Page(s):483 - 494
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3369 KB)

    We present computer vision algorithms that recognize and locate partially occluded objects. The scene may contain unknown objects that may touch or overlap giving rise to partial occlusion. The algorithms revolve around a generate-test paradigm. The paradigm iteratively generates and tests hypotheses for compatibility with the scene until it identifies all the scene objects. Polygon representation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Resolution Skeletons

    Publication Year: 1987, Page(s):495 - 504
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3180 KB)

    This paper presents a new algorithm to compute skeletons of noisy images of objects which can be described as ``amorphous blobs.'' Such a requirement arose from our research to obtain a better understanding of the role of the pseudopod in leukocyte locomotion. It involves the modeling and detection of pseudopods which are by their nature nonrigid bodies appearing on the cell's surface membrane. By... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Shape Description Via the Multiresolution Symmetric Axis Transform

    Publication Year: 1987, Page(s):505 - 511
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2057 KB)

    A method is proposed that produces a shape description in the form of a hierarchy by scale of simple symmetric axis sequences. An axis segment that is a child of another has smaller scale and is seen as a branch of its parent. The scale value and parent-child relationship are induced by following the symmetric axis under successive reduction of resolution. The result, in two or three dimensions, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequency Domain Analysis and Synthesis of Image Pyramid Generating Kernels

    Publication Year: 1987, Page(s):512 - 522
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5641 KB)

    Construction of image pyramids is described as a two-di-mensional decimation process. Frequently employed generating kernels are compared to the optimal kernel that assures minimal information loss after the resolution reduction, i.e., the one corresponding to an ideal low pass filter. Physically realizable, optimal generating kernels are presented. The amount of computation required for generatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Sense for Depth of Field

    Publication Year: 1987, Page(s):523 - 531
    Cited by:  Papers (276)  |  Patents (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4447 KB)

    This paper examines a novel source of depth information: focal gradients resulting from the limited depth of field inherent in most optical systems. Previously, autofocus schemes have used depth of field to measured depth by searching for the lens setting that gives the best focus, repeating this search separately for each image point. This search is unnecessary, for there is a smooth gradient of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Analysis Using Mathematical Morphology

    Publication Year: 1987, Page(s):532 - 550
    Cited by:  Papers (484)  |  Patents (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (10534 KB)

    For the purposes of object or defect identification required in industrial vision applications, the operations of mathematical morphology are more useful than the convolution operations employed in signal processing because the morphological operators relate directly to shape. The tutorial provided in this paper reviews both binary morphology and gray scale morphology, covering the operations of d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparse Decompositions for Exploratory Pattern Analysis

    Publication Year: 1987, Page(s):551 - 560
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1762 KB)

    We define and verify the utility of a pattern analysis procedure called sparse decomposition. This technique involves sequentially ``peeling'' sparse subsets of patterns from a pattern set, where sparse subsets are sets of patterns which possess a certain degree of regularity or compactness as measured by a compactness measure c. If this is repeated until all patterns are deleted, then the sequenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extension of Conditional Probability and Measures of Belief and Disbelief in a Hypothesis Based on Uncertain Evidence

    Publication Year: 1987, Page(s):561 - 568
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1856 KB)

    Conditional probability is extended so as to be conditioned by an uncertain proposition of which truth value is ¿ (0 ¿ ¿ ¿ 1). Using the extended conditional probability, the measure of increased belief and disbelief in a hypothesis resulting from the observation of uncertain evidence are derived from MYCIN's measures based on certain evidence. On the comparison with our measures, it is shown ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Algorithm for Image Edge Extraction Using a Statistical Classifier Approach

    Publication Year: 1987, Page(s):569 - 577
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5114 KB)

    This correspondence describes a new algorithm for extracting edges from natural images. Starting from a simple image model, the algorithm poses the problem of edge extraction as a statistical classifier problem. The algorithm is capable of extracting and detecting edges from images even in the presence of noise. A step by step mathematical derivation of the algorithm reveals the flexibility of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Imagery Modeling and Motion Estimation Using Weak Formulations

    Publication Year: 1987, Page(s):578 - 584
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3422 KB)

    Basic research into the modeling and analysis of image sequence dynamics is presented. A distributed parameter system (DPS) framework and the concept of weak solutions are used to develop image motion estimation algorithms. These algorithms represent a region-oriented (as opposed to point-by-point) approach to image motion analysis which is theoretically justifiable, computationally advantageous, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Convolution with Laplacian-of-Gaussian Masks

    Publication Year: 1987, Page(s):584 - 590
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1796 KB)

    We present a technique for computing the convolution of an image with LoG (Laplacian-of-Gaussian) masks. It is well known that a LoG of variance a can be decomposed as a Gaussian mask and a LoG of variance ¿1 < ¿. We take advantage of the specific spectral characteristics of these filters in our computation: the LoG is a bandpass filter; we can therefore fold the spectrum of the image (after low... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel 2-D Convolution on a Mesh Connected Array Processor

    Publication Year: 1987, Page(s):590 - 594
    Cited by:  Papers (34)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1078 KB)

    In this correspondence, a parallel 2-D convolution scheme is presented. The processing structure is a mesh connected array processor consisting of the same number of simple processing elements as the number of pixels in the image. For most windows considered, the number of computation steps required is the same as that of the coefficients of a convolution window. The proposed scheme can be easily ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Advertisement]

    Publication Year: 1987, Page(s): 595
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Content Announcement

    Publication Year: 1987, Page(s): 596
    Request permission for commercial reuse | PDF file iconPDF (128 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