By Topic

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Issue 1 • Date Jan. 2010

Filter Results

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

    Publication Year: 2010 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (178 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2010 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (142 KB)  
    Freely Available from IEEE
  • The 30th Anniversary of the IEEE Transactions on Pattern Analysis and Machine Intelligence

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (66 KB)  
    Freely Available from IEEE
  • Accurate Image Search Using the Contextual Dissimilarity Measure

    Publication Year: 2010 , Page(s): 2 - 11
    Cited by:  Papers (33)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2868 KB) |  | HTML iconHTML  

    This paper introduces the contextual dissimilarity measure, which significantly improves the accuracy of bag-of-features-based image search. Our measure takes into account the local distribution of the vectors and iteratively estimates distance update terms in the spirit of Sinkhorn's scaling algorithm, thereby modifying the neighborhood structure. Experimental results show that our approach gives... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Range Image Registration in the Markov Chain

    Publication Year: 2010 , Page(s): 12 - 29
    Cited by:  Papers (7)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4684 KB) |  | HTML iconHTML  

    In this paper, a novel entropy that can describe both long and short-tailed probability distributions of constituents of a thermodynamic system out of its thermodynamic limit is first derived from the Lyapunov function for a Markov chain. We then maximize this entropy for the estimation of the probabilities of possible correspondences established using the traditional closest point criterion betwe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Boosting Framework for Visuality-Preserving Distance Metric Learning and Its Application to Medical Image Retrieval

    Publication Year: 2010 , Page(s): 30 - 44
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2770 KB) |  | HTML iconHTML  

    Similarity measurement is a critical component in content-based image retrieval systems, and learning a good distance metric can significantly improve retrieval performance. However, despite extensive study, there are several major shortcomings with the existing approaches for distance metric learning that can significantly affect their application to medical image retrieval. In particular, ldquos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convex and Semi-Nonnegative Matrix Factorizations

    Publication Year: 2010 , Page(s): 45 - 55
    Cited by:  Papers (71)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (879 KB) |  | HTML iconHTML  

    We present several new variations on the theme of nonnegative matrix factorization (NMF). Considering factorizations of the form X = FGT, we focus on algorithms in which G is restricted to containing nonnegative entries, but allowing the data matrix X to have mixed signs, thus extending the applicable range of NMF methods. We also consider algorithms in which the basis vectors of F are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correspondence-Free Activity Analysis and Scene Modeling in Multiple Camera Views

    Publication Year: 2010 , Page(s): 56 - 71
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4899 KB) |  | HTML iconHTML  

    We propose a novel approach for activity analysis in multiple synchronized but uncalibrated static camera views. In this paper, we refer to activities as motion patterns of objects, which correspond to paths in far-field scenes. We assume that the topology of cameras is unknown and quite arbitrary, the fields of views covered by these cameras may have no overlap or any amount of overlap, and objec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential Geometric Inference in Surface Stereo

    Publication Year: 2010 , Page(s): 72 - 86
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3336 KB) |  | HTML iconHTML  

    Many traditional two-view stereo algorithms explicitly or implicitly use the frontal parallel plane assumption when exploiting contextual information since, e.g., the smoothness prior biases toward constant disparity (depth) over a neighborhood. This introduces systematic errors to the matching process for slanted or curved surfaces. These errors are nonnegligible for detailed geometric modeling o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct Estimation of Nonrigid Registrations with Image-Based Self-Occlusion Reasoning

    Publication Year: 2010 , Page(s): 87 - 104
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (6153 KB) |  | HTML iconHTML  

    The registration problem for images of a deforming surface has been well studied. External occlusions are usually well handled. In 2D image-based registration, self-occlusions are more challenging. Consequently, the surface is usually assumed to be only slightly self-occluding. This paper is about image-based nonrigid registration with self-occlusion reasoning. A specific framework explicitly mode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Faster and Better: A Machine Learning Approach to Corner Detection

    Publication Year: 2010 , Page(s): 105 - 119
    Cited by:  Papers (177)  |  Patents (3)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2998 KB) |  | HTML iconHTML  

    The repeatability and efficiency of a corner detector determines how likely it is to be useful in a real-world application. The repeatability is important because the same scene viewed from different positions should yield features which correspond to the same real-world 3D locations. The efficiency is important because this determines whether the detector combined with further processing can oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Decoding Process in Ternary Error-Correcting Output Codes

    Publication Year: 2010 , Page(s): 120 - 134
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3288 KB) |  | HTML iconHTML  

    A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-correcting output codes (ECOC) represent a successful framework to deal with these type of problems. Recent works in the ECOC framework showed significant performance improvements by means of new problem-dependent designs based on the ternary ECOC framework. The ternary fram... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structural Approach for Building Reconstruction from a Single DSM

    Publication Year: 2010 , Page(s): 135 - 147
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (5110 KB) |  | HTML iconHTML  

    We present a new approach for building reconstruction from a single Digital Surface Model (DSM). It treats buildings as an assemblage of simple urban structures extracted from a library of 3D parametric blocks (like a LEGO set). First, the 2D-supports of the urban structures are extracted either interactively or automatically. Then, 3D-blocks are placed on the 2D-supports using a Gibbs model which... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Language to Learn Structured Appearance Models for Image Annotation

    Publication Year: 2010 , Page(s): 148 - 164
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3219 KB) |  | HTML iconHTML  

    Given an unstructured collection of captioned images of cluttered scenes featuring a variety of objects, our goal is to simultaneously learn the names and appearances of the objects. Only a small fraction of local features within any given image are associated with a particular caption word, and captions may contain irrelevant words not associated with any image object. We propose a novel algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Algorithm for Walsh Hadamard Transform on Sliding Windows

    Publication Year: 2010 , Page(s): 165 - 171
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2600 KB) |  | HTML iconHTML  

    This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational requirement of the proposed algorithm is about 1.5 additions per projection vector per sample, which is the lowest among existing fast algorithms for Walsh Hadamard Transform on sliding windows. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatiotemporal Saliency in Dynamic Scenes

    Publication Year: 2010 , Page(s): 171 - 177
    Cited by:  Papers (58)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1669 KB) |  | HTML iconHTML  

    A spatiotemporal saliency algorithm based on a center-surround framework is proposed. The algorithm is inspired by biological mechanisms of motion-based perceptual grouping and extends a discriminant formulation of center-surround saliency previously proposed for static imagery. Under this formulation, the saliency of a location is equated to the power of a predefined set of features to discrimina... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalized Kernel Consensus-Based Robust Estimator

    Publication Year: 2010 , Page(s): 178 - 184
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1929 KB) |  | HTML iconHTML  

    In this paper, we present a new adaptive-scale kernel consensus (ASKC) robust estimator as a generalization of the popular and state-of-the-art robust estimators such as random sample consensus (RANSAC), adaptive scale sample consensus (ASSC), and maximum kernel density estimator (MKDE). The ASKC framework is grounded on and unifies these robust estimators using nonparametric kernel density estima... View full abstract»

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

    Publication Year: 2010 , Page(s): 185 - 190
    Save to Project icon | Request Permissions | PDF file iconPDF (96 KB)  
    Freely Available from IEEE
  • Call for Papers for Special Issue on Real-World Face Recognition

    Publication Year: 2010 , Page(s): 191
    Save to Project icon | Request Permissions | PDF file iconPDF (43 KB)  
    Freely Available from IEEE
  • Call for Papers for New IEEE Transactions on Affective Computing

    Publication Year: 2010 , Page(s): 192
    Save to Project icon | Request Permissions | PDF file iconPDF (145 KB)  
    Freely Available from IEEE
  • TPAMI Information for authors

    Publication Year: 2010 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (142 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2010 , Page(s): c4
    Save to Project icon | Request Permissions | 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