2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.

18-20 June 2003

Go

Filter Results

Displaying Results 1 - 25 of 97
  • Proceedings 2003 IEEE Computer Society Conference On Computer Vision And Pattern Recognition

    Publication Year: 2003, Page(s):iii - xii
    Request permission for commercial reuse | PDF file iconPDF (327 KB)
    Freely Available from IEEE
  • Qualitative image based localization in indoors environments

    Publication Year: 2003, Page(s): II
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    Man made indoor environments possess regularities, which can be efficiently exploited in automated model acquisition by means of visual sensing. In this context we propose an approach for inferring a topological model of an environment from images or the video stream captured by a mobile robot during exploration. The proposed model consists of a set of locations and neighborhood relationships betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing layered surface representations: an algorithm for detecting and separating transparent overlays

    Publication Year: 2003, Page(s):II - 11
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1095 KB) | HTML iconHTML

    The biological visual system possesses the ability to compute layered surface representations, in which one surface is represented as being viewed through another. This ability is remarkable because, in scenes involving transparency, the link between surface topology and image topology is greatly complicated by the collapse of the photometric contributions of two distinct surfaces onto image inten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On region merging: the statistical soundness of fast sorting, with applications

    Publication Year: 2003, Page(s):II - 19
    Cited by:  Papers (16)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 KB) | HTML iconHTML

    This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions. We exhibit a particular blend of algorithmics and statistics whose error is, as we formally show, close to the best possible. This approach can be approximated in a very fast segmentation algorithm for processing images... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perception-based 3D triangle mesh segmentation using fast marching watersheds

    Publication Year: 2003, Page(s): II
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB) | HTML iconHTML

    In this paper, we describe an algorithm called fast marching watersheds that segments a triangle mesh into visual parts. This computer vision algorithm leverages a human vision theory known as the minima rule. Our implementation computes the principal curvatures and principal directions at each vertex of a mesh, and then our hill-climbing watershed algorithm identifies regions bounded by contours ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range image segmentation by surface extraction using an improved robust estimator

    Publication Year: 2003, Page(s):II - 33
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB) | HTML iconHTML

    The paper presents a novel range image segmentation algorithm based on planar surface extraction. The algorithm was applied to common range image databases and was favorably compared against seven other segmentation algorithms using a popular evaluation framework. The experimental results show that, as compared to the other methods, our algorithm presents a good performance in preserving small reg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning affinity functions for image segmentation: combining patch-based and gradient-based approaches

    Publication Year: 2003, Page(s):II - 54
    Cited by:  Papers (62)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1149 KB) | HTML iconHTML

    The paper studies the problem of combining region and boundary cues for natural image segmentation. We employ a large database of manually segmented images in order to learn an optimal affinity function between pairs of pixels. These pairwise affinities can then be used to cluster the pixels into visually coherent groups. Region cues are computed as the similarity in brightness, color, and texture... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Background subtraction based on cooccurrence of image variations

    Publication Year: 2003, Page(s): II
    Cited by:  Papers (78)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (654 KB) | HTML iconHTML

    This paper presents a novel background subtraction method for detecting foreground objects in dynamic scenes involving swaying trees and fluttering flags. Most methods proposed so far adjust the permissible range of the background image variations according to the training samples of background images. Thus, the detection sensitivity decreases at those pixels having wide permissible ranges. If we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of local models of dynamic backgrounds

    Publication Year: 2003, Page(s):II - 73
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (553 KB) | HTML iconHTML

    Background subtraction is the first step of many video surveillance applications. What is considered background varies by application, and may include regular, systematic, or complex motions. The paper explores the use of several different local spatio-temporal models of a background, defined at each pixel in the image. We present experiments with real image data and conclude that appropriate loca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolvable visual commercial detector

    Publication Year: 2003, Page(s): II
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2981 KB)

    Commercial detection plays an important role in various video segmentation and indexing applications. It provides high-level program segmentation so that other algorithms can be applied on the true program material in the broadcast. It is a challenge to have robust commercial detection methodology for various platforms, content formats, and broadcast styles that are used all over the world. Wide d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Establishment shot detection using qualitative motion

    Publication Year: 2003, Page(s): II
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (865 KB) | HTML iconHTML

    In this paper, we developed a technique to detect a special kind of shot, namely establishment shot, which is used to introduce a new scene to the audience or remind the audience of a known environment. The detection of establishment shot aids in various middle-level issues such as analyzing the story units of a movie. An establishment shot is usually realized by using camera motions such as panni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilinear subspace analysis of image ensembles

    Publication Year: 2003, Page(s):II - 93
    Cited by:  Papers (132)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (785 KB) | HTML iconHTML

    Multilinear algebra, the algebra of higher-order tensors, offers a potent mathematical framework for analyzing ensembles of images resulting from the interaction of any number of underlying factors. We present a dimensionality reduction algorithm that enables subspace analysis within the multilinear framework. This N-mode orthogonal iteration algorithm is based on a tensor decomposition known as t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification based on symmetric maximized minimal distance in subspace (SMMS)

    Publication Year: 2003, Page(s):II - 100
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    We introduce a new classification algorithm based on the concept of symmetric maximized minimal distance in subspace (SMMS). Given the training data of authentic samples and imposter samples in the feature space, SMMS tries to identify a subspace in which all the authentic samples are close to each other and all the imposter samples are far away from the authentic samples. The optimality of the su... View full abstract»

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

    Publication Year: 2003, Page(s):II - 106
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (462 KB) | HTML iconHTML

    When performing subspace modeling of data using principal component analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the problem being investigated. This need arises due to the data often being approximately isotropic along the lesser principal components, making the choice of directions for these components more-or-less arbitrary. Furtherm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical non-parametric density estimation on a transformation group for vision

    Publication Year: 2003, Page(s):II - 114
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (394 KB) | HTML iconHTML

    It is now common practice in machine vision to define the variability in an object's appearance in a factored manner, as a combination of shape and texture transformations. In this context, we present a simple and practical method for estimating non-parametric probability densities over a group of linear shape deformations. Samples drawn from such a distribution do not lie in a Euclidean space, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General c-means clustering model and its application

    Publication Year: 2003, Page(s): II
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (391 KB) | HTML iconHTML

    Many partitional clustering algorithms originated from the definition of mean.We propose a new clustering model - general c-means clustering algorithm (GCM). Generally, when the data set is clustered into c (c > 1) subsets, each subset is often expected to have a different prototype (or cluster center) than others. Therefore, we propose the definition of undesirable solution of clustering algor... View full abstract»

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

    Publication Year: 2003, Page(s): II
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an information-theoretical framework; mutual information is the underlying concept used in the definition of quantitative measures of agreement or consistency between data partitions. Robustness is assessed by variance of th... View full abstract»

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

    Publication Year: 2003, Page(s):II - 137
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1643 KB) | HTML iconHTML

    We present a simple and efficient algorithm for modifying the temporal behavior of "dynamic textures," i.e. sequences of images that exhibit some form of temporal regularity, such as flowing water, steam, smoke, flames, foliage of trees in wind. The main goal is to design algorithms for synthesizing and editing realistic sequences of images of dynamic scenes that exhibit some form of temporal stat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Example-based style synthesis

    Publication Year: 2003, Page(s):II - 143
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1034 KB) | HTML iconHTML

    We introduce an example-based synthesis technique that extrapolates novel styles for a given input image. The technique is based on separating the style and content of image fragments. Given an image with a new style and content, it is first adaptively partitioned into fragments. Stitching together novel fragments produces a coherent image in a new style for a given content. The aggregate of synth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape-time photography

    Publication Year: 2003, Page(s): II
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (651 KB) | HTML iconHTML

    We introduce a new method to describe shape relationships over time in a photograph. We acquire both range and image information in a sequence of frames using a stationary stereo camera. From the pictures taken, we compute a composite image consisting of the pixels from the surfaces closest to the camera over all the time frames. Through occlusion cues, this composite reveals 3-D relationships bet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Face relighting with radiance environment maps

    Publication Year: 2003, Page(s):II - 158
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (679 KB) | HTML iconHTML

    A radiance environment map pre-integrates a constant surface reflectance with the lighting environment. It has been used to generate photo-realistic rendering at interactive speed. However, one of its limitations is that each radiance environment map can only render the object, which has the same surface reflectance as what it integrates. We present a ratio-image based technique to use a radiance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic relighting of overlapping textures of a 3D model

    Publication Year: 2003, Page(s):II - 166
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (483 KB) | HTML iconHTML

    The paper presents a new method to correct overlapping textures of a single 3D model where each texture was obtained under possibly different lighting conditions and color response of the camera. This situation arises frequently when a single object is digitized using multiple 3D scanners. Our goal is to remove any visible seam and improve color consistency between the textures in order to merge t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating surface characteristics using physical reflectance models

    Publication Year: 2003, Page(s):II - 177
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    We make use of the Beckmann-Kirchhoff and Davies scattering models to estimate surface properties for both dielectric and metallic surfaces based on reflectance measurements. In the case of metallic surfaces, we consider two refinements of the Davies theory, which apply under different restrictions concerning the reflectance geometry. The first of these is due to Bennett and Porteus (1961) and app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-dimensional representations of shaded surfaces under varying illumination

    Publication Year: 2003, Page(s): II
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (367 KB) | HTML iconHTML

    The aim of this paper is to find the best representation for the appearance of surfaces with Lambertian reflectance under varying illumination. Previous work using principal component analysis (PCA) found the best sub-space to represent all images of an object under a varying point light source. We extend this to images from any illumination distribution. Specifically we calculate the bases for al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient solution to the five-point relative pose problem

    Publication Year: 2003, Page(s):II - 195
    Cited by:  Papers (90)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB) | HTML iconHTML

    An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degree polynomial and subsequently finding its roots. It is the first algorithm well suited for numeric... View full abstract»

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