Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Pattern Analysis and Machine Intelligence

Issue 8 • Aug. 2015

Filter Results

Displaying Results 1 - 20 of 20
  • Table of Contents

    Publication Year: 2015, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (309 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 (296 KB)
    Freely Available from IEEE
  • A Semidefinite Programming Based Search Strategy for Feature Selection with Mutual Information Measure

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

    Feature subset selection, as a special case of the general subset selection problem, has been the topic of a considerable number of studies due to the growing importance of data-mining applications. In the feature subset selection problem there are two main issues that need to be addressed: (i) Finding an appropriate measure function than can be fairly fast and robustly computed for high-dimension... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Unsupervised and Supervised Constraints for Subspace Clustering

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

    Data in many image and video analysis tasks can be viewed as points drawn from multiple low-dimensional subspaces with each subspace corresponding to one category or class. One basic task for processing such kind of data is to separate the points according to the underlying subspace, referred to as subspace clustering. Extensive studies have been made on this subject, and nearly all of them use un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Edge Detection Using Structured Forests

    Publication Year: 2015, Page(s):1558 - 1570
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2405 KB) | HTML iconHTML

    Edge detection is a critical component of many vision systems, including object detectors and image segmentation algorithms. Patches of edges exhibit well-known forms of local structure, such as straight lines or T-junctions. In this paper we take advantage of the structure present in local image patches to learn both an accurate and computationally efficient edge detector. We formulate the proble... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Discriminative Collections of Part Detectors for Object Recognition

    Publication Year: 2015, Page(s):1571 - 1584
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1351 KB) | HTML iconHTML

    We propose a method to learn a diverse collection of discriminative parts from object bounding box annotations. Part detectors can be trained and applied individually, which simplifies learning and extension to new features or categories. We apply the parts to object category detection, pooling part detections within bottom-up proposed regions and using a boosted classifier with proposed sigmoid w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-Region Active Contours with a Single Level Set Function

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

    Segmenting an image into an arbitrary number of coherent regions is at the core of image understanding. Many formulations of the segmentation problem have been suggested over the past years. These formulations include, among others, axiomatic functionals, which are hard to implement and analyze, and graph-based alternatives, which impose a non-geometric metric on the problem. We propose a novel me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Normalized Compression Distance of Multisets with Applications

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

    Pairwise normalized compression distance (NCD) is a parameter-free, feature-free, alignment-free, similarity metric based on compression. We propose an NCD of multisets that is also metric. Previously, attempts to obtain such an NCD failed. For classification purposes it is superior to the pairwise NCD in accuracy and implementation complexity. We cover the entire trajectory from theoretical under... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Order Preserving Sparse Coding

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

    In this paper, we investigate order-preserving sparse coding for classifying structured data whose atomic features possess ordering relationships. Examples include time sequences where individual frame-wise features are temporally ordered, as well as still images (landscape, street view, etc.) where different regions of the image are spatially ordered. Classification of these structured data is of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Person Re-Identification by Iterative Re-Weighted Sparse Ranking

    Publication Year: 2015, Page(s):1629 - 1642
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1911 KB) | HTML iconHTML Multimedia Media

    In this paper we introduce a method for person re-identification based on discriminative, sparse basis expansions of targets in terms of a labeled gallery of known individuals. We propose an iterative extension to sparse discriminative classifiers capable of ranking many candidate targets. The approach makes use of soft- and hard- re-weighting to redistribute energy among the most relevant contrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pose Estimation and Segmentation of Multiple People in Stereoscopic Movies

    Publication Year: 2015, Page(s):1643 - 1655
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2138 KB) | HTML iconHTML

    We describe a method to obtain a pixel-wise segmentation and pose estimation of multiple people in stereoscopic videos. This task involves challenges such as dealing with unconstrained stereoscopic video, non-stationary cameras, and complex indoor and outdoor dynamic scenes with multiple people. We cast the problem as a discrete labelling task involving multiple person labels, devise a suitable co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Re-Identification in the Function Space of Feature Warps

    Publication Year: 2015, Page(s):1656 - 1669
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1668 KB) | HTML iconHTML Multimedia Media

    Person re-identification in a non-overlapping multicamera scenario is an open challenge in computer vision because of the large changes in appearances caused by variations in viewing angle, lighting, background clutter, and occlusion over multiple cameras. As a result of these variations, features describing the same person get transformed between cameras. To model the transformation of features, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape, Illumination, and Reflectance from Shading

    Publication Year: 2015, Page(s):1670 - 1687
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2184 KB) | HTML iconHTML Multimedia Media

    A fundamental problem in computer vision is that of inferring the intrinsic, 3D structure of the world from flat, 2D images of that world. Traditional methods for recovering scene properties such as shape, reflectance, or illumination rely on multiple observations of the same scene to overconstrain the problem. Recovering these same properties from a single image seems almost impossible in compari... View full abstract»

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

    Publication Year: 2015, Page(s):1688 - 1701
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 KB) | HTML iconHTML Multimedia Media

    Tree-like structures are fundamental in nature, and it is often useful to reconstruct the topology of a tree - what connects to what - from a two-dimensional image of it. However, the projected branches often cross in the image: the tree projects to a planar graph, and the inverse problem of reconstructing the topology of the tree from that of the graph is ill-posed. We regularize this problem wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-Aliasing Correlation Filters for Object Recognition

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

    Correlation filters (CFs) are a class of classifiers that are attractive for object localization and tracking applications. Traditionally, CFs have been designed in the frequency domain using the discrete Fourier transform (DFT), where correlation is efficiently implemented. However, existing CF designs do not account for the fact that the multiplication of two DFTs in the frequency domain corresp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Meta-Parameter Free Unsupervised Sparse Feature Learning

    Publication Year: 2015, Page(s):1716 - 1722
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    We propose a meta-parameter free, off-the-shelf, simple and fast unsupervised feature learning algorithm, which exploits a new way of optimizing for sparsity. Experiments on CIFAR-10, STL-10 and UCMerced show that the method achieves the state-of-the-art performance, providing discriminative features that generalize well. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sketch Matching on Topology Product Graph

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

    Sketch matching is the fundamental problem in sketch based interfaces. After years of study, it remains challenging when there exists large irregularity and variations in the hand drawn sketch shapes. While most existing works exploit topology relations and graph representations for this problem, they are usually limited by the coarse topology exploration and heuristic (thus suboptimal) similarity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3D Palmprint Identification Using Block-Wise Features and Collaborative Representation

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

    Developing 3D palmprint recognition systems has recently begun to draw attention of researchers. Compared with its 2D counterpart, 3D palmprint has several unique merits. However, most of the existing 3D palmprint matching methods are designed for one-to-one verification and they are not efficient to cope with the one-to-many identification case. In this paper, we fill this gap by proposing a coll... 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 (296 KB)
    Freely Available from IEEE
  • IEEE Computer Society

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