By Topic

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 1 • Date Jan. 2012

Filter Results

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

    Publication Year: 2012, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (159 KB)
    Freely Available from IEEE
  • [Cover 2]

    Publication Year: 2012, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • State of the Journal

    Publication Year: 2012, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (48 KB)
    Freely Available from IEEE
  • A Unified Framework for Biometric Expert Fusion Incorporating Quality Measures

    Publication Year: 2012, Page(s):3 - 18
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1822 KB) | HTML iconHTML

    This paper proposes a unified framework for quality-based fusion of multimodal biometrics. Quality-dependent fusion algorithms aim to dynamically combine several classifier (biometric expert) outputs as a function of automatically derived (biometric) sample quality. Quality measures used for this purpose quantify the degree of conformance of biometric samples to some predefined criteria known to i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind Separation of Superimposed Moving Images Using Image Statistics

    Publication Year: 2012, Page(s):19 - 32
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3039 KB) | HTML iconHTML

    We address the problem of blind separation of multiple source layers from their linear mixtures with unknown mixing coefficients and unknown layer motions. Such mixtures can occur when one takes photos through a transparent medium, like a window glass, and the camera or the medium moves between snapshots. To understand how to achieve correct separation, we study the statistics of natural images in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building Development Monitoring in Multitemporal Remotely Sensed Image Pairs with Stochastic Birth-Death Dynamics

    Publication Year: 2012, Page(s):33 - 50
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3906 KB) | HTML iconHTML

    In this paper, we introduce a new probabilistic method which integrates building extraction with change detection in remotely sensed image pairs. A global optimization process attempts to find the optimal configuration of buildings, considering the observed data, prior knowledge, and interactions between the neighboring building parts. We present methodological contributions in three key issues: 1... View full abstract»

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

    Publication Year: 2012, Page(s):51 - 65
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2637 KB) | HTML iconHTML

    While the study of geometry has mainly concentrated on single viewpoint (SVP) cameras, there is growing attention to more general non-SVP systems. Here, we study an important class of systems that inherently have a non-SVP: a perspective camera imaging through an interface into a medium. Such systems are ubiquitous: They are common when looking into water-based environments. The paper analyzes the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LDAHash: Improved Matching with Smaller Descriptors

    Publication Year: 2012, Page(s):66 - 78
    Cited by:  Papers (79)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2343 KB) | HTML iconHTML

    SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to be invariant to certain classes of photometric and geometric transformations, in particular, affine and intensity scale transformations. However... View full abstract»

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

    Publication Year: 2012, Page(s):79 - 93
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1979 KB) | HTML iconHTML Multimedia Media

    We present a novel probabilistic framework that fuses information coming from the audio and video modality to perform speaker diarization. The proposed framework is a Dynamic Bayesian Network (DBN) that is an extension of a factorial Hidden Markov Model (fHMM) and models the people appearing in an audiovisual recording as multimodal entities that generate observations in the audio stream, the vide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Objective Assessment of Multiresolution Image Fusion Algorithms for Context Enhancement in Night Vision: A Comparative Study

    Publication Year: 2012, Page(s):94 - 109
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6307 KB) | HTML iconHTML Multimedia Media

    Comparison of image processing techniques is critically important in deciding which algorithm, method, or metric to use for enhanced image assessment. Image fusion is a popular choice for various image enhancement applications such as overlay of two image products, refinement of image resolutions for alignment, and image combination for feature extraction and target recognition. Since image fusion... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Sensor Bias in Experimental Methods for Comparing Interest-Point, Saliency, and Recognition Algorithms

    Publication Year: 2012, Page(s):110 - 126
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1970 KB) | HTML iconHTML Multimedia Media

    Most current algorithm evaluation protocols use large image databases, but give little consideration to imaging characteristics used to create the data sets. This paper evaluates the effects of camera shutter speed and voltage gain under simultaneous changes in illumination and demonstrates significant differences in the sensitivities of popular vision algorithms under variable illumination, shutt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Evaluation of Full Search Equivalent Pattern Matching Algorithms

    Publication Year: 2012, Page(s):127 - 143
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3370 KB) | HTML iconHTML

    Pattern matching is widely used in signal processing, computer vision, and image and video processing. Full search equivalent algorithms accelerate the pattern matching process and, in the meantime, yield exactly the same result as the full search. This paper proposes an analysis and comparison of state-of-the-art algorithms for full search equivalent pattern matching. Our intention is that the da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic Models for Inference about Identity

    Publication Year: 2012, Page(s):144 - 157
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2062 KB) | HTML iconHTML

    Many face recognition algorithms use “distance-based” methods: Feature vectors are extracted from each face and distances in feature space are compared to determine matches. In this paper, we argue for a fundamentally different approach. We consider each image as having been generated from several underlying causes, some of which are due to identity (latent identity variables, or LIV... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Angular Embedding: A Robust Quadratic Criterion

    Publication Year: 2012, Page(s):158 - 173
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1656 KB) | HTML iconHTML

    Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a near-global optimal eigensolution. As a quadratic criterion in the complex domain, AE is remarkably robust to outliers, unlike its real domain counterpart LS, the least squares embedding. Our comparative study of LS and AE reveals that AE's robustness is due not to the particular choice... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature Selection with Conjunctions of Decision Stumps and Learning from Microarray Data

    Publication Year: 2012, Page(s):174 - 186
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1071 KB) | HTML iconHTML

    One of the objectives of designing feature selection learning algorithms is to obtain classifiers that depend on a small number of attributes and have verifiable future performance guarantees. There are few, if any, approaches that successfully address the two goals simultaneously. To the best of our knowledge, such algorithms that give theoretical bounds on the future performance have not been pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparse Algorithms Are Not Stable: A No-Free-Lunch Theorem

    Publication Year: 2012, Page(s):187 - 193
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We show that these two properties are fundamentally at odds with each other: A sparse algorithm cannot be stable and vice versa. Thus, one has to trade off sparsity and stability in designing a learning algorithm. In particular, our gen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Signature: Highlighting Sparse Salient Regions

    Publication Year: 2012, Page(s):194 - 201
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1725 KB) | HTML iconHTML

    We introduce a simple image descriptor referred to as the image signature. We show, within the theoretical framework of sparse signal mixing, that this quantity spatially approximates the foreground of an image. We experimentally investigate whether this approximate foreground overlaps with visually conspicuous image locations by developing a saliency algorithm based on the image signature. This s... View full abstract»

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

    Publication Year: 2012, Page(s):202 - 206
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Special Issue on Learning Deep Architectures

    Publication Year: 2012, Page(s): 207
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • ECCV 2012 Call for Papers

    Publication Year: 2012, Page(s): 208
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • 2011 Annual Index

    Publication Year: 2012, Page(s): Not in print
    Request permission for commercial reuse | PDF file iconPDF (714 KB)
    Freely Available from IEEE
  • TPAMI Information for authors

    Publication Year: 2012, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • [Cover 4]

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