Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

Object recognition supported by user interaction for service robots

11-15 Aug. 2002

Go

Filter Results

Displaying Results 1 - 25 of 95
  • Classification using a hierarchical Bayesian approach

    Publication Year: 2002, Page(s):103 - 106 vol.4
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    A key problem faced by classifiers is coping with styles not represented in the training set. We present an application of hierarchical Bayesian methods to the problem of recognizing degraded printed characters in a variety of fonts. The proposed method works by using training data of various styles and classes to compute prior distributions on the parameters for the class conditional distribution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of centroid-based, neighborhood-based and statistical approaches for effective document categorization

    Publication Year: 2002, Page(s):235 - 238 vol.4
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    Associating documents to relevant categories is critical for effective document retrieval. Here, we compare the well-known k-nearest neighborhood (kNN) algorithm, the centroid-based classifier and the highest average similarity over retrieved documents (HASRD) algorithm, for effective document categorization. We use various measures such as the micro and macro F1 values to evaluate their performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings 16th International Conference on Pattern Recognition

    Publication Year: 2002, Page(s):iii - xi
    Request permission for commercial reuse | PDF file iconPDF (333 KB)
    Freely Available from IEEE
  • List of referees

    Publication Year: 2002, Page(s):xv - xvii
    Request permission for commercial reuse | PDF file iconPDF (132 KB)
    Freely Available from IEEE
  • Content based image retrieval using optimum Peano scan

    Publication Year: 2002, Page(s):130 - 133 vol.4
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (530 KB) | HTML iconHTML

    We present a new technique for content based image retrieval where feature vector to be matched is very much specific to the query image. A particular Peano scan which is optimal in encoding the query image is used to convert the scanning pattern of all database images. Features are derived from these scan converted images to calculate the similarity measure. As the features being query specific, ... View full abstract»

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

    Publication Year: 2002, Page(s):397 - 418
    Request permission for commercial reuse | PDF file iconPDF (1066 KB)
    Freely Available from IEEE
  • Curve morphing by weighted mean of strings

    Publication Year: 2002, Page(s):192 - 195 vol.4
    Cited by:  Papers (79)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    We propose an approach to curve morphing. We represent curves by strings, i.e. sequences of symbols. The curve morphing problem is formulated as that of, computing a weighted mean of two strings, which is then solved by a corresponding algorithm. Although only 2D curves are used in our experiments, the approach is applicable to curves in any dimension. Curve morphing has interesting applications i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A windowed weighted approach for approximate cyclic string matching

    Publication Year: 2002, Page(s):188 - 191 vol.4
    Cited by:  Papers (2)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, which are founded on a window-constrained edit graph related to the strings involved. Weights are the ones which minimize the sum of squared relative errors of the weighted solution with respect to exact values, on a traini... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast cyclic edit distance computation with weighted edit costs in classification

    Publication Year: 2002, Page(s):184 - 187 vol.4
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    Cyclic edit distances are a good measure of contour shapes dissimilarity. A branch and bound algorithm that speeds up the computation of cyclic edit distances with arbitrary weights for the edit operations is presented. The algorithm is modified to work with an external bound that further accelerates the computation when applied to classification problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new algorithm for inexact graph matching

    Publication Year: 2002, Page(s):180 - 183 vol.4
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (446 KB) | HTML iconHTML

    The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact graph matching is the process of finding the best possible matching between two graphs when exact matching is impossible. We propose a new algorithm for the inexact matching problem. The new algorithm decomposes the matchi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph-spectral approach to correspondence matching

    Publication Year: 2002, Page(s):176 - 179
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (454 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A discriminative learning criterion for the overall optimization of error and reject

    Publication Year: 2002, Page(s):98 - 102 vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (446 KB) | HTML iconHTML

    The minimum classification error (MCE) criterion has been commonly used for discriminative learning but there is intrinsic difficulty in applying it to gradient descent methods. As the complete description of classification performance is given by the error-reject tradeoff, we augment the MCE criterion not only to include but also reject errors and show that it leads to a smooth loss function whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmenting actions in velocity curve space

    Publication Year: 2002, Page(s):170 - 175 vol.4
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (693 KB) | HTML iconHTML

    Reliable segmentation of actions performed by objects, is critical to the understanding of semantic content in a video. Deciding which portion of object motion sequence is a distinct action unit, however, is often difficult, even for humans. We seem to hierarchically compose actions by noting characteristic changes in the nature of motion. This paper present an action segmentation algorithm that m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear and non-linear model for statistical localization of landmarks

    Publication Year: 2002, Page(s):393 - 396 vol.4
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    This paper presents and compares 3 methods for the statistical localization of partially occulted landmarks. In many real applications, some information is visible in images and some parts are missing or occulted. These parts are estimated by 3 statistical approaches: a rigid registration, a linear method derived from PCA, which represents spatial relationships, and a nonlinear model based upon ke... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • To each according to its need: kernel class specific classifiers

    Publication Year: 2002, Page(s):94 - 97 vol.4
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB) | HTML iconHTML

    We present in this paper a new multi-class Bayes classifier that permits using separate feature vectors, chosen specifically for each class. This technique extends previous work on feature class specific classifier to kernel methods, using a new class of Gibbs probability distributions with nonlinear kernel mapping as energy function. The resulting method, that we call kernel class specific classi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of two velocity profile models for rapid stroke analysis

    Publication Year: 2002, Page(s):52 - 55 vol.4
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    We compare two different models that can be used to describe velocity profiles of a handwritten stroke. The theoretical analysis and performance comparison on the fitting data figures and the mean square error clearly reflects the superiority of the delta lognormal model over the minimum jerk model to describe the velocity profile characterizing rapid movements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tetrahedron mapping of points from n-space to three-space

    Publication Year: 2002, Page(s):343 - 346 vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (462 KB) | HTML iconHTML

    We extend the triangulation method of Lee et al. (1977) and present a tetrahedron method for the sequential mapping of points in high-dimensional space into three-space. The three-space preserves distances among nodes of a tetrahedron. Whenever a new point is mapped, its distances to three points previously mapped are exactly preserved. Among these three points, one can be chosen as the point conn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Motion estimation and figure-ground segmentation using log-polar images

    Publication Year: 2002, Page(s):166 - 169 vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (427 KB) | HTML iconHTML

    A motion estimation algorithm for log-polar images, based on the general framework of Hager and Belhumeur (1998), is presented. The advantages and disadvantages brought by the use of this kind of foveal imaging are discussed. Within this context, a simple, but quite effective approach for figure-ground segmentation is also proposed. Performance results concerning motion estimation and target segme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assembly of puzzles using a genetic algorithm

    Publication Year: 2002, Page(s):389 - 392 vol.4
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (442 KB) | HTML iconHTML

    In this paper, we proposed a method for solving the rectangle piece jigsaw puzzle assembly problem. A shape of a piece is a rectangle, and a picture of a puzzle is only painted in black and white, i.e., puzzles are processed as binary images. The assembly of the puzzle is performed only using information of the pixel value on the border line of the pieces. This problem cannot be solved by the simp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Featureless 6 DOF pose refinement from stereo images

    Publication Year: 2002, Page(s):17 - 20 vol.4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB) | HTML iconHTML

    We present a pose estimation method from an initial unreliable guess using calibrated stereo images. The approach does not rely on a priori known salient features on the surface. The stereo images are brought in congruence without computing a disparity map like in standard stereo algorithms. Instead, the pose parameters of the object are varied to match the stereo images on the known surface shape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving classification rates by modelling the clusters of training sets in features space using mathematical morphology operators

    Publication Year: 2002, Page(s):90 - 93 vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB) | HTML iconHTML

    The exploration of features presented by the training sets of each class (size, shape and orientation) in order to construct the respective decision region borders without making explicitly any statistical hypothesis is presented in this paper. Its incorporation allows one to define more correct decision borders since there is a significant improvement in the classification rates obtained. Mathema... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Kalman filtering and mean shift for real time eye tracking under active IR illumination

    Publication Year: 2002, Page(s):318 - 321 vol.4
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB) | HTML iconHTML

    Most eye trackers based on active IR illumination require distinctive bright pupil effect to work well. In this paper, we present a new real time eye tracking methodology that works under variable and realistic lighting conditions and various face orientations. By combining the conventional appearance based object recognition method (SVM) and object tracking method (mean shift) with Kalman filteri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evaluation of the WPE algorithm using tangent distance

    Publication Year: 2002, Page(s):48 - 51 vol.4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    Weighting prototype editing (WPE) is a novel approach to editing a given set of prototypes so that the resulting set can outperform the original one in terms of the nearest neighbor (NN) classification accuracy. This technique is applied in this work along with an interesting dissimilarity measure between pixel maps, known as tangent distance (TD). Experiments on the USPS handwriting digits benchm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blur and affine moment invariants

    Publication Year: 2002, Page(s):339 - 342 vol.4
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB) | HTML iconHTML

    The paper is devoted to the recognition of objects and patterns deformed by imaging geometry as well as by unknown blurring. We introduce anew class of features invariant simultaneously to blurring by a centrosymmetric PSF and to affine transformation. As we prove in the paper they can be constructed by combining affine moment invariants and blur invariants derived earlier Combined invariants allo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context-based image modelling

    Publication Year: 2002, Page(s):162 - 165 vol.4
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (503 KB) | HTML iconHTML

    In this work we address the task of adapting the model representation of a given image, in the context of a second target image model. We present the BlobEMD framework, in which the images are represented as sets of blobs, and optimal correspondences are found between the representations of the images and are used to adapt the representation of the source image to that of the target image. The con... View full abstract»

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