IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 6 • Nov 1988

Filter Results

Displaying Results 1 - 21 of 21
  • Machine vision algorithms for automated inspection thin-film disk heads

    Publication Year: 1988, Page(s):830 - 848
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2040 KB)

    Machine vision algorithms and a supporting architecture that were integrated in a fully automated prototype system for disk head inspection are presented. Some specific methods are elaborated on, including the computation of the Hough transform and multicode masks in pipeline architectures, object segmentation in textured backgrounds, and matching of extracted defects with inspection specification... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A three-module strategy for edge detection

    Publication Year: 1988, Page(s):803 - 810
    Cited by:  Papers (26)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The first module is a parallel process computing local edge strength and direction, while the last module is sequential process following edges. The originality of the overall method resides in the intermediate module, which is seen as a generalization of the nonmaximum-deletion algorithm. The role of this module is twofold: It enables one to postpone some deletion to the last module where context... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge structuring and constraint satisfaction: the Mapsee approach

    Publication Year: 1988, Page(s):866 - 879
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB)

    Schema-based representations for visual knowledge are integrated with constraint satisfaction techniques. This integration is discussed in a progression of three sketch map interpretation programs: Mapsee-1, Mapsee-2, and Mapsee-3. The programs are evaluated by the criteria of descriptive and procedural adequacy. The evaluation indicates that a schema-based representation used in combination with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three-dimensional shape analysis using moments and Fourier descriptors

    Publication Year: 1988, Page(s):937 - 943
    Cited by:  Papers (112)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    A procedure for using moment-based feature vectors to identify a three-dimensional object from a two-dimensional image recorded at an arbitrary viewing angle and range is presented. A moment form called standard moments, rather than the usual moment invariants, is considered. A standard six-airplane experiment was used to compare different techniques. Fourier descriptors and moment invariants were... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evidence-based recognition of 3-D objects

    Publication Year: 1988, Page(s):783 - 802
    Cited by:  Papers (88)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1712 KB)

    An evidence-based recognition technique is defined that identifies 3-D objects by looking for their notable features. This technique makes use of an evidence rule base, which is a set of salient or evidence conditions with corresponding evidence weights for various objects in the database. A measure of similarity between the set of observed features and the set of evidence conditions for a given o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical chamfer matching: a parametric edge matching algorithm

    Publication Year: 1988, Page(s):849 - 865
    Cited by:  Papers (545)  |  Patents (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1928 KB)

    The algorithm matches edges by minimizing a generalized distance between them. The matching is performed in a series of images depicting the same scene with different resolutions, i.e. in a resolution pyramid. Using this hierarchical structure reduces the computational load significantly. The algorithm is reasonably simple to implement and is insensitive to noise and other disturbances. The algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Precision edge contrast and orientation estimation

    Publication Year: 1988, Page(s):927 - 937
    Cited by:  Papers (96)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    The contrast and orientation estimation accuracy of several edge operators that have been proposed in the literature is examined both for the noiseless case and in the presence of additive Gaussian noise. The test image is an ideal step edge that has been sampled with a square-aperture grid. The effects of subpixel translations and rotations of the edge on the performance of the operators are stud... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal transformation for discriminant and principal component analysis

    Publication Year: 1988, Page(s):978 - 983
    Cited by:  Papers (121)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    A general method is proposed to describe multivariate data sets using discriminant analysis and principal-component analysis. First, the problem of finding K discriminant vectors in an L-class data set is solved and compared to the solution proposed in the literature for two-class problems and the classical solution for L-class data sets. It is shown that the method prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2-D invariant object recognition using distributed associative memory

    Publication Year: 1988, Page(s):811 - 821
    Cited by:  Papers (62)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB)

    Complex-log conformal mapping is combined with a distributed associative memory to create a system that recognizes objects regardless of changes in rotation or scale. Information recalled from the memorized database is used to classify an object, reconstruct the memorized version of the object, and estimate the magnitude of changes in scale or rotation. The system response is resistant to moderate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of the octree approximating a three-dimensional object by using multiple views

    Publication Year: 1988, Page(s):769 - 782
    Cited by:  Papers (33)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    A fast, efficient, algorithm that processes polyhedral cones from views of an object to produce an octree representation of the object is proposed. A polyhedral cone defined by both a viewpoint and a polygonal contour of the object in the image for each view always contains the object. Thus the common region of the cones for multiple views is considered to be an approximating one of the object. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the number of digital straight line segments

    Publication Year: 1988, Page(s):880 - 887
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    A closed-form expression has been reported in the literature for LN, the number of digital line segments of length N that correspond to lines of the form y=ax+β, O⩽α, β<1. The authors prove an asymptotic estimate for LN that might prove useful for many applications, namely, LN=N <... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On smoothness of a vector field-application to optical flow

    Publication Year: 1988, Page(s):943 - 949
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Two measures of smoothness of a vector field over a domain are suggested, together with associated smoothing operators that satisfy given constrains. The technique is illustrated using operators that smooth the invariants of optical flow curl and divergence, estimated from intensity profiles of moving nondeformable objects. The operators have been applied with satisfactory results to derived flow ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One-dimensional regularization with discontinuities

    Publication Year: 1988, Page(s):822 - 829
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    Regularization is equivalent to fitting smoothing splines to the data so that efficient and reliable numerical algorithms exist for finding solutions. however, the results exhibit poor performance along edges and boundaries. To cope with such anomalies, a more general class of smoothing splines that preserve corners and discontinuities is studied. Cubic splines are investigated in detail, since th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for attribute selection in inductive learning systems

    Publication Year: 1988, Page(s):888 - 896
    Cited by:  Papers (34)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    A computable measure was developed that can be used to discriminate between attributes on the basis of their potential value in the formation of decision rules by the inductive learning process. This relevance measure is the product of extensions to an information-theoretic foundation that address the particular characteristics of a class of inductive learning algorithms. The measure is also conce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pessimal guesses may be optimal: a counterintuitive search result

    Publication Year: 1988, Page(s):949 - 955
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A particular style of search is considered that is motivated by the problem of reconstructing the surface of three-dimensional objects given a collection of planar contours representing cross-sections through the objects. An improvement on the simple divide-and-conquer method is presented. The key idea is to locate bottlenecks (minimal separators), which markedly reduces the number of searches req... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning based on conceptual distance

    Publication Year: 1988, Page(s):897 - 909
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB)

    An approach to concept learning from examples and concept learning by observation is presented that is based on a intuitive notion of conceptual distance between examples (concepts) and combines symbolical and numerical methods. The approach is based on the observation that very different examples generalize to an expression that is very far from each of them, while identical examples generalize t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quadtree traversal algorithms for pointer-based and depth-first representations

    Publication Year: 1988, Page(s):955 - 960
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Simple top-down pointer-based quadtree traversal algorithms for four-neighbor traversal, eight-neighbor traversal, and connected-component labeling are proposed. It is shown that for this class of algorithms there exist efficient pointer-based representations that can require as little as 2N bytes, where N is total number of nodes in the tree. The algorithms can also be implement... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust algorithm for text string separation from mixed text/graphics images

    Publication Year: 1988, Page(s):910 - 918
    Cited by:  Papers (285)  |  Patents (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The development and implementation of an algorithm for automated text string separation that is relatively independent of changes in text font style and size and of string orientation are described. It is intended for use in an automated system for document analysis. The principal parts of the algorithm are the generation of connected components and the application of the Hough transform in order ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An insight into the entropy and redundancy of the English dictionary

    Publication Year: 1988, Page(s):960 - 970
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    The inherent statistical characteristics, including the economy, entropy, and redundancy, of a very large set containing 93681 words from the Shorter Oxford English Dictionary is investigated. Analytical n -gram statistics are also presented for applications in natural language understanding, text processing, test compression, error detection and correction, and speech synthesis and recog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A spatial thresholding method for image segmentation

    Publication Year: 1988, Page(s):919 - 927
    Cited by:  Papers (95)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    Several model-based algorithms for threshold selection are presented, concentrating on the two-population univariate case in which an image contains an object and background. It is shown how the main ideas behind two important nonspatial thresholding algorithms follow from classical discriminant analysis. Novel thresholding algorithms that make use of available local/spatial information are then g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mode detection by relaxation

    Publication Year: 1988, Page(s):970 - 978
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    A relaxation process is described and applied to the detection of the modes of the underlying probability density function for clustering multidimensional data. When the process is iterated, the label probabilities become very high in the modal region and very low in the valleys, so that mode detection becomes trivial 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
Sven Dickinson
University of Toronto
e-mail: sven@cs.toronto.edu