By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 12 • Date Dec. 2002

Filter Results

Displaying Results 1 - 15 of 15
  • Author index

    Publication Year: 2002, Page(s):1679 - 1684
    Request permission for commercial reuse | PDF file iconPDF (227 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 2002, Page(s):1684 - 1695
    Request permission for commercial reuse | PDF file iconPDF (265 KB)
    Freely Available from IEEE
  • Exact two-image structure from motion

    Publication Year: 2002, Page(s):1618 - 1633
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4753 KB) | HTML iconHTML

    For two-image structure from motion, we present a simple, exact expression for a least-squares image-reprojection error for finite motion that depends only on the motion. Optimal estimates of the structure and motion can be computed by minimizing this expression just over the motion parameters. Also, we present a solution to the triangulation problem: an exact, explicit expression for the optimal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Input feature selection by mutual information based on Parzen window

    Publication Year: 2002, Page(s):1667 - 1671
    Cited by:  Papers (167)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (339 KB) | HTML iconHTML

    Mutual information is a good indicator of relevance between variables, and have been used as a measure in several feature selection algorithms. However, calculating the mutual information is difficult, and the performance of a feature selection algorithm depends on the accuracy of the mutual information. In this paper, we propose a new method of calculating mutual information between input and cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Substitution deciphering based on HMMs with applications to compressed document processing

    Publication Year: 2002, Page(s):1661 - 1666
    Cited by:  Papers (5)  |  Patents (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (554 KB) | HTML iconHTML

    It has been shown that simple substitution ciphers can be solved using statistical methods such as probabilistic relaxation. However, the utility of such solutions has been limited by their inability to cope with noise encountered in practical applications. We propose a new solution to substitution deciphering based on hidden Markov models. We show that our algorithm is more accurate than relaxati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stereo correspondence with compact windows via minimum ratio cycle

    Publication Year: 2002, Page(s):1654 - 1660
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1149 KB) | HTML iconHTML

    One of the earliest and still widely used methods for dense stereo correspondence is based on matching windows of pixels. The main difficulty of this method is choosing a window of appropriate size and shape. Small windows may lack sufficient intensity variation for reliable matching, while large windows smooth out disparity discontinuities. We propose an algorithm to choose a window size and shap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature space trajectory methods for active computer vision

    Publication Year: 2002, Page(s):1634 - 1643
    Cited by:  Papers (6)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (674 KB) | HTML iconHTML

    We advance new active object recognition algorithms that classify rigid objects and estimate their pose from intensity images. Our algorithms automatically detect if the class or pose of an object is ambiguous in a given image, reposition the sensor as needed, and incorporate data from multiple object views in determining the final object class and pose estimate. A probabilistic feature space traj... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rotation invariant rule-based thinning algorithm for character recognition

    Publication Year: 2002, Page(s):1672 - 1678
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    This paper presents a novel rule-based system for thinning. The unique feature that distinguishes our thinning system is that it thins symbols to their central lines. This means that the shape of the symbol is preserved. It also means that the method is rotation invariant. The system has 20 rules in its inference engine. These rules are applied simultaneously to each pixel in the image. Therefore,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the dependence of handwritten word recognizers on lexicons

    Publication Year: 2002, Page(s):1553 - 1564
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1141 KB) | HTML iconHTML

    The performance of any word recognizer depends on the lexicon presented. Usually, large lexicons or lexicons containing similar entries pose difficulty for recognizers. However, the literature lacks any quantitative methodology of capturing the precise dependence between word recognizers and lexicons. This paper presents a performance model that views word recognition as a function of character re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of some clustering algorithms and validity indices

    Publication Year: 2002, Page(s):1650 - 1654
    Cited by:  Papers (225)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four cluster validity indices, namely Davies-Bouldin index, Dunn's index, Calinski-Harabasz index, and a recently developed index I. Based on a relation between the index I and the Dunn's index, a lower bound of the value of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discriminant waveletfaces and nearest feature classifiers for face recognition

    Publication Year: 2002, Page(s):1644 - 1649
    Cited by:  Papers (168)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB) | HTML iconHTML

    Feature extraction, discriminant analysis, and classification rules are three crucial issues for face recognition. We present hybrid approaches to handle three issues together. For feature extraction, we apply the multiresolution wavelet transform to extract the waveletface. We also perform the linear discriminant analysis on waveletfaces to reinforce discriminant power. During classification, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying faces in a 2D line drawing representing a manifold object

    Publication Year: 2002, Page(s):1579 - 1593
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (618 KB) | HTML iconHTML

    A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objects belong to a class of common solids and most solid systems are based on manifold geometry. In this paper, a new method is proposed for finding faces from single 2D line drawings representing manifolds. The face identif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flux maximizing geometric flows

    Publication Year: 2002, Page(s):1565 - 1578
    Cited by:  Papers (121)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4241 KB) | HTML iconHTML

    Several geometric active contour models have been proposed for segmentation in computer vision and image analysis. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) under constraints from image forces so that it clings to features of interest in an intensity image. Recent variations on this theme take into account properties of enclosed regions and allow for multiple curves or s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three-dimensional topology preserving reduction on the 4-subfields

    Publication Year: 2002, Page(s):1594 - 1605
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (485 KB) | HTML iconHTML

    This paper discusses thinning on 3D binary images with the 4-subfield approach. Although a thinning algorithm concerns binary images, the algorithm itself can be represented as a set of three-color reduction templates. A thinning algorithm is topology preserving if the set of all three-color templates is topology preserving. Sufficient and necessary conditions of time complexity O(n) were proposed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient dilation, erosion, opening, and closing algorithms

    Publication Year: 2002, Page(s):1606 - 1617
    Cited by:  Papers (26)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1142 KB) | HTML iconHTML

    We propose an efficient and deterministic algorithm for computing the one-dimensional dilation and erosion (max and min) sliding window filters. For a p-element sliding window, our algorithm computes the 1D filter using 1.5 + o(1) comparisons per sample point. Our algorithm constitutes a deterministic improvement over the best previously known such algorithm, independently developed by van Herk (1... 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
David A. Forsyth
University of Illinois
e-mail: daf@illinois.edu