By Topic

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Issue 8 • Date Aug. 2006

Filter Results

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

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

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

    Publication Year: 2006 , Page(s): 1185
    Save to Project icon | Request Permissions | PDF file iconPDF (92 KB)  
    Freely Available from IEEE
  • Font adaptive word indexing of modern printed documents

    Publication Year: 2006 , Page(s): 1187 - 1199
    Cited by:  Papers (17)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3893 KB) |  | HTML iconHTML  

    We propose an approach for the word-level indexing of modern printed documents which are difficult to recognize using current OCR engines. By means of word-level indexing, it is possible to retrieve the position of words in a document, enabling queries involving proximity of terms. Web search engines implement this kind of indexing, allowing users to retrieve Web pages on the basis of their textua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A binary linear programming formulation of the graph edit distance

    Publication Year: 2006 , Page(s): 1200 - 1214
    Cited by:  Papers (20)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4190 KB) |  | HTML iconHTML  

    A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric, provided the cost function for individual edit operations is a metric. Then, a binary linear program is devel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The distinctiveness of a curve in a parameterized neighborhood: extraction and applications

    Publication Year: 2006 , Page(s): 1215 - 1222
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1914 KB) |  | HTML iconHTML  

    A new feature of curves pertaining to the acceptance/rejection decision in curve detection is proposed. The feature measures a curve's distinctiveness in its neighborhood, which is modeled by a one-parameter family of curves. A computational framework based on the Hough transform for extracting the distinctiveness feature is elaborated and examples of feature extractors for the circle and the elli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On weighting clustering

    Publication Year: 2006 , Page(s): 1223 - 1235
    Cited by:  Papers (46)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4047 KB) |  | HTML iconHTML  

    Recent papers and patents in iterative unsupervised learning have emphasized a new trend in clustering. It basically consists of penalizing solutions via weights on the instance points, somehow making clustering move toward the hardest points to cluster. The motivations come principally from an analogy with powerful supervised classification methods known as boosting algorithms. However, interest ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning nonlinear image manifolds by global alignment of local linear models

    Publication Year: 2006 , Page(s): 1236 - 1250
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3007 KB) |  | HTML iconHTML  

    Appearance-based methods, based on statistical models of the pixel values in an image (region) rather than geometrical object models, are increasingly popular in computer vision. In many applications, the number of degrees of freedom (DOF) in the image generating process is much lower than the number of pixels in the image. If there is a smooth function that maps the DOF to the pixel values, then ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Confidence-based active learning

    Publication Year: 2006 , Page(s): 1251 - 1261
    Cited by:  Papers (38)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2251 KB) |  | HTML iconHTML  

    This paper proposes a new active learning approach, confidence-based active learning, for training a wide range of classifiers. This approach is based on identifying and annotating uncertain samples. The uncertainty value of each sample is measured by its conditional error. The approach takes advantage of current classifiers' probability preserving and ordering properties. It calibrates the output... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamical statistical shape priors for level set-based tracking

    Publication Year: 2006 , Page(s): 1262 - 1273
    Cited by:  Papers (110)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2558 KB) |  | HTML iconHTML  

    In recent years, researchers have proposed introducing statistical shape knowledge into level set-based segmentation methods in order to cope with insufficient low-level information. While these priors were shown to drastically improve the segmentation of familiar objects, so far the focus has been on statistical shape priors which are static in time. Yet, in the context of tracking deformable obj... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subclass discriminant analysis

    Publication Year: 2006 , Page(s): 1274 - 1286
    Cited by:  Papers (81)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2586 KB) |  | HTML iconHTML  

    Over the years, many discriminant analysis (DA) algorithms have been proposed for the study of high-dimensional data in a large variety of problems. Each of these algorithms is tuned to a specific type of data distribution (that which best models the problem at hand). Unfortunately, in most problems the form of each class pdf is a priori unknown, and the selection of the DA algorithm that best fit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reflectance sharing: predicting appearance from a sparse set of images of a known shape

    Publication Year: 2006 , Page(s): 1287 - 1302
    Cited by:  Papers (23)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1846 KB) |  | HTML iconHTML  

    Three-dimensional appearance models consisting of spatially varying reflectance functions defined on a known shape can be used in analysis-by-synthesis approaches to a number of visual tasks. The construction of these models requires the measurement of reflectance, and the problem of recovering spatially varying reflectance from images of known shape has drawn considerable interest. To date, exist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape registration in implicit spaces using information theory and free form deformations

    Publication Year: 2006 , Page(s): 1303 - 1318
    Cited by:  Papers (71)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3248 KB) |  | HTML iconHTML  

    We present a novel, variational and statistical approach for shape registration. Shapes of interest are implicitly embedded in a higher-dimensional space of distance transforms. In this implicit embedding space, registration is formulated in a hierarchical manner: the mutual information criterion supports various transformation models and is optimized to perform global registration; then, a B-spli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building models of animals from video

    Publication Year: 2006 , Page(s): 1319 - 1334
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (5422 KB) |  | HTML iconHTML  

    This paper argues that tracking, object detection, and model building are all similar activities. We describe a fully automatic system that builds 2D articulated models known as pictorial structures from videos of animals. The learned model can be used to detect the animal in the original video - in this sense, the system can be viewed as a generalized tracker (one that is capable of modeling obje... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generic camera model and calibration method for conventional, wide-angle, and fish-eye lenses

    Publication Year: 2006 , Page(s): 1335 - 1340
    Cited by:  Papers (87)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1106 KB) |  | HTML iconHTML  

    Fish-eye lenses are convenient in such applications where a very wide angle of view is needed, but their use for measurement purposes has been limited by the lack of an accurate, generic, and easy-to-use calibration procedure. We hence propose a generic camera model, which is suitable for fish-eye lens cameras as well as for conventional and wide-angle lens cameras, and a calibration method for es... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Table detection in online ink notes

    Publication Year: 2006 , Page(s): 1341 - 1346
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1624 KB) |  | HTML iconHTML  

    In documents, tables are important structured objects that present statistical and relational information. In this paper, we present a robust system which is capable of detecting tables from free style online ink notes and extracting their structure so that they can be further edited in multiple ways. First, the primitive structure of tables, i.e., candidates for ruling lines and table bounding bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximization of mutual information for offline Thai handwriting recognition

    Publication Year: 2006 , Page(s): 1347 - 1351
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1199 KB) |  | HTML iconHTML  

    This paper aims to improve the performance of an HMM-based offline Thai handwriting recognition system through discriminative training and the use of fine-tuned feature extraction methods. The discriminative training is implemented by maximizing the mutual information between the data and their classes. The feature extraction is based on our proposed block-based PCA and composite images, shown to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Affine-invariant geometric shape priors for region-based active contours

    Publication Year: 2006 , Page(s): 1352 - 1357
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (721 KB) |  | HTML iconHTML  

    We present a new way of constraining the evolution of a region-based active contour with respect to a reference shape. Minimizing a shape prior, defined as a distance between shape descriptors based on the Legendre moments of the characteristic function, leads to a geometric flow that can be used with benefits in a two-class segmentation application. The shape model includes intrinsic invariance w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join the IEEE Computer Society

    Publication Year: 2006 , Page(s): 1358
    Save to Project icon | Request Permissions | PDF file iconPDF (52 KB)  
    Freely Available from IEEE
  • Now From the Computer Society - IEEE ReadyNotes

    Publication Year: 2006 , Page(s): 1359
    Save to Project icon | Request Permissions | PDF file iconPDF (68 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Celebrates 60th anniversary

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

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

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