By Topic

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Issue 3 • Date March 2007

Filter Results

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

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

    Publication Year: 2007 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (86 KB)  
    Freely Available from IEEE
  • Introduction of New Associate Editors

    Publication Year: 2007 , Page(s): 369 - 370
    Save to Project icon | Request Permissions | PDF file iconPDF (143 KB)  
    Freely Available from IEEE
  • Selection and Fusion of Color Models for Image Feature Detection

    Publication Year: 2007 , Page(s): 371 - 381
    Cited by:  Papers (26)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1279 KB) |  | HTML iconHTML  

    The choice of a color model is of great importance for many computer vision algorithms (e.g., feature detection, object recognition, and tracking) as the chosen color model induces the equivalence classes to the actual algorithms. As there are many color models available, the inherent difficulty is how to automatically select a single color model or, alternatively, a weighted subset of color model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Gray-Code Filter Kernels

    Publication Year: 2007 , Page(s): 382 - 393
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1361 KB) |  | HTML iconHTML  

    In this paper, we introduce a family of filter kernels, the gray-code kernels (GCK) and demonstrate their use in image analysis. Filtering an image with a sequence of gray-code kernels is highly efficient and requires only two operations per pixel for each filter kernel, independent of the size or dimension of the kernel. We show that the family of kernels is large and includes the Walsh-Hadamard ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supervised Learning of Semantic Classes for Image Annotation and Retrieval

    Publication Year: 2007 , Page(s): 394 - 410
    Cited by:  Papers (166)  |  Patents (18)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3721 KB) |  | HTML iconHTML  

    A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as the group of database images labeled with a common semantic label. It is shown that, by establishing this one-to-one correspondence between semantic labels and semantic classes, a minimum probability of error annotation an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Object Recognition with Cortex-Like Mechanisms

    Publication Year: 2007 , Page(s): 411 - 426
    Cited by:  Papers (288)  |  Patents (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3573 KB) |  | HTML iconHTML  

    We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the organization of visual cortex and builds an increasingly complex and invariant feature representation by alternating between a template matching and a maximum pooling operation. We demonstrate the strength of the approach on a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Classification with Incomplete Data

    Publication Year: 2007 , Page(s): 427 - 436
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1295 KB) |  | HTML iconHTML  

    We address the incomplete-data problem in which feature vectors to be classified are missing data (features). A (supervised) logistic regression algorithm for the classification of incomplete data is developed. Single or multiple imputation for the missing data is avoided by performing analytic integration with an estimated conditional density function (conditioned on the observed data). Condition... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension

    Publication Year: 2007 , Page(s): 437 - 448
    Cited by:  Papers (10)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1838 KB) |  | HTML iconHTML  

    In binary images, the distance transformation (DT) and the geometrical skeleton extraction are classic tools for shape analysis. In this paper, we present time optimal algorithms to solve the reverse Euclidean distance transformation and the reversible medial axis extraction problems for d-dimensional images. We also present a d-dimensional medial axis filtering process that allows us to control t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution

    Publication Year: 2007 , Page(s): 449 - 462
    Cited by:  Papers (59)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2869 KB) |  | HTML iconHTML  

    In this paper, we introduce a new skeleton pruning method based on contour partitioning. Any contour partition can be used, but the partitions obtained by discrete curve evolution (DCE) yield excellent results. The theoretical properties and the experiments presented demonstrate that obtained skeletons are in accord with human visual perception and stable, even in the presence of significant noise... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-Time Completion of Video

    Publication Year: 2007 , Page(s): 463 - 476
    Cited by:  Papers (101)  |  Patents (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3165 KB) |  | HTML iconHTML  

    This paper presents a new framework for the completion of missing information based on local structures. It poses the task of completion as a global optimization problem with a well-defined objective function and derives a new algorithm to optimize it. Missing values are constrained to form coherent structures with respect to reference examples. We apply this method to space-time completion of lar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmenting, Modeling, and Matching Video Clips Containing Multiple Moving Objects

    Publication Year: 2007 , Page(s): 477 - 491
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4991 KB) |  | HTML iconHTML  

    This paper presents a novel representation for dynamic scenes composed of multiple rigid objects that may undergo different motions and are observed by a moving camera. Multiview constraints associated with groups of affine-covariant scene patches and a normalized description of their appearance are used to segment a scene into its rigid components, construct three-dimensional models of these comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Generalization in Biometric Authentication Using Joint User-Specific and Sample Bootstraps

    Publication Year: 2007 , Page(s): 492 - 498
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (627 KB) |  | HTML iconHTML  

    Biometric authentication performance is often depicted by a detection error trade-off (DET) curve. We show that this curve is dependent on the choice of samples available, the demographic composition and the number of users specific to a database. We propose a two-step bootstrap procedure to take into account the three mentioned sources of variability. This is an extension to the Bolle et al.'s bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Camera Calibration from Images of Spheres

    Publication Year: 2007 , Page(s): 499 - 502
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (812 KB) |  | HTML iconHTML  

    This paper introduces a novel approach for solving the problem of camera calibration from spheres. By exploiting the relationship between the dual images of spheres and the dual image of the absolute conic (IAC), it is shown that the common pole and polar with regard to the conic images of two spheres are also the pole and polar with regard to the IAC. This provides two constraints for estimating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Impact of Dissimilarity Measure in k-Modes Clustering Algorithm

    Publication Year: 2007 , Page(s): 503 - 507
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (855 KB) |  | HTML iconHTML  

    This correspondence describes extensions to the k-modes algorithm for clustering categorical data. By modifying a simple matching dissimilarity measure for categorical objects, a heuristic approach was developed in (Z. He, et al., 2005), (O. San, et al., 2004) which allows the use of the k-modes paradigm to obtain a cluster with strong intrasimilarity and to efficiently cluster large categorical d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct Curvature Scale Space: Theory and Corner Detection

    Publication Year: 2007 , Page(s): 508 - 512
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (575 KB) |  | HTML iconHTML  

    The curvature scale space (CSS) technique is considered to be a modern tool in image processing and computer vision. direct curvature scale space (DCSS) is defined as the CSS that results from convolving the curvature of a planar curve with a Gaussian kernel directly. In this paper we present a theoretical analysis of DCSS in detecting corners on planar curves. The scale space behavior of isolated... 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: 2007 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (86 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2007 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (137 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