By Topic

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Issue 12 • Date Dec. 2010

Filter Results

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

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

    Publication Year: 2010 , Page(s): c2
    Request Permissions | PDF file iconPDF (151 KB)  
    Freely Available from IEEE
  • A Martingale Framework for Detecting Changes in Data Streams by Testing Exchangeability

    Publication Year: 2010 , Page(s): 2113 - 2127
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3149 KB) |  | HTML iconHTML  

    In a data streaming setting, data points are observed sequentially. The data generating model may change as the data are streaming. In this paper, we propose detecting this change in data streams by testing the exchangeability property of the observed data. Our martingale approach is an efficient, nonparametric, one-pass algorithm that is effective on the classification, cluster, and regression da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minutia Cylinder-Code: A New Representation and Matching Technique for Fingerprint Recognition

    Publication Year: 2010 , Page(s): 2128 - 2141
    Cited by:  Papers (49)
    Multimedia
    Request Permissions | Click to expandAbstract | PDF file iconPDF (5026 KB) |  | HTML iconHTML  

    In this paper, we introduce the Minutia Cylinder-Code (MCC): a novel representation based on 3D data structures (called cylinders), built from minutiae distances and angles. The cylinders can be created starting from a subset of the mandatory features (minutiae position and direction) defined by standards like ISO/IEC 19794-2 (2005). Thanks to the cylinder invariance, fixed-length, and bit-oriente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Script Recognition—A Review

    Publication Year: 2010 , Page(s): 2142 - 2161
    Cited by:  Papers (22)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (5354 KB) |  | HTML iconHTML  

    A variety of different scripts are used in writing languages throughout the world. In a multiscript, multilingual environment, it is essential to know the script used in writing a document before an appropriate character recognition and document analysis algorithm can be chosen. In view of this, several methods for automatic script identification have been developed so far. They mainly belong to t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3D Face Recognition Using Isogeodesic Stripes

    Publication Year: 2010 , Page(s): 2162 - 2177
    Cited by:  Papers (37)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3243 KB) |  | HTML iconHTML  

    In this paper, we present a novel approach to 3D face matching that shows high effectiveness in distinguishing facial differences between distinct individuals from differences induced by nonneutral expressions within the same individual. The approach takes into account geometrical information of the 3D face and encodes the relevant information into a compact representation in the form of a graph. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hierarchical Visual Model for Video Object Summarization

    Publication Year: 2010 , Page(s): 2178 - 2190
    Cited by:  Papers (14)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2871 KB) |  | HTML iconHTML  

    We propose a novel method for removing irrelevant frames from a video given user-provided frame-level labeling for a very small number of frames. We first hypothesize a number of windows which possibly contain the object of interest, and then determine which window(s) truly contain the object of interest. Our method enjoys several favorable properties. First, compared to approaches where a single ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind Image Deconvolution Using Machine Learning for Three-Dimensional Microscopy

    Publication Year: 2010 , Page(s): 2191 - 2204
    Cited by:  Papers (8)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1198 KB) |  | HTML iconHTML  

    In this work, we propose a novel method for the regularization of blind deconvolution algorithms. The proposed method employs example-based machine learning techniques for modeling the space of point spread functions. During an iterative blind deconvolution process, a prior term attracts the point spread function estimates to the learned point spread function space. We demonstrate the usage of thi... View full abstract»

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

    Publication Year: 2010 , Page(s): 2205 - 2215
    Cited by:  Papers (15)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2711 KB) |  | HTML iconHTML  

    We present a computational approach to high-order matching of data sets in Rd. Those are matchings based on data affinity measures that score the matching of more than two pairs of points at a time. High-order affinities are represented by tensors and the matching is then given by a rank-one approximation of the affinity tensor and a corresponding discretization. Our approach is rigorou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Dual Formulation of Boosting Algorithms

    Publication Year: 2010 , Page(s): 2216 - 2231
    Cited by:  Papers (18)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3533 KB) |  | HTML iconHTML  

    We study boosting algorithms from a new perspective. We show that the Lagrange dual problems of ℓ1-norm-regularized AdaBoost, LogitBoost, and soft-margin LPBoost with generalized hinge loss are all entropy maximization problems. By looking at the dual problems of these boosting algorithms, we show that the success of boosting algorithms can be understood in terms of maintaining a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online Segmentation of Time Series Based on Polynomial Least-Squares Approximations

    Publication Year: 2010 , Page(s): 2232 - 2245
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3332 KB) |  | HTML iconHTML  

    The paper presents SwiftSeg, a novel technique for online time series segmentation and piecewise polynomial representation. The segmentation approach is based on a least-squares approximation of time series in sliding and/or growing time windows utilizing a basis of orthogonal polynomials. This allows the definition of fast update steps for the approximating polynomial, where the computational eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PADS: A Probabilistic Activity Detection Framework for Video Data

    Publication Year: 2010 , Page(s): 2246 - 2261
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3489 KB) |  | HTML iconHTML  

    There is now a growing need to identify various kinds of activities that occur in videos. In this paper, we first present a logical language called Probabilistic Activity Description Language (PADL) in which users can specify activities of interest. We then develop a probabilistic framework which assigns to any subvideo of a given video sequence a probability that the subvideo contains the given a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Point Set Registration: Coherent Point Drift

    Publication Year: 2010 , Page(s): 2262 - 2275
    Cited by:  Papers (103)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2227 KB) |  | HTML iconHTML  

    Point set registration is a key component in many computer vision tasks. The goal of point set registration is to assign correspondences between two sets of points and to recover the transformation that maps one point set to the other. Multiple factors, including an unknown nonrigid spatial transformation, large dimensionality of point set, noise, and outliers, make the point set registration a ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vignette and Exposure Calibration and Compensation

    Publication Year: 2010 , Page(s): 2276 - 2288
    Cited by:  Papers (6)  |  Patents (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4422 KB) |  | HTML iconHTML  

    We discuss calibration and removal of “vignetting” (radial falloff) and exposure (gain) variations from sequences of images. Even when the response curve is known, spatially varying ambiguities prevent us from recovering the vignetting, exposure, and scene radiances uniquely. However, the vignetting and exposure variations can nonetheless be removed from the images without resolving ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equidistant Fish-Eye Calibration and Rectification by Vanishing Point Extraction

    Publication Year: 2010 , Page(s): 2289 - 2296
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1689 KB) |  | HTML iconHTML  

    In this paper, we describe a method to photogrammetrically estimate the intrinsic and extrinsic parameters of fish-eye cameras using the properties of equidistance perspective, particularly vanishing point estimation, with the aim of providing a rectified image for scene viewing applications. The estimated intrinsic parameters are the optical center and the fish-eye lensing parameter, and the extr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hidden Markov Models with Nonelliptically Contoured State Densities

    Publication Year: 2010 , Page(s): 2297 - 2304
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1725 KB) |  | HTML iconHTML  

    Hidden Markov models (HMMs) are a popular approach for modeling sequential data comprising continuous attributes. In such applications, the observation emission densities of the HMM hidden states are typically modeled by means of elliptically contoured distributions, usually multivariate Gaussian or Student's-t densities. However, elliptically contoured distributions cannot sufficiently model heav... 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: 2010 , Page(s): c3
    Request Permissions | PDF file iconPDF (151 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2010 , Page(s): c4
    Request Permissions | PDF file iconPDF (183 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