IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 4 • April 2015

Filter Results

Displaying Results 1 - 19 of 19
  • Table of contents

    Publication Year: 2015, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (320 KB)
    Freely Available from IEEE
  • IEEE Transactions on Pattern Analysis and Machine Intelligence Editorial Board

    Publication Year: 2015, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (319 KB)
    Freely Available from IEEE
  • A Scalable and Accurate Descriptor for Dynamic Textures Using Bag of System Trees

    Publication Year: 2015, Page(s):697 - 712
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1409 KB) | HTML iconHTML

    The bag-of-systems (BoS) representation is a descriptor of motion in a video, where dynamic texture (DT) codewords represent the typical motion patterns in spatio-temporal patches extracted from the video. The efficacy of the BoS descriptor depends on the richness of the codebook, which depends on the number of codewords in the codebook. However, for even modest sized codebooks, mapping videos ont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deep Reconstruction Models for Image Set Classification

    Publication Year: 2015, Page(s):713 - 727
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB) | HTML iconHTML

    Image set classification finds its applications in a number of real-life scenarios such as classification from surveillance videos, multi-view camera networks and personal albums. Compared with single image based classification, it offers more promises and has therefore attracted significant research attention in recent years. Unlike many existing methods which assume images of a set to lie on a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Weiszfeld Algorithms for Lq Optimization

    Publication Year: 2015, Page(s):728 - 745
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (871 KB) | HTML iconHTML

    In many computer vision applications, a desired model of some type is computed by minimizing a cost function based on several measurements. Typically, one may compute the model that minimizes the L2 cost, that is the sum of squares of measurement errors with respect to the model. However, the Lq solution which minimizes the sum of the qth power of errors usually gives more ro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Individual-Group Modeling for Tracking

    Publication Year: 2015, Page(s):746 - 759
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (615 KB) | HTML iconHTML Multimedia Media

    We present a novel probabilistic framework that jointly models individuals and groups for tracking. Managing groups is challenging, primarily because of their nonlinear dynamics and complex layout which lead to repeated splitting and merging events. The proposed approach assumes a tight relation of mutual support between the modeling of individuals and groups, promoting the idea that groups are be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mirror Surface Reconstruction from a Single Image

    Publication Year: 2015, Page(s):760 - 773
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1545 KB) | HTML iconHTML

    This paper tackles the problem of reconstructing the shape of a smooth mirror surface from a single image. In particular, we consider the case where the camera is observing the reflection of a static reference target in the unknown mirror. We first study the reconstruction problem given dense correspondences between 3D points on the reference target and image locations. In such conditions, our dif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Bayesian Network Classifiers with Reduced Precision Parameters

    Publication Year: 2015, Page(s):774 - 785
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (681 KB) | HTML iconHTML

    Bayesian network classifier (BNCs) are typically implemented on nowadays desktop computers. However, many real world applications require classifier implementation on embedded or low power systems. Aspects for this purpose have not been studied rigorously. We partly close this gap by analyzing reduced precision implementations of BNCs. In detail, we investigate the quantization of the parameters o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Projection Operators and Moment Invariants to Image Blurring

    Publication Year: 2015, Page(s):786 - 802
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2060 KB) | HTML iconHTML

    In this paper we introduce a new theory of blur invariants. Blur invariants are image features which preserve their values if the image is convolved by a point-spread function (PSF) of a certain class. We present the invariants to convolution with an arbitrary N-fold symmetric PSF, both in Fourier and image domain. We introduce a notion of a primordial image as a canonical form of all blur-equival... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query Specific Rank Fusion for Image Retrieval

    Publication Year: 2015, Page(s):803 - 815
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1367 KB) | HTML iconHTML

    Recently two lines of image retrieval algorithms demonstrate excellent scalability: 1) local features indexed by a vocabulary tree, and 2) holistic features indexed by compact hashing codes. Although both of them are able to search visually similar images effectively, their retrieval precision may vary dramatically among queries. Therefore, combining these two types of methods is expected to furth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single and Multiple Object Tracking Using a Multi-Feature Joint Sparse Representation

    Publication Year: 2015, Page(s):816 - 833
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1758 KB) | HTML iconHTML Multimedia Media

    In this paper, we propose a tracking algorithm based on a multi-feature joint sparse representation. The templates for the sparse representation can include pixel values, textures, and edges. In the multi-feature joint optimization, noise or occlusion is dealt with using a set of trivial templates. A sparse weight constraint is introduced to dynamically select the relevant templates from the full ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stereo Matching Using Tree Filtering

    Publication Year: 2015, Page(s):834 - 846
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1960 KB) | HTML iconHTML

    Matching cost aggregation is one of the oldest and still popular methods for stereo correspondence. While effective and efficient, cost aggregation methods typically aggregate the matching cost by summing/averaging over a user-specified, local support region. This is obviously only locally-optimal, and the computational complexity of the full-kernel implementation usually depends on the region siz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stereo Reconstruction of Droplet Flight Trajectories

    Publication Year: 2015, Page(s):847 - 861
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1122 KB) | HTML iconHTML Multimedia Media

    We developed a new method for extracting 3D flight trajectories of droplets using high-speed stereo capture. We noticed that traditional multi-camera tracking techniques fare poorly on our problem, in part due to the fact that all droplets have very similar shapes, sizes and appearances. Our method uses local motion models to track individual droplets in each frame. 2D tracks are used to learn a g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unsupervised Object Class Discovery via Saliency-Guided Multiple Class Learning

    Publication Year: 2015, Page(s):862 - 875
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB) | HTML iconHTML

    In this paper, we tackle the problem of common object (multiple classes) discovery from a set of input images, where we assume the presence of one object class in each image. This problem is, loosely speaking, unsupervised since we do not know a priori about the object type, location, and scale in each image. We observe that the general task of object class discovery in a fully unsupervised manner... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variational Bayesian Matrix Factorization for Bounded Support Data

    Publication Year: 2015, Page(s):876 - 889
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (885 KB) | HTML iconHTML Multimedia Media

    A novel Bayesian matrix factorization method for bounded support data is presented. Each entry in the observation matrix is assumed to be beta distributed. As the beta distribution has two parameters, two parameter matrices can be obtained, which matrices contain only nonnegative values. In order to provide low-rank matrix factorization, the nonnegative matrix factorization (NMF) technique is appl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Normal Estimation of a Transparent Object Using a Video

    Publication Year: 2015, Page(s):890 - 897
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1141 KB) | HTML iconHTML

    Reconstructing transparent objects is a challenging problem. While producing reasonable results for quite complex objects, existing approaches require custom calibration or somewhat expensive labor to achieve high precision. When an overall shape preserving salient and fine details is sufficient, we show in this paper a significant step toward solving the problem when the object's silhouette is av... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universality of the Local Marginal Polytope

    Publication Year: 2015, Page(s):898 - 904
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (603 KB) | HTML iconHTML

    We show that solving the LP relaxation of the min-sum labeling problem (also known as MAP inference problem in graphical models, discrete energy minimization, or valued constraint satisfaction) is not easier than solving any linear program. Precisely, every polytope is linear-time representable by a local marginal polytope and every LP can be reduced in linear time to a linear optimization (allowi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Pattern Analysis and Machine Intelligence Information for Authors

    Publication Year: 2015, Page(s): C3
    Request permission for commercial reuse | PDF file iconPDF (319 KB)
    Freely Available from IEEE
  • IEEE Computer Society [advertisement]

    Publication Year: 2015, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (320 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
Sven Dickinson
University of Toronto
e-mail: sven@cs.toronto.edu