By Topic

IEEE Transactions on Image Processing

Issue 10 • Date Oct. 2012

Filter Results

Displaying Results 1 - 21 of 21
  • Table of contents

    Publication Year: 2012, Page(s):C1 - 4321
    Request permission for commercial reuse | PDF file iconPDF (410 KB)
    Freely Available from IEEE
  • IEEE Transactions on Image Processing publication information

    Publication Year: 2012, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (135 KB)
    Freely Available from IEEE
  • Efficient Algorithm for Nonconvex Minimization and Its Application to PM Regularization

    Publication Year: 2012, Page(s):4322 - 4333
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1093 KB) | HTML iconHTML

    In image processing, nonconvex regularization has the ability to smooth homogeneous regions and sharpen edges but leads to challenging computation. We propose some iterative schemes to minimize the energy function with nonconvex edge-preserving potential. The schemes are derived from the duality-based algorithm proposed by Bermúdez and Moreno and the fixed point iteration. The convergence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Appearance Modeling for Video Tracking: Survey and Evaluation

    Publication Year: 2012, Page(s):4334 - 4348
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1039 KB) | HTML iconHTML

    Long-term video tracking is of great importance for many applications in real-world scenarios. A key component for achieving long-term tracking is the tracker's capability of updating its internal representation of targets (the appearance model) to changing conditions. Given the rapid but fragmented development of this research area, we propose a unified conceptual framework for appearance model a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual Classification With Multitask Joint Sparse Representation

    Publication Year: 2012, Page(s):4349 - 4360
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1266 KB) | HTML iconHTML

    We address the problem of visual classification with multiple features and/or multiple instances. Motivated by the recent success of multitask joint covariate selection, we formulate this problem as a multitask joint sparse representation model to combine the strength of multiple features and/or instances for recognition. A joint sparsity-inducing norm is utilized to enforce class-level joint spar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shadow Removal Using Bilateral Filtering

    Publication Year: 2012, Page(s):4361 - 4368
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (769 KB) | HTML iconHTML

    In this paper, we propose a simple but effective shadow removal method using a single input image. We first derive a 2-D intrinsic image from a single RGB camera image based solely on colors, particularly chromaticity. We next present a method to recover a 3-D intrinsic image based on bilateral filtering and the 2-D intrinsic image. The luminance contrast in regions with similar surface reflectanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Weighted Graph Transformation Matching for Rigid and Nonrigid Image Registration

    Publication Year: 2012, Page(s):4369 - 4382
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2455 KB) | HTML iconHTML

    This paper presents an automatic point matching algorithm for establishing accurate match correspondences in two or more images. The proposed algorithm utilizes a group of feature points to explore their geometrical relationship in a graph arrangement. The algorithm starts with a set of matches (including outliers) between the two images. A set of nondirectional graphs is then generated for each f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Filtering in the Diffeomorphism Group and the Registration of Point Sets

    Publication Year: 2012, Page(s):4383 - 4396
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1850 KB) | HTML iconHTML

    The registration of a pair of point sets as well as the estimation of their pointwise correspondences is a challenging and important task in computer vision. In this paper, we present a method to estimate the diffeomorphic deformation, together with the pointwise correspondences, between a pair of point sets. Many of the registration problems are iteratively solved by estimating the correspondence... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Video Hashing via Multilinear Subspace Projections

    Publication Year: 2012, Page(s):4397 - 4409
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1097 KB) | HTML iconHTML

    The goal of video hashing is to design hash functions that summarize videos by short fingerprints or hashes. While traditional applications of video hashing lie in database searches and content authentication, the emergence of websites such as YouTube and DailyMotion poses a challenging problem of anti-piracy video search. That is, hashes or fingerprints of an original video (provided to YouTube b... View full abstract»

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

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

    In this paper, we propose a simple but effective image transform, called the epipolar distance transform, for matching low-texture regions. It converts image intensity values to a relative location inside a planar segment along the epipolar line, such that pixels in the low-texture regions become distinguishable. We theoretically prove that the transform is affine invariant, thus the transformed i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variational Algorithms to Remove Stationary Noise: Applications to Microscopy Imaging

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

    A framework and an algorithm are presented in order to remove stationary noise from images. This algorithm is called variational stationary noise remover. It can be interpreted both as a restoration method in a Bayesian framework and as a cartoon+texture decomposition method. In numerous denoising applications, the white noise assumption fails. For example, structured patterns such as stripes appe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovering Missing Slices of the Discrete Fourier Transform Using Ghosts

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

    The discrete Fourier transform (DFT) underpins the solution to many inverse problems commonly possessing missing or unmeasured frequency information. This incomplete coverage of the Fourier space always produces systematic artifacts called Ghosts. In this paper, a fast and exact method for deconvolving cyclic artifacts caused by missing slices of the DFT using redundant image regions is presented.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient HIK SVM Learning for Image Classification

    Publication Year: 2012, Page(s):4442 - 4453
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (350 KB) | HTML iconHTML

    Histograms are used in almost every aspect of image processing and computer vision, from visual descriptors to image representations. Histogram intersection kernel (HIK) and support vector machine (SVM) classifiers are shown to be very effective in dealing with histograms. This paper presents contributions concerning HIK SVM for image classification. First, we propose intersection coordinate desce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object Tracking via Partial Least Squares Analysis

    Publication Year: 2012, Page(s):4454 - 4465
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2242 KB) | HTML iconHTML

    We propose an object tracking algorithm that learns a set of appearance models for adaptive discriminative object representation. In this paper, object tracking is posed as a binary classification problem in which the correlation of object appearance and class labels from foreground and background is modeled by partial least squares (PLS) analysis, for generating a low-dimensional discriminative f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Manifold–Manifold Distance and its Application to Face Recognition With Image Sets

    Publication Year: 2012, Page(s):4466 - 4479
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1145 KB) | HTML iconHTML

    In this paper, we address the problem of classifying image sets for face recognition, where each set contains images belonging to the same subject and typically covering large variations. By modeling each image set as a manifold, we formulate the problem as the computation of the distance between two manifolds, called manifold-manifold distance (MMD). Since an image set can come in three pattern l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spline Regression Hashing for Fast Image Search

    Publication Year: 2012, Page(s):4480 - 4491
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1154 KB) | HTML iconHTML

    Techniques for fast image retrieval over large databases have attracted considerable attention due to the rapid growth of web images. One promising way to accelerate image search is to use hashing technologies, which represent images by compact binary codewords. In this way, the similarity between images can be efficiently measured in terms of the Hamming distance between their corresponding binar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completed Local Binary Count for Rotation Invariant Texture Classification

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

    In this brief, a novel local descriptor, named local binary count (LBC), is proposed for rotation invariant texture classification. The proposed LBC can extract the local binary grayscale difference information, and totally abandon the local binary structural information. Although the LBC codes do not represent visual microstructure, the statistics of LBC features can represent the local texture e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ridge Network Detection in Crumpled Paper via Graph Density Maximization

    Publication Year: 2012, Page(s):4498 - 4502
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (886 KB) | HTML iconHTML

    Crumpled sheets of paper tend to exhibit a specific and complex structure, which is described by physicists as ridge networks. Existing literature shows that the automation of ridge network detection in crumpled paper is very challenging because of its complex structure and measuring distortion. In this paper, we propose to model the ridge network as a weighted graph and formulate the ridge networ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Image Processing information for authors

    Publication Year: 2012, Page(s):4503 - 4504
    Request permission for commercial reuse | PDF file iconPDF (129 KB)
    Freely Available from IEEE
  • IEEE Signal Processing Society Information

    Publication Year: 2012, Page(s): C3
    Request permission for commercial reuse | PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • [Blank page - back cover]

    Publication Year: 2012, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (5 KB)
    Freely Available from IEEE

Aims & Scope

IEEE Transactions on Image Processing focuses on signal-processing aspects of image processing, imaging systems, and image scanning, display, and printing.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Scott Acton
University of Virginia
Charlottesville, VA, USA
E-mail: acton@virginia.edu 
Phone: +1 434-982-2003