By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 2 • Feb. 1990

Filter Results

Displaying Results 1 - 11 of 11
  • Comments on "A three-module strategy for edge detection" [with reply]

    Publication Year: 1990, Page(s):223 - 224
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (165 KB)

    Comments are made on the above named work by V. Lacroix (see ibid., vol.10, no.6, p.803-10, 1988). The commenters contend that the proposed orthogonal bases are the same as the edge subspace bases in the approach of W. Frei and C.C. Chen (IEEE Trans. Comput., vol.C-26, no.10, p.988-98, 1977) and that the ratio for detecting edges is the same as that proposed by Frei and Chen for special cases. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge-labeling using dictionary-based relaxation

    Publication Year: 1990, Page(s):165 - 181
    Cited by:  Papers (63)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1440 KB)

    An improved application of probabilistic relaxation to edge labeling is presented. The improvement derives from the use of a representation of the edge process that is internally consistent and which utilizes a more complex description of edge structure. The application uses a dictionary to represent permitted labelings of the entire context-conveying neighborhood of each pixel. Details are given ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovery of parametric models from range images: the case for superquadrics with global deformations

    Publication Year: 1990, Page(s):131 - 147
    Cited by:  Papers (323)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1488 KB)

    A method for recovery of compact volumetric models for shape representation of single-part objects in computer vision is introduced. The models are superquadrics with parametric deformations (bending, tapering, and cavity deformation). The input for the model recovery is three-dimensional range points. Model recovery is formulated as a least-squares minimization of a cost function for all range po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Texture segmentation using Voronoi polygons

    Publication Year: 1990, Page(s):211 - 216
    Cited by:  Papers (83)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Textures are defined in terms of primitives called tokens. A texture segmentation algorithm based on the Voronoi tessellation is discussed. The algorithm first builds the Voronoi tessellation of the tokens that make up the textured image. It then computes a feature vector for each Voronoi polygon. These feature vectors are used in a probabilistic relaxation labeling on the tokens, to identify the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing the aspect graph for line drawings of polyhedral objects

    Publication Year: 1990, Page(s):113 - 122
    Cited by:  Papers (68)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    An algorithm for computing the aspect graph for polyhedral objects is described. The aspects graph is a representation of three-dimensional objects by a set of two-dimensional views. The set of viewpoints on the Gaussian sphere is partitioned into regions such that in each region the qualitative structure of the line drawing remains the same. At the boundaries between adjacent regions are the acci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expected-outcome: a general model of static evaluation

    Publication Year: 1990, Page(s):182 - 193
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1216 KB)

    The expected-outcome model, in which the proper evaluation of a game-tree node is the expected value of the game's outcome given random play from that node on, is proposed. Expected outcome is considered in its ideal form, where it is shown to be a powerful heuristic. The ability of a simple random sampler that estimates expected outcome to outduel a standard Othello evaluator is demonstrated. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range image acquisition with a single binary-encoded light pattern

    Publication Year: 1990, Page(s):148 - 164
    Cited by:  Papers (127)  |  Patents (82)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1776 KB)

    The problem of strike identification in range image acquisition systems based on triangulation with periodically structured illumination is discussed. A coding scheme is presented based on a single fixed binary encoded illumination pattern, which contains all the information required to identify the individual strikes visible in the camera image. Every sample point indicated by the light pattern i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast parallel algorithm for blind estimation of noise variance

    Publication Year: 1990, Page(s):216 - 223
    Cited by:  Papers (59)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    A blind noise variance algorithm that recovers the variance of noise in two steps is proposed. The sample variances are computed for square cells tessellating the noise image. Several tessellations are applied with the size of the cells increasing fourfold for consecutive tessellations. The four smallest sample variance values are retained for each tessellation and combined through an outlier anal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effectively labeling planar projections of polyhedra

    Publication Year: 1990, Page(s):123 - 130
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    A well-known method for interpreting planar projections (images) of three-dimensional polyhedra is to label their lines by the Clowes-Huffman scheme. However, the question of whether there is such a labeling has been shown to be NP-complete. A linear-in-time algorithm is given that answers the labelability question under the assumption that some information is known about those edges of the polyhe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system design/scheduling strategy for parallel image processing

    Publication Year: 1990, Page(s):194 - 204
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    A system design/scheduling strategy is described for a real-time parallel image processing system. A parallel image processing model based on the spatial and temporal parallelisms extractable in image processing tasks is formulated. This model consists of linear pipeline stages, each of which is a multiprocessing module. The strategy is discussed for two cases: static and dynamic. The description ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern representations and syntactic classification of radar measurements of commercial aircraft

    Publication Year: 1990, Page(s):204 - 211
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    A syntactic pattern recognition system is evaluated for applications to radar signal identification. Three different level-crossing-based pattern representation algorithms are considered. The utility of the resulting symbolic pattern representations is assessed by evaluating the performance of a maximum-likelihood classifier when the observed symbol strings are used as inputs to the decision algor... 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