By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 2 • Date Feb. 2011

Filter Results

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

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

    Publication Year: 2011, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (121 KB)
    Freely Available from IEEE
  • Fingerprint Reconstruction: From Minutiae to Phase

    Publication Year: 2011, Page(s):209 - 223
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (9791 KB) | HTML iconHTML

    Fingerprint matching systems generally use four types of representation schemes: grayscale image, phase image, skeleton image, and minutiae, among which minutiae-based representation is the most widely adopted one. The compactness of minutiae representation has created an impression that the minutiae template does not contain sufficient information to allow the reconstruction of the original grays... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hyperconnected Attribute Filters Based on k-Flat Zones

    Publication Year: 2011, Page(s):224 - 239
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3721 KB) | HTML iconHTML

    In this paper, we present a new method for attribute filtering, combining contrast and structural information. Using hyperconnectivity based on k-flat zones, we improve the ability of attribute filters to retain internal details in detected objects. Simultaneously, we improve the suppression of small, unwanted detail in the background. We extend the theory of attribute filters to hyperconnectivity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Extended Grammar System for Learning and Recognizing Complex Visual Events

    Publication Year: 2011, Page(s):240 - 255
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3677 KB) | HTML iconHTML

    For a grammar-based approach to the recognition of visual events, there are two major limitations that prevent it from real application. One is that the event rules are predefined by domain experts, which means huge manual cost. The other is that the commonly used grammar can only handle sequential relations between subevents, which is inadequate to recognize more complex events involving parallel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying Property Testing to an Image Partitioning Problem

    Publication Year: 2011, Page(s):256 - 265
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1336 KB) | HTML iconHTML

    Property testing is a rapidly growing field of research. Typically, a property testing algorithm proceeds by quickly determining whether an input can satisfy some condition, under the assumption that most inputs do not satisfy it. If the input is "far” from satisfying the condition, the algorithm is guaranteed to reject it with high probability. Applying this paradigm to image detection is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Nearest Subspace Search

    Publication Year: 2011, Page(s):266 - 278
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1834 KB) | HTML iconHTML

    Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing popularity of subspace representations, the problem of efficiently searching through large subspace databases has received little attention in the past. In this paper, we present a general solution to the problem of Approximate Nea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coordination of Cluster Ensembles via Exact Methods

    Publication Year: 2011, Page(s):279 - 293
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2675 KB) | HTML iconHTML

    We present a novel optimization-based method for the combination of cluster ensembles for the class of problems with intracluster criteria, such as Minimum-Sum-of-Squares-Clustering (MSSC). We propose a simple and efficient algorithm-called EXAMCE-for this class of problems that is inspired from a Set-Partitioning formulation of the original clustering problem. We prove some theoretical properties... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost-Sensitive Boosting

    Publication Year: 2011, Page(s):294 - 309
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2059 KB) | HTML iconHTML

    A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sensitive learning that 1) expected losses must be minimized by optimal cost-sensitive decision rules and 2) empirical loss minimization must emphasize the neighborhood of the target cost-sensitive boundary. It is shown that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoupled Active Contour (DAC) for Boundary Detection

    Publication Year: 2011, Page(s):310 - 324
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5944 KB) | HTML iconHTML

    The accurate detection of object boundaries via active contours is an ongoing research topic in computer vision. Most active contours converge toward some desired contour by minimizing a sum of internal (prior) and external (image measurement) energy terms. Such an approach is elegant, but suffers from a slow convergence rate and frequently misconverges in the presence of noise or complex contours... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dense Mirroring Surface Recovery from 1D Homographies and Sparse Correspondences

    Publication Year: 2011, Page(s):325 - 337
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2629 KB) | HTML iconHTML

    In this work, we recover the 3D shape of mirrors, sunglasses, and stainless steel implements. A computer monitor displays several images of parallel stripes, each image at a different angle. Reflections of these stripes in a mirroring surface are captured by the camera. For every image point, the direction of the displayed stripes and their reflections in the image are related by a 1D homography m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Linear Discriminant Projections for Dimensionality Reduction of Image Descriptors

    Publication Year: 2011, Page(s):338 - 352
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3411 KB) | HTML iconHTML

    In this paper, we present Linear Discriminant Projections (LDP) for reducing dimensionality and improving discriminability of local image descriptors. We place LDP into the context of state-of-the-art discriminant projections and analyze its properties. LDP requires a large set of training data with point-to-point correspondence ground truth. We demonstrate that training data produced by a simulat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning to Detect a Salient Object

    Publication Year: 2011, Page(s):353 - 367
    Cited by:  Papers (298)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4380 KB) | HTML iconHTML

    In this paper, we study the salient object detection problem for images. We formulate this problem as a binary labeling task where we separate the salient object from the background. We propose a set of novel features, including multiscale contrast, center-surround histogram, and color spatial distribution, to describe a salient object locally, regionally, and globally. A conditional random field ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonconvex Online Support Vector Machines

    Publication Year: 2011, Page(s):368 - 381
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2535 KB) | HTML iconHTML

    In this paper, we propose a nonconvex online Support Vector Machine (SVM) algorithm (LASVM-NC) based on the Ramp Loss, which has the strong ability of suppressing the influence of outliers. Then, again in the online learning setting, we propose an outlier filtering mechanism (LASVM-I) based on approximating nonconvex behavior in convex optimization. These two algorithms are built upon another nove... View full abstract»

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

    Publication Year: 2011, Page(s):382 - 393
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2700 KB) | HTML iconHTML

    We propose an active contour (a.k.a. snake) that takes the shape of an ellipse. Its evolution is driven by surface terms made of two contributions: the integral of the data over an inner ellipse, counterbalanced by the integral of the data over an outer elliptical shell. We iteratively adapt the active contour to maximize the contrast between the two domains, which results in a snake that seeks el... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3D Face Reconstruction from a Single Image Using a Single Reference Face Shape

    Publication Year: 2011, Page(s):394 - 405
    Cited by:  Papers (91)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1996 KB) | HTML iconHTML

    Human faces are remarkably similar in global properties, including size, aspect ratio, and location of main features, but can vary considerably in details across individuals, gender, race, or due to facial expression. We propose a novel method for 3D shape recovery of faces that exploits the similarity of faces. Our method obtains as input a single image and uses a mere single 3D reference model o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct Method for Video-Based Navigation Using a Digital Terrain Map

    Publication Year: 2011, Page(s):406 - 411
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (603 KB) | HTML iconHTML

    A novel vision-based navigation algorithm is proposed. The gray levels of two images, together with a Digital Terrain Map (DTM), are directly utilized to define constraints on the navigation parameters. The feasibility of the algorithm is examined both under a simulated environment and using real flight data. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Laplacian Approach to Multi-Oriented Text Detection in Video

    Publication Year: 2011, Page(s):412 - 419
    Cited by:  Papers (110)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1494 KB) | HTML iconHTML

    In this paper, we propose a method based on the Laplacian in the frequency domain for video text detection. Unlike many other approaches which assume that text is horizontally-oriented, our method is able to handle text of arbitrary orientation. The input image is first filtered with Fourier-Laplacian. K-means clustering is then used to identify candidate text regions based on the maximum differen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overcoming Shadows in 3-Source Photometric Stereo

    Publication Year: 2011, Page(s):419 - 426
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1466 KB) | HTML iconHTML

    Light occlusions are one of the most significant difficulties of photometric stereo methods. When three or more images are available without occlusion, the local surface orientation is overdetermined so that shape can be computed and the shadowed pixels can be discarded. In this paper, we look at the challenging case when only two images are available without occlusion, leading to a one degree of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topology Preserving Relaxation Labeling for Nonrigid Point Matching

    Publication Year: 2011, Page(s):427 - 432
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB) | HTML iconHTML

    This paper presents a relaxation labeling process with the newly defined compatibility measure for solving a general nonrigid point matching problem. In the literature, there exists a point matching method using relaxation labeling; however, the compatibility coefficient takes a binary value of zero or one depending on whether a point and a neighbor have corresponding points. Our approach generali... 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: 2011, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (121 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2011, Page(s): c4
    Request permission for commercial reuse | 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
e-mail: daf@illinois.edu