By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 6 • Date June 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (108 KB)
    Freely Available from IEEE
  • Introduction of New Associate Editors

    Publication Year: 2009, Page(s):961 - 963
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • The Best Bits in an Iris Code

    Publication Year: 2009, Page(s):964 - 973
    Cited by:  Papers (74)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2423 KB) | HTML iconHTML

    Iris biometric systems apply filters to iris images to extract information about iris texture. Daugman's approach maps the filter output to a binary iris code. The fractional Hamming distance between two iris codes is computed and decisions about the identity of a person are based on the computed distance. The fractional Hamming distance weights all bits in an iris code equally. However, not all t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistent Depth Maps Recovery from a Video Sequence

    Publication Year: 2009, Page(s):974 - 988
    Cited by:  Papers (113)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4130 KB) | HTML iconHTML

    This paper presents a novel method for recovering consistent depth maps from a video sequence. We propose a bundle optimization framework to address the major difficulties in stereo reconstruction, such as dealing with image noise, occlusions, and outliers. Different from the typical multi-view stereo methods, our approach not only imposes the photo-consistency constraint, but also explicitly asso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discriminant Saliency, the Detection of Suspicious Coincidences, and Applications to Visual Recognition

    Publication Year: 2009, Page(s):989 - 1005
    Cited by:  Papers (98)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4874 KB) | HTML iconHTML

    A discriminant formulation of top-down visual saliency, intrinsically connected to the recognition problem, is proposed. The new formulation is shown to be closely related to a number of classical principles for the organization of perceptual systems, including infomax, inference by detection of suspicious coincidences, classification with minimal uncertainty, and classification with minimum proba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Geodesics and Shortest Paths on Polyhedral Surfaces

    Publication Year: 2009, Page(s):1006 - 1016
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB) | HTML iconHTML Multimedia Media

    We present two algorithms for computing distances along convex and non-convex polyhedral surfaces. The first algorithm computes exact minimal-geodesic distances and the second algorithm combines these distances to compute exact shortest-path distances along the surface. Both algorithms have been extended to compute the exact minimal-geodesic paths and shortest paths. These algorithms have been imp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kernel Discriminant Analysis for Positive Definite and Indefinite Kernels

    Publication Year: 2009, Page(s):1017 - 1032
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3272 KB) | HTML iconHTML Multimedia Media

    Kernel methods are a class of well established and successful algorithms for pattern analysis thanks to their mathematical elegance and good performance. Numerous nonlinear extensions of pattern recognition techniques have been proposed so far based on the so-called kernel trick. The objective of this paper is twofold. First, we derive an additional kernel tool that is still missing, namely kernel... View full abstract»

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

    Publication Year: 2009, Page(s):1032 - 1047
    Cited by:  Papers (94)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7358 KB) | HTML iconHTML

    The evidential value of palmprints in forensics is clear as about 30% of the latents recovered from crime scenes are from palms. While palmprint-based personal authentication systems have been developed, they mostly deal with low resolution (about 100 ppi) palmprints and only perform full-to-full matching. We propose a latent-to-full palmprint matching system that is needed in forensics. Our syste... View full abstract»

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

    Publication Year: 2009, Page(s):1048 - 1058
    Cited by:  Papers (114)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2547 KB) | HTML iconHTML

    As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online Signature Verification and Recognition: An Approach Based on Symbolic Representation

    Publication Year: 2009, Page(s):1059 - 1073
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5055 KB) | HTML iconHTML

    In this paper, we propose a new method of representing on-line signatures by interval valued symbolic features. Global features of on-line signatures are used to form an interval valued feature vectors. Methods for signature verification and recognition based on the symbolic representation are also proposed. We exploit the notions of writer dependent threshold and introduce the concept of feature ... View full abstract»

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

    Publication Year: 2009, Page(s):1074 - 1086
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1866 KB) | HTML iconHTML

    Context plays an important role when performing classification, and in this paper we examine context from two perspectives. First, the classification of items within a single task is placed within the context of distinct concurrent or previous classification tasks (multiple distinct data collections). This is referred to as multi-task learning (MTL), and is implemented here in a statistical manner... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Statistical Framework for Image Category Search from a Mental Picture

    Publication Year: 2009, Page(s):1087 - 1101
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1811 KB) | HTML iconHTML

    Starting from a member of an image database designated the "query image," traditional image retrieval techniques, for example, search by visual similarity, allow one to locate additional instances of a target category residing in the database. However, in many cases, the query image or, more generally, the target category, resides only in the mind of the user as a set of subjective visual patterns... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tensor-Based AAM with Continuous Variation Estimation: Application to Variation-Robust Face Recognition

    Publication Year: 2009, Page(s):1102 - 1116
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2747 KB) | HTML iconHTML

    The active appearance model (AAM) is a well-known model that can represent a non-rigid object effectively. However, the fitting result is often unsatisfactory when an input image deviates from the training images due to its fixed shape and appearance model. To obtain more robust AAM fitting, we propose a tensor-based AAM that can handle a variety of subjects, poses, expressions, and illuminations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3D Model Retrieval Using Probability Density-Based Shape Descriptors

    Publication Year: 2009, Page(s):1117 - 1133
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4265 KB) | HTML iconHTML

    We address content-based retrieval of complete 3D object models by a probabilistic generative description of local shape properties. The proposed shape description framework characterizes a 3D object with sampled multivariate probability density functions of its local surface features. This density-based descriptor can be efficiently computed via kernel density estimation (KDE) coupled with fast G... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Staff Detection with Stable Paths

    Publication Year: 2009, Page(s):1134 - 1139
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1342 KB) | HTML iconHTML

    The preservation of musical works produced in the past requires their digitalization and transformation into a machine-readable format. The processing of handwritten musical scores by computers remains far from ideal. One of the fundamental stages to carry out this task is the staff line detection. We investigate a general-purpose, knowledge-free method for the automatic detection of music staff l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometry-Based Ensembles: Toward a Structural Characterization of the Classification Boundary

    Publication Year: 2009, Page(s):1140 - 1146
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2220 KB) | HTML iconHTML

    This article introduces a novel binary discriminative learning technique based on the approximation of the non-linear decision boundary by a piece-wise linear smooth additive model. The decision border is geometrically defined by means of the characterizing boundary points - points that belong to the optimal boundary under a certain notion of robustness. Based on these points, a set of locally rob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Very Fast Best-Fit Circular and Elliptical Boundaries by Chord Data

    Publication Year: 2009, Page(s):1147 - 1152
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1333 KB) | HTML iconHTML

    Many machine vision tasks require objects to be delineated during image segmentation that have shapes that are well approximated by circles or ellipses. Due to their computational efficiency least-squares, algebraic methods are a popular choice for fitting an elliptic primitive to noisy image data when real-time processing is required. These methods, however, suffer from biased estimates and sensi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TPAMI Information for authors

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

    Publication Year: 2009, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (178 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