By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 12 • Date Dec. 2005

Filter Results

Displaying Results 1 - 21 of 21
  • [Front cover]

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (137 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • Autocalibration of a projector-camera system

    Publication Year: 2005, Page(s):1845 - 1855
    Cited by:  Papers (15)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (769 KB) | HTML iconHTML

    This paper presents a method for calibrating a projector-camera system that consists of multiple projectors (or multiple poses of a single projector), a camera, and a planar screen. We consider the problem of estimating the homography between the screen and the image plane of the camera or the screen-camera homography, in the case where there is no prior knowledge regarding the screen surface that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified k-means algorithm for circular invariant clustering

    Publication Year: 2005, Page(s):1856 - 1865
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1081 KB) | HTML iconHTML

    Several important pattern recognition applications are based on feature vector extraction and vector clustering. Directional patterns are commonly represented by rotation-variant vectors Fd formed from features uniformly extracted in M directions. It is often desirable that pattern recognition algorithms are invariant under pattern rotation. This paper introduces a distance measure and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering ensembles: models of consensus and weak partitions

    Publication Year: 2005, Page(s):1866 - 1881
    Cited by:  Papers (128)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1602 KB) | HTML iconHTML

    Clustering ensembles have emerged as a powerful method for improving both the robustness as well as the stability of unsupervised classification solutions. However, finding a consensus clustering from multiple partitions is a difficult problem that can be approached from graph-based, combinatorial, or statistical perspectives. This study extends previous research on clustering ensembles in several... View full abstract»

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

    Publication Year: 2005, Page(s):1882 - 1895
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1568 KB) | HTML iconHTML

    This work presents categorization experiments performed over noisy texts. By noisy, we mean any text obtained through an extraction process (affected by errors) from media other than digital texts (e.g., transcriptions of speech recordings extracted with a recognition system). The performance of a categorization system over the clean and noisy (word error rate between ∼ 10 and ∼ 50 percent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matching shape sequences in video with applications in human movement analysis

    Publication Year: 2005, Page(s):1896 - 1909
    Cited by:  Papers (149)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    We present an approach for comparing two sequences of deforming shapes using both parametric models and nonparametric methods. In our approach, Kendall's definition of shape is used for feature extraction. Since the shape feature rests on a non-Euclidean manifold, we propose parametric models like the autoregressive model and autoregressive moving average model on the tangent space and demonstrate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing and capturing articulated hand motion in image sequences

    Publication Year: 2005, Page(s):1910 - 1922
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1037 KB) | HTML iconHTML

    Capturing the human hand motion from video involves the estimation of the rigid global hand pose as well as the nonrigid finger articulation. The complexity induced by the high degrees of freedom of the articulated hand challenges many visual tracking techniques. For example, the particle filtering technique is plagued by the demanding requirement of a huge number of particles and the phenomenon o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple paths extraction in images using a constrained expanded trellis

    Publication Year: 2005, Page(s):1923 - 1933
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1787 KB) | HTML iconHTML

    Single shortest path extraction algorithms have been used in a number of areas such as network flow and image analysis. In image analysis, shortest path techniques can be used for object boundary detection, crack detection, or stereo disparity estimation. Sometimes one needs to find multiple paths as opposed to a single path in a network or an image where the paths must satisfy certain constraints... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Where are linear feature extraction methods applicable?

    Publication Year: 2005, Page(s):1934 - 1944
    Cited by:  Papers (74)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (621 KB) | HTML iconHTML

    A fundamental problem in computer vision and pattern recognition is to determine where and, most importantly, why a given technique is applicable. This is not only necessary because it helps us decide which techniques to apply at each given time. Knowing why current algorithms cannot be applied facilitates the design of new algorithms robust to such problems. In this paper, we report on a theoreti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized principal component analysis (GPCA)

    Publication Year: 2005, Page(s):1945 - 1959
    Cited by:  Papers (176)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (863 KB) | HTML iconHTML

    This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represent the subspaces with a set of homogeneous polynomials whose degree is the number of subspaces and whose derivatives at a data point give normal vectors to the subspace passing through the point. When the number of subspa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration of geometric elements, Euclidean relations, and motion curves for parametric shape and motion estimation

    Publication Year: 2005, Page(s):1960 - 1976
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1594 KB) | HTML iconHTML

    This paper presents an approach to shape and motion estimation that integrates heterogeneous knowledge into a unique model-based framework. We describe the observed scenes in terms of structured geometric elements (points, line segments, rectangles, 3D corners) sharing explicitly Euclidean relationships (orthogonality, parallelism, colinearity, coplanarity). Camera trajectories are represented wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective representation using ICA for face recognition robust to local distortion and partial occlusion

    Publication Year: 2005, Page(s):1977 - 1981
    Cited by:  Papers (47)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1011 KB) | HTML iconHTML

    The performance of face recognition methods using subspace projection is directly related to the characteristics of their basis images, especially in the cases of local distortion or partial occlusion. In order for a subspace projection method to be robust to local distortion and partial occlusion, the basis images generated by the method should exhibit a part-based local representation. We propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Face recognition using face-ARG matching

    Publication Year: 2005, Page(s):1982 - 1988
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (833 KB) | HTML iconHTML

    In this paper, we propose a novel line feature-based face recognition algorithm. A face is represented by the face-ARG model, where all the geometric quantities and the structural information are encoded in an attributed relational graph (ARG) structure, then the partial ARG matching is done for matching face-ARG's. Experimental results demonstrate that the proposed algorithm is quite robust to va... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theoretical bounds of majority voting performance for a binary classification problem

    Publication Year: 2005, Page(s):1988 - 1995
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1343 KB) | HTML iconHTML

    A number of earlier studies that have attempted a theoretical analysis of majority voting assume independence of the classifiers. We formulate the majority voting problem as an optimization problem with linear constraints. No assumptions on the independence of classifiers are made. For a binary classification problem, given the accuracies of the classifiers in the team, the theoretical upper and l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient method for the computation of Legendre moments

    Publication Year: 2005, Page(s):1996 - 2002
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB) | HTML iconHTML

    Legendre moments are continuous moments, hence, when applied to discrete-space images, numerical approximation is involved and error occurs. This paper proposes a method to compute the exact values of the moments by mathematically integrating the Legendre polynomials over the corresponding intervals of the image pixels. Experimental results show that the values obtained match those calculated theo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers for Special Issue on Biometrics: Progress and Directions

    Publication Year: 2005, Page(s): 2003
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • [Advertisement]

    Publication Year: 2005, Page(s): 2004
    Request permission for commercial reuse | PDF file iconPDF (347 KB)
    Freely Available from IEEE
  • Annual index

    Publication Year: 2005, Page(s): Not in print
    Request permission for commercial reuse | PDF file iconPDF (366 KB)
    Freely Available from IEEE
  • TPAMI Information for authors

    Publication Year: 2005, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2005, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (137 KB)
    Freely Available from IEEE

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