Computer Vision and Pattern Recognition, 1989. Proceedings CVPR '89., IEEE Computer Society Conference on

4-8 June 1989

Filter Results

Displaying Results 1 - 25 of 97
  • Edge detection, classification, and measurement

    Publication Year: 1989, Page(s):2 - 10
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (622 KB)

    An edge detector is proposed which consists of a pair of a pattern and a linear filter. It is shown that for an edge in the input signal, there is a scaled pattern in the filter response. The location of the pattern is the location of the edge, and the scaling factor of the pattern is the size of the edge. Therefore the problem of edge detection and measurement is reduced to searching for the (sca... View full abstract»

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

    Publication Year: 1989, Page(s):11 - 18
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    A robust edge-detection algorithm which performs equally under a wide variety of noisy situations and a broad range of edges is described. The algorithm is executed in three phases. In phase 1, the step and linear edges are detected from the noise-corrupted image using a statistical classification technique. In phase 2, all the thin-line edges (i.e. which are lines less than two pixels wide) are d... View full abstract»

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

    Publication Year: 1989, Page(s):19 - 27
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (906 KB)

    The problem of reinforcing local evidence of edges while suppressing unwanted information in noisy images is considered using a form of relaxation labeling. The methodology is based on parameterizing a continuous set of edge orientation labels using a single vector. A sigmoidal thresholding function similar to that used in artificial neural networks to bias neighborhood-influence and insure conver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3D edge detection using recursive filtering: application to scanner images

    Publication Year: 1989, Page(s):28 - 35
    Cited by:  Papers (23)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (545 KB)

    A novel algorithm for three-dimensional edge detection is proposed. This method is an extension to the 3D case of the optimal 2D edge detector recently introduced by R. Deriche (1987). The authors present better theoretical and experimental performances than some classical approaches used previously. Experimental results obtained on magnetic-resonance images and on echographic images are shown. It... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of photometric stereo for a general class of reflectance maps

    Publication Year: 1989, Page(s):38 - 45
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    The authors present the main results of a theory of photometric stereo for non-Lambertian surfaces. First, they propose a class of reflectance maps that can be used for a realistic representation of real-world reflection. Second, they ask how many light sources are needed for inverting this class of reflectance maps. It is shown that three light sources are sufficient for a globally unique inversi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape understanding from Lambertian photometric flow fields

    Publication Year: 1989, Page(s):46 - 52
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (613 KB)

    A novel idea for the analysis of shape from reflectance maps is introduced. It is shown that local surface orientation and curvature constraints can be obtained at points on a smooth surface by computing the instantaneous rate of change of reflected scene radiance caused by angular variations in illumination geometry. The resulting instantaneous changes in image irradiance values across an optic s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for shape-from-shading using multiple images acquired under different viewing and lighting conditions

    Publication Year: 1989, Page(s):53 - 60
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (907 KB)

    A novel formulation for shape-from-shading from multiple images acquired under different viewing and lighting conditions is presented. The method is based on using an explicit image formation model to create renditions of the surface being estimated, which are synthetic versions of the observed images. It is applicable in a variety of imaging situations, including those involving unknown nonunifor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing oriented texture fields

    Publication Year: 1989, Page(s):61 - 68
    Cited by:  Papers (36)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    A novel algorithm for computing the orientation field for a flowlike texture is presented. The basic idea behind the algorithm is to use an oriented filter, namely the gradient of the Gaussian, and perform manipulations on the resulting gradient vector field. The most important aspect of the algorithm is that it is provably optimal in estimating the local orientations of an oriented texture. An ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adding scale to the primal sketch

    Publication Year: 1989, Page(s):70 - 78
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    The author shows how a scale dimension can be added to Marr's (1976) primal sketch to facilitate construction of multiscale descriptions of two-dimensional scales. In contrast to conventional scale-space approaches, this method omits any smoothing or blurring and performs grouping operations on symbolic shape tokens residing in a scale-space blackboard data structure. Two types of grouping operati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The trajectory primal sketch: a multi-scale scheme for representing motion characteristics

    Publication Year: 1989, Page(s):79 - 85
    Cited by:  Papers (18)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Conventional approaches to dynamic scene analysis do not use motion itself explicitly for recognition. The authors propose a different approach for the use of motion in a computer vision system which uses the motion characteristics of moving objects without actually recovering the structure. In this approach, the extended trajectories followed by the objects are considered. It is argued that in ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cost minimization approach to edge detection using simulated annealing

    Publication Year: 1989, Page(s):86 - 91
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (479 KB)

    Edge detection is analyzed as a problem in cost minimization. A cost function is formulated that evaluates the quality of edge configurations. A mathematical description of edges is given, and the cost function is analyzed in terms of the characteristics of the edges in minimum-cost configurations. The cost function is minimized by the simulated annealing method. A novel set of strategies for gene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical approach to line extraction

    Publication Year: 1989, Page(s):92 - 97
    Cited by:  Papers (18)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (529 KB)

    An efficient method for finding straight lines in edge maps is described. The algorithm is based on a pyramid structure. At the bottom level of the pyramid, short line segments are detected by applying a Hough transform to small subimages. The algorithm proceeds, bottom up, from this low-level description by grouping line segments within the local neighborhoods into longer lines. Line segments whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parametrically deformable contour models

    Publication Year: 1989, Page(s):98 - 103
    Cited by:  Papers (41)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (375 KB)

    Segmentation using boundary finding is enhanced both by considering the boundary as a whole and by using model-based shape information. Flexible constraints, in the form of a probabilistic deformable model, are applied to the problem of segmenting natural objects whose diversity and irregularity of shape makes them poorly represented in terms of fixed features of forms. The parametric model is bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature extraction from faces using deformable templates

    Publication Year: 1989, Page(s):104 - 109
    Cited by:  Papers (225)  |  Patents (24)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (455 KB)

    A method for detecting and describing the features of faces using deformable templates is described. The feature of interest, an eye for example, is described by a parameterized template. An energy function is defined which links edges, peaks, and valleys in the image intensity to corresponding properties of the template. The template then interacts dynamically with the image, by altering its para... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On reliable curvature estimation

    Publication Year: 1989, Page(s):110 - 116
    Cited by:  Papers (101)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (558 KB)

    An empirical study of the accuracy of five different curvature estimation techniques, using synthetic range images and images obtained from three range sensors, is presented. The results obtained highlight the problems inherent in accurate estimation of curvatures, which are second-order quantities, and thus highly sensitive to noise contamination. The numerical curvature estimation methods are fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge recognition in dynamic vision

    Publication Year: 1989, Page(s):118 - 123
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (430 KB)

    Using a model of an edge's motion through a sequence of images, the problem of its localization can be formulated as a stochastic filtering problem. The extended Kalman filter for such a system is considered in detail and is shown to be interpretable as a sequence of oriented special convolutions. Results are presented which show that the edge localization obtained using this filter is substantial... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A contour-based recovery of image flow: iterative method

    Publication Year: 1989, Page(s):124 - 129
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (433 KB)

    The authors present an iterative algorithm for the recovery of 2D motion, i.e. an algorithm for the determination of a transformation which maps one image onto another. The local ambiguity in measuring the motion of contour segments (called the aperture problem) makes it necessary to rely on measurements along the normal direction. Since the measured normal flow itself does not agree with the actu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Region-based optical flow estimation

    Publication Year: 1989, Page(s):130 - 135
    Cited by:  Papers (22)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (671 KB)

    A correspondence method is developed for determining optical flow where the primitive motion tokens to be matched between consecutive time frames are regions. The computation of optical flow consists of three stages: region extraction, region matching, and optical flow smoothing. The computation is completed by smoothing the initial optical flow, where the sparse velocity data are either smoothed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nonlinear optimization algorithm for the estimation of structure and motion parameters

    Publication Year: 1989, Page(s):136 - 143
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (597 KB)

    A nonlinear least-squares optimization technique is proposed which uses the Levenberg-Marquardt method and estimates the motion and structure parameters to a global scale factor by minimizing an objective function. This objective function is the mean-square difference between the measured coordinates of feature points in the image plane and the coordinates predicted from the current state estimate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal motion and structure estimation

    Publication Year: 1989, Page(s):144 - 152
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (710 KB)

    The problem of estimating motion and structure of a rigid scene from two perspective monocular views is studied. The optimization approach presented is motivated by the following observations of linear algorithms: (1) for certain types of motion, even pixel-level perturbations (such as digitization noise) may override the information characterized by epipolar constraint; (2) existing linear algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knowledge-based approach to the detection, tracking and classification of target formations in infrared image sequences

    Publication Year: 1989, Page(s):153 - 158
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (463 KB)

    A knowledge-based approach to the detection, tracking, and classification of ground-based formations of point targets in sequences of digitized forward-looking infrared (FLIR) image sequences is presented. The system has two components: a point target detector and tracker (PTD) which processes the image sequences and supplies candidate point targets to the knowledge-based target formation detector... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data set for quantitative motion analysis

    Publication Year: 1989, Page(s):159 - 164
    Cited by:  Papers (26)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    The collection of image sequences for quantitative experiments in motion analysis is discussed. To assess the effectiveness of a motion algorithm it is necessary to obtain motion data with ground truth of known accuracy. The authors describe motion data collected using the imaging facilities provided by the autonomous land vehicle (ALV). A total of eight sequences of about 30 frames each were coll... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimal implementation of morphological operations on neighborhood connected array processors

    Publication Year: 1989, Page(s):166 - 171
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (439 KB)

    Neighborhood-connected array processors can implement Minkowski addition and Minkowski subtraction operations with structuring elements larger than the neighborhood size by breaking the operation into a sequence of successive neighborhood operations. The author provides a complete solution to the problem of decomposing convex polygons into subsets of the 3*3 neighborhood set. With the help of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The dual representation of gray-scale morphological filters

    Publication Year: 1989, Page(s):172 - 177
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (322 KB)

    One of the classic results of mathematical morphology is the filter-representation theorem of G. Matheron (1975) for black-and-white images. The theorem states that any morphological filter can be represented as a union of erosions by elements in the filter's kernel. In its dual form, it states that the erosion representation can be replaced by an intersection of dilations by elements of the dual ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image coding via morphological transformations: a general theory

    Publication Year: 1989, Page(s):178 - 183
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (414 KB)

    A general theory for the morphological representation of discrete and binary images is presented. The theory relies on the generation of a set of nonoverlapping segments of an image by repeated erosions and set transformations, which in turn produces a decomposition that guarantees exact reconstruction. The morphological image-representation transform and its properties are examined, with focus on... View full abstract»

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