IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 5 • May 2011

Filter Results

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

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

    Publication Year: 2011, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (120 KB)
    Freely Available from IEEE
  • Editor's Note

    Publication Year: 2011, Page(s):865 - 866
    Request permission for commercial reuse | PDF file iconPDF (91 KB) | HTML iconHTML
    Freely Available from IEEE
  • Action Recognition from One Example

    Publication Year: 2011, Page(s):867 - 882
    Cited by:  Papers (64)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3160 KB) | HTML iconHTML

    We present a novel action recognition method based on space-time locally adaptive regression kernels and the matrix cosine similarity measure. The proposed method uses a single example of an action as a query to find similar matches. It does not require prior knowledge about actions, foreground/background segmentation, or any motion estimation or tracking. Our method is based on the computation of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Action Recognition Using Mined Hierarchical Compound Features

    Publication Year: 2011, Page(s):883 - 897
    Cited by:  Papers (74)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2950 KB) | HTML iconHTML

    The field of Action Recognition has seen a large increase in activity in recent years. Much of the progress has been through incorporating ideas from single-frame object recognition and adapting them for temporal-based action recognition. Inspired by the success of interest points in the 2D spatial domain, their 3D (space-time) counterparts typically form the basic components used to describe acti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contour Detection and Hierarchical Image Segmentation

    Publication Year: 2011, Page(s):898 - 916
    Cited by:  Papers (963)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5550 KB) | HTML iconHTML

    This paper investigates two fundamental problems in computer vision: contour detection and image segmentation. We present state-of-the-art algorithms for both of these tasks. Our contour detector combines multiple local cues into a globalization framework based on spectral clustering. Our segmentation algorithm consists of generic machinery for transforming the output of any contour detector into ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Describing Reflectances for Color Segmentation Robust to Shadows, Highlights, and Textures

    Publication Year: 2011, Page(s):917 - 930
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3416 KB) | HTML iconHTML

    The segmentation of a single material reflectance is a challenging problem due to the considerable variation in image measurements caused by the geometry of the object, shadows, and specularities. The combination of these effects has been modeled by the dichromatic reflection model. However, the application of the model to real-world images is limited due to unknown acquisition parameters and comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Local Models for Monocular Reconstruction of Deformable Surfaces

    Publication Year: 2011, Page(s):931 - 944
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7557 KB) | HTML iconHTML

    Recovering the 3D shape of a nonrigid surface from a single viewpoint is known to be both ambiguous and challenging. Resolving the ambiguities typically requires prior knowledge about the most likely deformations that the surface may undergo. It often takes the form of a global deformation model that can be learned from training data. While effective, this approach suffers from the fact that a new... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multifeature-Based High-Resolution Palmprint Recognition

    Publication Year: 2011, Page(s):945 - 957
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2180 KB) | HTML iconHTML

    Palmprint is a promising biometric feature for use in access control and forensic applications. Previous research on palmprint recognition mainly concentrates on low-resolution (about 100 ppi) palmprints. But for high-security applications (e.g., forensic usage), high-resolution palmprints (500 ppi or higher) are required from which more useful information can be extracted. In this paper, we propo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MILIS: Multiple Instance Learning with Instance Selection

    Publication Year: 2011, Page(s):958 - 977
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4244 KB) | HTML iconHTML

    Multiple instance learning (MIL) is a paradigm in supervised learning that deals with the classification of collections of instances called bags. Each bag contains a number of instances from which features are extracted. The complexity of MIL is largely dependent on the number of instances in the training data set. Since we are usually confronted with a large instance space even for moderately siz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SIFT Flow: Dense Correspondence across Scenes and Its Applications

    Publication Year: 2011, Page(s):978 - 994
    Cited by:  Papers (337)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8338 KB) | HTML iconHTML

    While image alignment has been studied in different areas of computer vision for decades, aligning images depicting different scenes remains a challenging problem. Analogous to optical flow, where an image is aligned to its temporally adjacent frame, we propose SIFT flow, a method to align an image to its nearest neighbors in a large image corpus containing a variety of scenes. The SIFT flow algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-Time Super-Resolution Using Graph-Cut Optimization

    Publication Year: 2011, Page(s):995 - 1008
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3412 KB) | HTML iconHTML Multimedia Media

    We address the problem of super-resolution-obtaining high-resolution images and videos from multiple low-resolution inputs. The increased resolution can be in spatial or temporal dimensions, or even in both. We present a unified framework which uses a generative model of the imaging process and can address spatial super-resolution, space-time super-resolution, image deconvolution, single-image exp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Term Weighting Schemes for Question Categorization

    Publication Year: 2011, Page(s):1009 - 1021
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1671 KB) | HTML iconHTML

    Term weighting has proven to be an effective way to improve the performance of text categorization. Very recently, with the development of user-interactive question answering or community question answering, there has emerged a need to accurately categorize questions into predefined categories. However, as a question is usually a piece of short text, can the existing term-weighting methods perform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Textual Query of Personal Photos Facilitated by Large-Scale Web Data

    Publication Year: 2011, Page(s):1022 - 1036
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1729 KB) | HTML iconHTML

    The rapid popularization of digital cameras and mobile phone cameras has led to an explosive growth of personal photo collections by consumers. In this paper, we present a real-time textual query-based personal photo retrieval system by leveraging millions of Web images and their associated rich textual descriptions (captions, categories, etc.). After a user provides a textual query (e.g., "water&... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction

    Publication Year: 2011, Page(s):1037 - 1050
    Cited by:  Papers (90)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2015 KB) | HTML iconHTML

    We propose a new criterion for discriminative dimension reduction, max-min distance analysis (MMDA). Given a data set with C classes, represented by homoscedastic Gaussians, MMDA maximizes the minimum pairwise distance of these C classes in the selected low-dimensional subspace. Thus, unlike Fisher's linear discriminant analysis (FLDA) and other popular discriminative dimension reduction criteria,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fingerprint Indexing Based on Minutia Cylinder-Code

    Publication Year: 2011, Page(s):1051 - 1057
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1518 KB) | HTML iconHTML

    This paper proposes a new hash-based indexing method to speed up fingerprint identification in large databases. A Locality-Sensitive Hashing (LSH) scheme has been designed relying on Minutiae Cylinder-Code (MCC), which proved to be very effective in mapping a minutiae-based representation (position/angle only) into a set of fixed-length transformation-invariant binary vectors. A novel search algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Penalizing Closest Point Sharing for Automatic Free Form Shape Registration

    Publication Year: 2011, Page(s):1058 - 1064
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1367 KB) | HTML iconHTML

    For accurate registration of overlapping free form shapes, different points in one shape must select different points in another as their most sensible correspondents. To reach this ideal state, in this paper we develop a novel algorithm to penalize those points in one shape that select the same closest point in another as their tentative correspondents. The novel algorithm then models the relativ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape Recognition with Spectral Distances

    Publication Year: 2011, Page(s):1065 - 1071
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (574 KB) | HTML iconHTML

    Recent works have shown the use of diffusion geometry for various pattern recognition applications, including nonrigid shape analysis. In this paper, we introduce spectral shape distance as a general framework for distribution-based shape similarity and show that two recent methods for shape similarity due to Rustamov and Mahmoudi and Sapiro are particular cases thereof. View full abstract»

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

    Publication Year: 2011, Page(s): 1072
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (116 KB)
    Freely Available from IEEE
  • TPAMI Information for authors

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

    Publication Year: 2011, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (129 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
Sven Dickinson
University of Toronto
e-mail: sven@cs.toronto.edu