By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 6 • Date June 2004

Filter Results

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

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (128 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • In Memoriam, Azriel Rosenfeld (1931-2004)

    Publication Year: 2004, Page(s): 673
    Request permission for commercial reuse | PDF file iconPDF (64 KB) | HTML iconHTML
    Freely Available from IEEE
  • Point matching under large image deformations and illumination changes

    Publication Year: 2004, Page(s):674 - 688
    Cited by:  Papers (44)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3749 KB) | HTML iconHTML

    To solve the general point correspondence problem in which the underlying transformation between image patches is represented by a homography, a solution based on extensive use of first order differential techniques is proposed. We integrate in a single robust M-estimation framework the traditional optical flow method and matching of local color distributions. These distributions are computed with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Motion-based motion deblurring

    Publication Year: 2004, Page(s):689 - 698
    Cited by:  Papers (123)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2357 KB) | HTML iconHTML

    Motion blur due to camera motion can significantly degrade the quality of an image. Since the path of the camera motion can be arbitrary, deblurring of motion blurred images is a hard problem. Previous methods to deal with this problem have included blind restoration of motion blurred images, optical correction using stabilized lenses, and special CMOS sensors that limit the exposure time in the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated sensing and processing decision trees

    Publication Year: 2004, Page(s):699 - 708
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (994 KB) | HTML iconHTML

    We introduce a methodology for adaptive sequential sensing and processing in a classification setting. Our objective for sensor optimization is the back-end performance metric-in this case, misclassification rate. Our methodology, which we dub Integrated Sensing and Processing Decision Trees (ISPDT), optimizes adaptive sequential sensing for scenarios in which sensor and/or throughput constraints ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Offline recognition of unconstrained handwritten texts using HMMs and statistical language models

    Publication Year: 2004, Page(s):709 - 720
    Cited by:  Papers (61)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (750 KB) | HTML iconHTML

    This paper presents a system for the offline recognition of large vocabulary unconstrained handwritten texts. The only assumption made about the data is that it is written in English. This allows the application of statistical language models in order to improve the performance of our system. Several experiments have been performed using both single and multiple writer data. Lexica of variable siz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circular motion geometry using minimal data

    Publication Year: 2004, Page(s):721 - 731
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1514 KB) | HTML iconHTML

    Circular motion or single axis motion is widely used in computer vision and graphics for 3D model acquisition. This paper describes a new and simple method for recovering the geometry of uncalibrated circular motion from a minimal set of only two points in four images. This problem has been previously solved using nonminimal data either by computing the fundamental matrix and trifocal tensor in th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear dimensionality reduction via a heteroscedastic extension of LDA: the Chernoff criterion

    Publication Year: 2004, Page(s):732 - 739
    Cited by:  Papers (92)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (506 KB) | HTML iconHTML

    We propose an eigenvector-based heteroscedastic linear dimension reduction (LDR) technique for multiclass data. The technique is based on a heteroscedastic two-class technique which utilizes the so-called Chernoff criterion, and successfully extends the well-known linear discriminant analysis (LDA). The latter, which is based on the Fisher criterion, is incapable of dealing with heteroscedastic da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benchmarking a reduced multivariate polynomial pattern classifier

    Publication Year: 2004, Page(s):740 - 755
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2631 KB) | HTML iconHTML

    A novel method using a reduced multivariate polynomial model has been developed for biometric decision fusion where simplicity and ease of use could be a concern. However, much to our surprise, the reduced model was found to have good classification accuracy for several commonly used data sets from the Web. In this paper, we extend the single output model to a multiple outputs model to handle mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient solution to the five-point relative pose problem

    Publication Year: 2004, Page(s):756 - 770
    Cited by:  Papers (394)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1498 KB) | HTML iconHTML

    An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degree polynomial in closed form and, subsequently, finding its roots. It is the first algorithm well-sui... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inference of segmented color and texture description by tensor voting

    Publication Year: 2004, Page(s):771 - 786
    Cited by:  Papers (38)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1889 KB) | HTML iconHTML

    A robust synthesis method is proposed to automatically infer missing color and texture information from a damaged 2D image by ND tensor voting (N > 3). The same approach is generalized to range and 3D data in the presence of occlusion, missing data and noise. Our method translates texture information into an adaptive ND tensor, followed by a voting process that infers noniteratively the optimal co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic writer identification using connected-component contours and edge-based features of uppercase Western script

    Publication Year: 2004, Page(s):787 - 798
    Cited by:  Papers (71)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1577 KB) | HTML iconHTML

    In this paper, a new technique for offline writer identification is presented, using connected-component contours (COCOCOs or CO3s) in uppercase handwritten samples. In our model, the writer is considered to be characterized by a stochastic pattern generator, producing a family of connected components for the uppercase character set. Using a codebook of CO3s from an independe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Influence of the noise model on level set active contour segmentation

    Publication Year: 2004, Page(s):799 - 803
    Cited by:  Papers (39)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (601 KB) | HTML iconHTML

    We analyze level set implementation of region snakes based on the maximum likelihood method for different noise models that belong to the exponential family. We show that this approach can improve segmentation results in noisy images and we demonstrate that the regularization term can be efficiently determined using an information theory-based approach, i.e., the minimum description length princip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-adaptive regularization

    Publication Year: 2004, Page(s):804 - 809
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (653 KB) | HTML iconHTML

    Often an image g(x, y) is regularized and even restored by minimizing the Mumford-Shah functional. Properties of the regularized image u(x, y) depends critically on the numerical value of the two parameters α and β controlling smoothness and fidelity. When α and β are constant over the image, small details are lost when an extensive filtering is used in order to remove noise.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The template update problem

    Publication Year: 2004, Page(s):810 - 815
    Cited by:  Papers (237)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB) | HTML iconHTML

    Template tracking dates back to the 1981 Lucas-Kanade algorithm. One question that has received very little attention, however, is how to update the template so that it remains a good model of the tracked object. We propose a template update algorithm that avoids the "drifting" inherent in the naive algorithm. 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: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (128 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