By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 1 • Date Jan. 2011

Filter Results

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

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

    Publication Year: 2011, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (221 KB)
    Freely Available from IEEE
  • State of the Journal

    Publication Year: 2011, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (56 KB)
    Freely Available from IEEE
  • Decomposition of Complex Line Drawings with Hidden Lines for 3D Planar-Faced Manifold Object Reconstruction

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

    Three-dimensional object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail when the geometric structure of a 3D object becomes complex. In this paper, a novel approach based on a divide-and-conquer strategy is proposed to handle the 3D reconstruction of a planar-faced complex manifo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turbo Segmentation of Textured Images

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

    We consider the problem of semi-supervised segmentation of textured images. Existing model-based approaches model the intensity field of textured images as a Gauss-Markov random field to take into account the local spatial dependencies between the pixels. Classical Bayesian segmentation consists of also modeling the label field as a Markov random field to ensure that neighboring pixels correspond ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bilayer Segmentation of Webcam Videos Using Tree-Based Classifiers

    Publication Year: 2011, Page(s):30 - 42
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3254 KB) | HTML iconHTML Multimedia Media

    This paper presents an automatic segmentation algorithm for video frames captured by a (monocular) webcam that closely approximates depth segmentation from a stereo camera. The frames are segmented into foreground and background layers that comprise a subject (participant) and other objects and individuals. The algorithm produces correct segmentations even in the presence of large background motio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discriminative Learning of Local Image Descriptors

    Publication Year: 2011, Page(s):43 - 57
    Cited by:  Papers (93)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5468 KB) | HTML iconHTML

    In this paper, we explore methods for learning local image descriptors from training data. We describe a set of building blocks for constructing descriptors which can be combined together and jointly optimized so as to minimize the error of a nearest-neighbor classifier. We consider both linear and nonlinear transforms with dimensionality reduction, and make use of discriminant learning techniques... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible Depth of Field Photography

    Publication Year: 2011, Page(s):58 - 71
    Cited by:  Papers (13)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4735 KB) | HTML iconHTML

    The range of scene depths that appear focused in an image is known as the depth of field (DOF). Conventional cameras are limited by a fundamental trade-off between depth of field and signal-to-noise ratio (SNR). For a dark scene, the aperture of the lens must be opened up to maintain SNR, which causes the DOF to reduce. Also, today's cameras have DOFs that correspond to a single slab that is perpe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global Ridge Orientation Modeling for Partial Fingerprint Identification

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

    Identifying incomplete or partial fingerprints from a large fingerprint database remains a difficult challenge today. Existing studies on partial fingerprints focus on one-to-one matching using local ridge details. In this paper, we investigate the problem of retrieving candidate lists for matching partial fingerprints by exploiting global topological features. Specifically, we propose an analytic... View full abstract»

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

    Publication Year: 2011, Page(s):88 - 100
    Cited by:  Papers (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4119 KB) | HTML iconHTML

    Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and rolled fingerprint matching, latent fingerprint matching continues to be a difficult problem. Poor quality of ridge impressions, small finger area... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiperson Visual Focus of Attention from Head Pose and Meeting Contextual Cues

    Publication Year: 2011, Page(s):101 - 116
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3170 KB) | HTML iconHTML Multimedia Media

    This paper introduces a novel contextual model for the recognition of people's visual focus of attention (VFOA) in meetings from audio-visual perceptual cues. More specifically, instead of independently recognizing the VFOA of each meeting participant from his own head pose, we propose to jointly recognize the participants' visual attention in order to introduce context-dependent interaction model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Product Quantization for Nearest Neighbor Search

    Publication Year: 2011, Page(s):117 - 128
    Cited by:  Papers (354)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1904 KB) | HTML iconHTML

    This paper introduces a product quantization-based approach for approximate nearest neighbor search. The idea is to decompose the space into a Cartesian product of low-dimensional subspaces and to quantize each subspace separately. A vector is represented by a short code composed of its subspace quantization indices. The euclidean distance between two vectors can be efficiently estimated from thei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions

    Publication Year: 2011, Page(s):129 - 143
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3226 KB) | HTML iconHTML Multimedia Media

    Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learning with various strategies. To our knowledge, however, none of them takes all three semi-supervised assumptions, i.e., smoothness, cluster, and manifold assumptions, together into account during boosting learning. In this p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking with Occlusions via Graph Cuts

    Publication Year: 2011, Page(s):144 - 157
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3510 KB) | HTML iconHTML Multimedia Media

    This work presents a new method for tracking and segmenting along time-interacting objects within an image sequence. One major contribution of the paper is the formalization of the notion of visible and occluded parts. For each object, we aim at tracking these two parts. Assuming that the velocity of each object is driven by a dynamical law, predictions can be used to guide the successive estimati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Video Registration Using Dynamic Textures

    Publication Year: 2011, Page(s):158 - 171
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3253 KB) | HTML iconHTML

    We consider the problem of spatially and temporally registering multiple video sequences of dynamical scenes which contain, but are not limited to, nonrigid objects such as fireworks, flags fluttering in the wind, etc., taken from different vantage points. This problem is extremely challenging due to the presence of complex variations in the appearance of such dynamic scenes. In this paper, we pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • View-Independent Action Recognition from Temporal Self-Similarities

    Publication Year: 2011, Page(s):172 - 185
    Cited by:  Papers (129)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3810 KB) | HTML iconHTML

    This paper addresses recognition of human actions under view changes. We explore self-similarities of action sequences over time and observe the striking stability of such measures across views. Building upon this key observation, we develop an action descriptor that captures the structure of temporal similarities and dissimilarities within an action sequence. Despite this temporal self-similarity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Bilinear Structure from Motion Algorithm Using a Video Sequence and Inertial Sensors

    Publication Year: 2011, Page(s):186 - 193
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1601 KB) | HTML iconHTML

    In this paper, we study the benefits of the availability of a specific form of additional information-the vertical direction (gravity) and the height of the camera, both of which can be conveniently measured using inertial sensors and a monocular video sequence for 3D urban modeling. We show that in the presence of this information, the SfM equations can be rewritten in a bilinear form. This allow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Canonical Correlation Analysis for Multilabel Classification: A Least-Squares Formulation, Extensions, and Analysis

    Publication Year: 2011, Page(s):194 - 200
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (509 KB) | HTML iconHTML Multimedia Media

    Canonical Correlation Analysis (CCA) is a well-known technique for finding the correlations between two sets of multidimensional variables. It projects both sets of variables onto a lower-dimensional space in which they are maximally correlated. CCA is commonly applied for supervised dimensionality reduction in which the two sets of variables are derived from the data and the class labels, respect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connectedness of Random Walk Segmentation

    Publication Year: 2011, Page(s):200 - 202
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    Connectedness of random walk segmentation is examined, and novel properties are discovered, by considering electrical circuits equivalent to random walks. A theoretical analysis shows that earlier conclusions concerning connectedness of random walk segmentation results are incorrect, and counterexamples are demonstrated. View full abstract»

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

    Publication Year: 2011, Page(s):203 - 208
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • 2010 Annual Index

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

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

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