By Topic

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Issue 1 • Date Jan. 2008

Filter Results

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

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

    Publication Year: 2008 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (80 KB)  
    Freely Available from IEEE
  • Globally Consistent Reconstruction of Ripped-Up Documents

    Publication Year: 2008 , Page(s): 1 - 13
    Cited by:  Papers (10)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3465 KB) |  | HTML iconHTML  

    One of the most crucial steps for automatically reconstructing ripped-up documents is to find a globally consistent solution from the ambiguous candidate matches. However, little work has been done so far to solve this problem in a general computational framework without using application-specific features. In this paper, we propose a global approach for reconstructing ripped-up documents by first... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Script and Language Identification in Noisy and Degraded Document Images

    Publication Year: 2008 , Page(s): 14 - 24
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3196 KB) |  | HTML iconHTML  

    This paper reports an identification technique that detects scripts and languages of noisy and degraded document images. In the proposed technique, scripts and languages are identified through the document vectorization, which converts each document image into a document vector that characterizes the shape and frequency of the contained character or word images. Document images are vectorized by u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mixture of Spherical Distributions for Single-View Relighting

    Publication Year: 2008 , Page(s): 25 - 35
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2446 KB) |  | HTML iconHTML  

    We present a method for simultaneously estimating the illumination of a scene and the reflectance property of an object from single view images-a single image or a small number of images taken from the same viewpoint. We assume that the illumination consists of multiple point light sources, and the shape of the object is known. First, we represent the illumination on the surface of a unit sphere a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Groups of Adjacent Contour Segments for Object Detection

    Publication Year: 2008 , Page(s): 36 - 51
    Cited by:  Papers (114)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3753 KB) |  | HTML iconHTML  

    We present a family of scale-invariant local shape features formed by chains of k connected roughly straight contour segments (kAS), and their use for object class detection. kAS are able to cleanly encode pure fragments of an object boundary without including nearby clutter. Moreover, they offer an attractive compromise between information content and repeatability and encompass a wide variety of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locally Rotation, Contrast, and Scale Invariant Descriptors for Texture Analysis

    Publication Year: 2008 , Page(s): 52 - 61
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1916 KB) |  | HTML iconHTML  

    Textures within real images vary in brightness, contrast, scale, and skew as imaging conditions change. To enable recognition of textures in real images, it is necessary to employ a similarity measure that is invariant to these properties. Furthermore, since textures often appear on undulating surfaces, such invariances must necessarily be local rather than global. Despite these requirements, it i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs

    Publication Year: 2008 , Page(s): 62 - 75
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3954 KB) |  | HTML iconHTML  

    Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Redundancy-Based Measure of Dissimilarity among Probability Distributions for Hierarchical Clustering Criteria

    Publication Year: 2008 , Page(s): 76 - 88
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2633 KB) |  | HTML iconHTML  

    We introduce novel dissimilarity into a probabilistic clustering task to properly measure dissimilarity among multiple clusters when each cluster is characterized by a subpopulation in the mixture model. This measure of dissimilarity is called redundancy-based dissimilarity among probability distributions. From aspects of both source coding and a statistical hypothesis test, we shed light on sever... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval

    Publication Year: 2008 , Page(s): 89 - 104
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3108 KB) |  | HTML iconHTML  

    This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a vector space in which distances can be measured efficiently. Each embedding is treated as a classifier that predicts for any three objects X, A, B whether X is closer to A or to B. It is shown that a linear combination of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Marked Point Process of Rectangles and Segments for Automatic Analysis of Digital Elevation Models

    Publication Year: 2008 , Page(s): 105 - 119
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4002 KB) |  | HTML iconHTML  

    This work presents a framework for automatic feature extraction from images using stochastic geometry. Features in images are modeled as realizations of a spatial point process of geometrical shapes. This framework allows the incorporation of a priori knowledge on the spatial repartition of features. More specifically, we present a model based on the superposition of a process of segments and a pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum-Likelihood Registration of Range Images with Missing Data

    Publication Year: 2008 , Page(s): 120 - 130
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2132 KB) |  | HTML iconHTML  

    Missing data are common in range images, due to geometric occlusions, limitations in the sensor field of view, poor reflectivity, depth discontinuities, and cast shadows. Using registration to align these data often fails, because points without valid correspondences can be incorrectly matched. This paper presents a maximum-likelihood method for registration of scenes with unmatched or missing dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Free-Form Object Reconstruction from Silhouettes, Occluding Edges and Texture Edges: A Unified and Robust Operator Based on Duality

    Publication Year: 2008 , Page(s): 131 - 146
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2064 KB) |  | HTML iconHTML  

    In this paper, the duality in differential form is developed between a 3D primal surface and its dual manifold formed by the surface's tangent planes, that is, each tangent plane of the primal surface is represented as a four-dimensional vector that constitutes a point on the dual manifold. The iterated dual theorem shows that each tangent plane of the dual manifold corresponds to a point o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiflash Stereopsis: Depth-Edge-Preserving Stereo with Small Baseline Illumination

    Publication Year: 2008 , Page(s): 147 - 159
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2328 KB) |  | HTML iconHTML  

    Traditional stereo matching algorithms are limited in their ability to produce accurate results near depth discontinuities, due to partial occlusions and violation of smoothness constraints. In this paper, we use small baseline multiflash illumination to produce a rich set of feature maps that enable the acquisition of discontinuity preserving point correspondences. First, from a single multiflash... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cumulative Voting Consensus Method for Partitions with Variable Number of Clusters

    Publication Year: 2008 , Page(s): 160 - 173
    Cited by:  Papers (27)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1533 KB) |  | HTML iconHTML  

    Over the past few years, there has been a renewed interest in the consensus clustering problem. Several new methods have been proposed for finding a consensus partition for a set of n data objects that optimally summarizes an ensemble. In this paper, we propose new consensus clustering algorithms with linear computational complexity in n. We consider clusterings generated with a random number of c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph-Based Semisupervised Learning

    Publication Year: 2008 , Page(s): 174 - 179
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1241 KB) |  | HTML iconHTML  

    Graph-based learning provides a useful approach for modeling data in classification problems. In this modeling scenario, the relationship between labeled and unlabeled data impacts the construction and performance of classifiers and, therefore, a semisupervised learning framework is adopted. We propose a graph classifier based on kernel smoothing. A regularization framework is also introduced and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mutual Information for Lucas-Kanade Tracking (MILK): An Inverse Compositional Formulation

    Publication Year: 2008 , Page(s): 180 - 185
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1306 KB) |  | HTML iconHTML  

    Mutual information (Ml) is popular for registration via function optimization. This work proposes an inverse compositional formulation of Ml for Levenberg-Marquardt optimization. This yields a constant Hessian, which may be precomputed. Speed improvements of 15 percent were obtained, with convergence accuracies similar those of the standard formulation. View full abstract»

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

    Publication Year: 2008 , Page(s): 186 - 191
    Save to Project icon | Request Permissions | PDF file iconPDF (42 KB)  
    Freely Available from IEEE
  • Join the IEEE Computer Society [advertisement]

    Publication Year: 2008 , Page(s): 192
    Save to Project icon | Request Permissions | PDF file iconPDF (63 KB)  
    Freely Available from IEEE
  • 2007 Annual Index

    Publication Year: 2008 , Page(s): Not in Print
    Save to Project icon | Request Permissions | PDF file iconPDF (354 KB)  
    Freely Available from IEEE
  • TPAMI Information for authors

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

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