By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 8 • Date Aug 1998

Filter Results

Displaying Results 1 - 14 of 14
  • n-dimensional moment invariants and conceptual mathematical theory of recognition n-dimensional solids

    Publication Year: 1998, Page(s):819 - 831
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    The proof of the generalized fundamental theorem of moment invariants (GFTMI) is presented for n-dimensional pattern recognition. On the basis of GFTMI, the moment invariants of affine transformation and subgroups of affine transformation are constructed. Using these invariants, the conceptual mathematical theory of recognition of geometric figures, solids, and their n-dimensional generalizations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selecting the optimal focus measure for autofocusing and depth-from-focus

    Publication Year: 1998, Page(s):864 - 870
    Cited by:  Papers (108)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    A method is described for selecting the optimal focus measure with respect to gray-level noise from a given set of focus measures in passive autofocusing and depth-from-focus applications. The method is based on two new metrics that have been defined for estimating the noise-sensitivity of different focus measures. The first metric-the autofocusing uncertainty measure (AUM)-is useful in understand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for finding the largest approximately common substructures of two trees

    Publication Year: 1998, Page(s):889 - 895
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology and natural language processing. We consider a substructure of an ordered labeled tree T to be a connected subgraph of T. Given two ordered labeled trees T1 and T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The random subspace method for constructing decision forests

    Publication Year: 1998, Page(s):832 - 844
    Cited by:  Papers (575)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is seldom resolved. A method to construct a decision tree based classifier is proposed that maintains highest accuracy on training data and improves on generalization accuracy as it grows in complexity. The classifier consists... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental learning with sample queries

    Publication Year: 1998, Page(s):883 - 888
    Cited by:  Papers (10)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    The classical theory of pattern recognition assumes labeled examples appear according to unknown underlying class conditional probability distributions where the pattern classes are picked randomly in a passive manner according to their a priori probabilities. This paper presents experimental results for an incremental nearest-neighbor learning algorithm which actively selects samples from differe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large-scale parallel data clustering

    Publication Year: 1998, Page(s):871 - 876
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-clustering tool, P-CLUSTER, designed to execute on a network of workstations. Experiments involving the unsupervised segmentation of standard texture images were performed. For some data sets, a 96 percent reduction in compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unsupervised texture segmentation in a deterministic annealing framework

    Publication Year: 1998, Page(s):803 - 818
    Cited by:  Papers (66)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1684 KB)

    We present a novel optimization framework for unsupervised texture segmentation that relies on statistical tests as a measure of homogeneity. Texture segmentation is formulated as a data clustering problem based on sparse proximity data. Dissimilarities of pairs of textured regions are computed from a multiscale Gabor filter image representation. We discuss and compare a class of clustering object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hilbert-Schmidt lower bounds for estimators on matrix lie groups for ATR

    Publication Year: 1998, Page(s):790 - 802
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    Deformable template representations of observed imagery model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we study the construction of minimum mean squared error estimators on the special orthogonal group, SO(n), for pose estimation. Due to the nonflat geometry of SO(n), the standard Bayesian formulation of optimal estimators and their... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optical font recognition using typographical features

    Publication Year: 1998, Page(s):877 - 882
    Cited by:  Papers (50)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    A new statistical approach based on global typographical features is proposed to the widely neglected problem of font recognition. It aims at the identification of the typeface, weight, slope and size of the text from an image block without any knowledge of the content of that text. The recognition is based on a multivariate Bayesian classifier and operates on a given set of known fonts. The effec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial classification: the benefit of deferred decision

    Publication Year: 1998, Page(s):769 - 776
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    It is shown that partial classification which allows for indecision in certain regions of the data space, can increase a benefit function, defined as the difference between the probabilities of correct and incorrect decisions, joint with the event that a decision is made. This is particularly true for small data samples, which may cause a large deviation of the estimated separation surface from th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of man-made regions in unmanned aerial vehicle imagery and videos

    Publication Year: 1998, Page(s):852 - 857
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1500 KB)

    Details work in our group on the use of low-level features for the identification of man-made regions in unmanned aerial vehicle (UAV) imagery. The feature sets that we have examined include classical statistical features such as the coefficient of variation in a window about a pixel, locally computed fractal dimension, and fractal dimension computed in the presence of wavelet boundaries. We discu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of 3D surfaces by two-variable Fourier descriptors

    Publication Year: 1998, Page(s):858 - 863
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A method for generating two-variable 3D FDs directly from a striped lighting system is developed. An iterative algorithm is proposed to compute the two-variable 3D FDs for both axisymmetric and nonaxisymmetric objects and a formula for convergence test is derived. Experiments conducted for a set of 3D objects show that the iterative algorithm converges very quickly and the two-variable 3D FD repre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Breakpoint detection using covariance propagation

    Publication Year: 1998, Page(s):845 - 851
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    Presents a statistical approach for detecting breakpoints from chain encoded digital arcs. An arc point is declared as a breakpoint if the estimated orientations of the two fitted lines of the two arc segments immediately to the right and left of the arc point are significantly statistically different. The major contributions of this research include developing a method for analytically estimating... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fingerprint image enhancement: algorithm and performance evaluation

    Publication Year: 1998, Page(s):777 - 789
    Cited by:  Papers (619)  |  Patents (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3956 KB)

    In order to ensure that the performance of an automatic fingerprint identification/verification system will be robust with respect to the quality of input fingerprint images, it is essential to incorporate a fingerprint enhancement algorithm in the minutiae extraction module. We present a fast fingerprint enhancement algorithm, which can adaptively improve the clarity of ridge and valley structure... View full abstract»

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

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