By Topic

Image Processing, IEEE Transactions on

Issue 4 • Date April 2013

Filter Results

Displaying Results 1 - 25 of 45
  • [Front cover]

    Publication Year: 2013 , Page(s): C1
    Request Permissions | PDF file iconPDF (117 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Image Processing publication information

    Publication Year: 2013 , Page(s): C2
    Request Permissions | PDF file iconPDF (132 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2013 , Page(s): 1263 - 1266
    Request Permissions | PDF file iconPDF (426 KB)  
    Freely Available from IEEE
  • Nonlinearity Detection in Hyperspectral Images Using a Polynomial Post-Nonlinear Mixing Model

    Publication Year: 2013 , Page(s): 1267 - 1276
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (828 KB) |  | HTML iconHTML  

    This paper studies a nonlinear mixing model for hyperspectral image unmixing and nonlinearity detection. The proposed model assumes that the pixel reflectances are nonlinear functions of pure spectral components contaminated by an additive white Gaussian noise. These nonlinear functions are approximated by polynomials leading to a polynomial post-nonlinear mixing model. We have shown in a previous... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelet Bayesian Network Image Denoising

    Publication Year: 2013 , Page(s): 1277 - 1290
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (819 KB) |  | HTML iconHTML  

    From the perspective of the Bayesian approach, the denoising problem is essentially a prior probability modeling and estimation task. In this paper, we propose an approach that exploits a hidden Bayesian network, constructed from wavelet coefficients, to model the prior probability of the original image. Then, we use the belief propagation (BP) algorithm, which estimates a coefficient based on all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Acceleration of the Shiftable mbi{O}{(1)} Algorithm for Bilateral Filtering and Nonlocal Means

    Publication Year: 2013 , Page(s): 1291 - 1300
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (770 KB) |  | HTML iconHTML  

    A direct implementation of the bilateral filter requires Os2) operations per pixel, where σs is the (effective) width of the spatial kernel. A fast implementation of the bilateral filter that required O(1) operations per pixel with respect to σs was recently proposed. This was done by using trigonometric functions for the range k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining the Intrinsic Dimension of a Hyperspectral Image Using Random Matrix Theory

    Publication Year: 2013 , Page(s): 1301 - 1310
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (410 KB) |  | HTML iconHTML  

    Determining the intrinsic dimension of a hyperspectral image is an important step in the spectral unmixing process and under- or overestimation of this number may lead to incorrect unmixing in unsupervised methods. In this paper, we discuss a new method for determining the intrinsic dimension using recent advances in random matrix theory. This method is entirely unsupervised, free from any user-de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Smooth Pattern Transformation Manifolds

    Publication Year: 2013 , Page(s): 1311 - 1325
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (675 KB) |  | HTML iconHTML  

    Manifold models provide low-dimensional representations that are useful for processing and analyzing data in a transformation-invariant way. In this paper, we study the problem of learning smooth pattern transformation manifolds from image sets that represent observations of geometrically transformed signals. To construct a manifold, we build a representative pattern whose transformations accurate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modifying JPEG Binary Arithmetic Codec for Exploiting Inter/Intra-Block and DCT Coefficient Sign Redundancies

    Publication Year: 2013 , Page(s): 1326 - 1339
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (515 KB) |  | HTML iconHTML  

    This article presents four modifications to the JPEG arithmetic coding (JAC) algorithm, a topic not studied well before. It then compares the compression performance of the modified JPEG with JPEG XR, the latest block-based image coding standard. We first show that the bulk of inter/intra-block redundancy, caused due to the use of the block-based approach by JPEG, can be captured by applying effic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Motion Estimation Without Integer-Pel Search

    Publication Year: 2013 , Page(s): 1340 - 1353
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1220 KB) |  | HTML iconHTML  

    The typical motion estimation (ME) consists of three main steps, including spatial-temporal prediction, integer-pel search, and fractional-pel search. The integer-pel search, which seeks the best matched integer-pel position within a search window, is considered to be crucial for video encoding. It occupies over 50% of the overall encoding time (when adopting the full search scheme) for software e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Protocol for Evaluating Video Trackers Under Real-World Conditions

    Publication Year: 2013 , Page(s): 1354 - 1361
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (548 KB) |  | HTML iconHTML  

    The absence of a commonly adopted performance evaluation framework is hampering advances in the design of effective video trackers. In this paper, we present a single-score evaluation measure and a protocol to objectively compare trackers. The proposed measure evaluates tracking accuracy and failure, and combines them for both summative and formative performance assessment. The proposed protocol i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blur and Illumination Robust Face Recognition via Set-Theoretic Characterization

    Publication Year: 2013 , Page(s): 1362 - 1372
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1058 KB) |  | HTML iconHTML  

    We address the problem of unconstrained face recognition from remotely acquired images. The main factors that make this problem challenging are image degradation due to blur, and appearance variations due to illumination and pose. In this paper, we address the problems of blur and illumination. We show that the set of all images obtained by blurring a given image forms a convex set. Based on this ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Bounds for Subband-Adaptive Iterative Shrinkage/Thresholding Algorithms

    Publication Year: 2013 , Page(s): 1373 - 1381
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (449 KB) |  | HTML iconHTML  

    This paper presents new methods for computing the step sizes of the subband-adaptive iterative shrinkage-thresholding algorithms proposed by Bayram & Selesnick and Vonesch & Unser. The method yields tighter wavelet-domain bounds of the system matrix, thus leading to improved convergence speeds. It is directly applicable to non-redundant wavelet bases, and we also adapt it for cases of redu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparse Representation Based Image Interpolation With Nonlocal Autoregressive Modeling

    Publication Year: 2013 , Page(s): 1382 - 1394
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2147 KB) |  | HTML iconHTML  

    Sparse representation is proven to be a promising approach to image super-resolution, where the low-resolution (LR) image is usually modeled as the down-sampled version of its high-resolution (HR) counterpart after blurring. When the blurring kernel is the Dirac delta function, i.e., the LR image is directly down-sampled from its HR counterpart without blurring, the super-resolution problem become... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • View-Based Discriminative Probabilistic Modeling for 3D Object Retrieval and Recognition

    Publication Year: 2013 , Page(s): 1395 - 1407
    Cited by:  Papers (8)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1159 KB) |  | HTML iconHTML  

    In view-based 3D object retrieval and recognition, each object is described by multiple views. A central problem is how to estimate the distance between two objects. Most conventional methods integrate the distances of view pairs across two objects as an estimation of their distance. In this paper, we propose a discriminative probabilistic object modeling approach. It builds probabilistic models f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Document Image Binarization Technique for Degraded Document Images

    Publication Year: 2013 , Page(s): 1408 - 1417
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3201 KB) |  | HTML iconHTML  

    Segmentation of text from badly degraded document images is a very challenging task due to the high inter/intra-variation between the document background and the foreground text of different document images. In this paper, we propose a novel document image binarization technique that addresses these issues by using adaptive image contrast. The adaptive image contrast is a combination of the local ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perceptual Video Coding Based on SSIM-Inspired Divisive Normalization

    Publication Year: 2013 , Page(s): 1418 - 1429
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1445 KB) |  | HTML iconHTML  

    We propose a perceptual video coding framework based on the divisive normalization scheme, which is found to be an effective approach to model the perceptual sensitivity of biological vision, but has not been fully exploited in the context of video coding. At the macroblock (MB) level, we derive the normalization factors based on the structural similarity (SSIM) index as an attempt to transform th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hyperspectral Image Representation and Processing With Binary Partition Trees

    Publication Year: 2013 , Page(s): 1430 - 1443
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1850 KB) |  | HTML iconHTML  

    The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image-processing tools. This paper proposes the construction and the processing of a new region-based hierarchical hyperspectral image representation relying on the binary partition tree (BPT). This hierarchical region-based representation can be interpreted as a set of hierarchical re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visually Weighted Compressive Sensing: Measurement and Reconstruction

    Publication Year: 2013 , Page(s): 1444 - 1455
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (899 KB) |  | HTML iconHTML  

    Compressive sensing (CS) makes it possible to more naturally create compact representations of data with respect to a desired data rate. Through wavelet decomposition, smooth and piecewise smooth signals can be represented as sparse and compressible coefficients. These coefficients can then be effectively compressed via the CS. Since a wavelet transform divides image information into layered block... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context-Aware Sparse Decomposition for Image Denoising and Super-Resolution

    Publication Year: 2013 , Page(s): 1456 - 1469
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1959 KB) |  | HTML iconHTML  

    Image prior models based on sparse and redundant representations are attracting more and more attention in the field of image restoration. The conventional sparsity-based methods enforce sparsity prior on small image patches independently. Unfortunately, these works neglected the contextual information between sparse representations of neighboring image patches. It limits the modeling capability o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to SAIF-ly Boost Denoising Performance

    Publication Year: 2013 , Page(s): 1470 - 1485
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (5190 KB) |  | HTML iconHTML  

    Spatial domain image filters (e.g., bilateral filter, non-local means, locally adaptive regression kernel) have achieved great success in denoising. Their overall performance, however, has not generally surpassed the leading transform domain-based filters (such as BM3-D). One important reason is that spatial domain filters lack efficiency to adaptively fine tune their denoising strength; something... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frozen-State Hierarchical Annealing

    Publication Year: 2013 , Page(s): 1486 - 1497
    Request Permissions | Click to expandAbstract | PDF file iconPDF (6535 KB) |  | HTML iconHTML  

    There is significant interest in the synthesis of discrete-state random fields, particularly those possessing structure over a wide range of scales. However, given a model on some finest, pixellated scale, it is computationally very difficult to synthesize both large- and small-scale structures, motivating research into hierarchical methods. In this paper, we propose a frozen-state approach to hie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Per-Colorant-Channel Color Barcodes for Mobile Applications: An Interference Cancellation Framework

    Publication Year: 2013 , Page(s): 1498 - 1511
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1839 KB) |  | HTML iconHTML  

    We propose a color barcode framework for mobile phone applications by exploiting the spectral diversity afforded by the cyan (C), magenta (M), and yellow (Y) print colorant channels commonly used for color printing and the complementary red (R), green (G), and blue (B) channels, respectively, used for capturing color images. Specifically, we exploit this spectral diversity to realize a three-fold ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmented Gray-Code Kernels for Fast Pattern Matching

    Publication Year: 2013 , Page(s): 1512 - 1525
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1212 KB) |  | HTML iconHTML  

    The gray-code kernels (GCK) family, which has Walsh Hadamard transform on sliding windows as a member, is a family of kernels that can perform image analysis efficiently using a fast algorithm, such as the GCK algorithm. The GCK has been successfully used for pattern matching. In this paper, we propose that the G4-GCK algorithm is more efficient than the previous algorithm in computing GCK. The G4... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Video Processing for Human Perceptual Visual Quality-Oriented Video Coding

    Publication Year: 2013 , Page(s): 1526 - 1535
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1688 KB) |  | HTML iconHTML  

    We have developed a video processing method that achieves human perceptual visual quality-oriented video coding. The patterns of moving objects are modeled by considering the limited human capacity for spatial-temporal resolution and the visual sensory memory together, and an online moving pattern classifier is devised by using the Hedge algorithm. The moving pattern classifier is embedded in the ... View full abstract»

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

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