By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 2 • Feb. 1989

Filter Results

Displaying Results 1 - 12 of 12
  • Stereo error detection, correction, and evaluation

    Publication Year: 1989, Page(s):113 - 120
    Cited by:  Papers (49)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (842 KB)

    An algorithm is presented for error detection and correction of disparity, as a process separate from stereo matching, with the contention that matching is not necessarily the best way to utilize all the physical constraints characteristic to stereopsis. As a result of the bias in stereo research towards matching, vision tasks like surface interpolation and object modeling have to accept erroneous... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Surfaces from stereo: integrating feature matching, disparity estimation, and contour detection

    Publication Year: 1989, Page(s):121 - 136
    Cited by:  Papers (192)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2151 KB)

    An approach is described that integrates the processes of feature matching, contour detection, and surface interpolation to determine the three-dimensional distance, or depth, of objects from a stereo pair of images. Integration is necessary to ensure that the detected surfaces are smooth. Surface interpolation takes into account detected occluding and ridge contours in the scene; interpolation is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating octrees from object silhouettes in orthographic views

    Publication Year: 1989, Page(s):137 - 149
    Cited by:  Papers (56)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1322 KB)

    An algorithm to construct the octree representation of a three-dimensional object from silhouette images of the object is described. The images must be obtained from thirteen viewing directions corresponding to the three face views, six edge views, and four corner views of an upright cube. These views where chosen because they provide a simple relationship between pixels in the image and the octan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchy in picture segmentation: a stepwise optimization approach

    Publication Year: 1989, Page(s):150 - 163
    Cited by:  Papers (154)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1467 KB)

    A segmentation algorithm based on sequential optimization which produces a hierarchical decomposition of the picture is presented. The decomposition is data driven with no restriction on segment shapes. It can be viewed as a tree, where the nodes correspond to picture segments and where links between nodes indicate set inclusions. Picture segmentation is first regarded as a problem of piecewise pi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection, localization, and estimation of edges

    Publication Year: 1989, Page(s):191 - 198
    Cited by:  Papers (53)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1103 KB)

    A method to detect, locate, and estimate edges in a one-dimensional signal is presented. It is inherently more accurate than all previous schemes as it explicitly models and corrects interaction between nearby edges. The method is iterative with initial estimation of edges provided by the zero crossings of the signal convolved with Laplacian of Gaussian (LoG) filter. The necessary computations nec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric properties of the union of maximal neighborhoods

    Publication Year: 1989, Page(s):214 - 217
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (461 KB)

    The problem of computing area and perimeter of a digital figure presented by its discrete medial axis transform (MAT) is addressed. The figure is seen as the union of the square-shaped maximal neighborhoods centered on the local maxima of the MAT. The contribution given by each maximal neighborhood to figure area and perimeter is computed while tracing the MAT. Multiple overlaps among the maximal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On properties of discretized convex curves

    Publication Year: 1989, Page(s):217 - 223
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    The connection between a continuous convex curve and its discrete image is investigated using an appropriate definition of discrete convexity. It is shown that the discrete image of continuous convex curve may not be convex; however, its deviation from convexity (in the discrete definition) is bounded by a small constant. The actual pixel patterns that are obtained by discretizing convex curves ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image surface approximation with irregular samples

    Publication Year: 1989, Page(s):206 - 212
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    A method to approximate image surfaces using irregular samples is proposed. Experimental results show that a high compression ratio can be achieved for simple or complicated images. A method accounting for the three-dimensional effects is proposed as a way of selecting the irregular samples from the image. Approximation spline knots are chosen along the contours, and the knot replacement is sensit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Where and why local shading analysis works

    Publication Year: 1989, Page(s):198 - 206
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    An apparent contradiction in the shape-from-shading literature is examined. Although practical experience suggests that shape can be inferred from the local analysis of shading, mathematical analyses support the opposite. A criterion for exact surface recovery is derived, and it is shown that, as a result of surface geometry, elliptic, hyperbolic, and doubly curved surfaces could be recovered to r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bibliography on digital and computational convexity (1961-1988)

    Publication Year: 1989, Page(s):181 - 190
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    A bibliography of 370 references of books, papers in serial journals, and conference papers, on convexity in relation to computer science is presented. The subject is divided into five topics: (1) convexity and straightness in digital images; (2) convex hull algorithms and their complexity; (3) other computational problems related to convexity; (4) miscellaneous applications; and (5) general mathe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On computing complete histograms of images in log (n) steps using hypercubes

    Publication Year: 1989, Page(s):212 - 213
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    An algorithm for the computation of the histogram of limited-width (such as gray-level) values on a SIMD (single-instructions multiple-data) hypercube multiprocessor is proposed, which does not require the use of a general interconnection capability such as that on the connection machine. The computation of the complete histogram of n such values takes place in a series of log n ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A renormalization group approach to image processing problems

    Publication Year: 1989, Page(s):164 - 180
    Cited by:  Papers (106)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1604 KB)

    A method for studying problems in digital image processing, based on a combination of renormalization group ideas, the Markov random-field modeling of images, and metropolis-type Monte Carlo algorithms, is presented. The method is efficiently implementable on parallel architectures, and provides a unifying procedure for performing a hierarchical, multiscale, coarse-to-fine analysis of image-proces... 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