# IEEE Transactions on Image Processing

## Filter Results

Displaying Results 1 - 25 of 29

Publication Year: 2011, Page(s):C1 - C4
| |PDF (130 KB)
• ### IEEE Transactions on Image Processing publication information

Publication Year: 2011, Page(s): C2
| |PDF (39 KB)
• ### Steerable Pyramids and Tight Wavelet Frames in $L_{2}({BBR}^{d})$

Publication Year: 2011, Page(s):2705 - 2721
Cited by:  Papers (44)
| |PDF (3649 KB) | HTML

We present a functional framework for the design of tight steerable wavelet frames in any number of dimensions. The 2-D version of the method can be viewed as a generalization of Simoncelli's steerable pyramid that gives access to a larger palette of steerable wavelets via a suitable parametrization. The backbone of our construction is a primal isotropic wavelet frame that provides the multiresolu... View full abstract»

• ### Computation of Level-Set Components From Level Lines

Publication Year: 2011, Page(s):2722 - 2729
Cited by:  Papers (1)
| |PDF (800 KB) | HTML

We present an algorithm to compute the connected components of upper or lower level sets from level lines. The running time is O(n + |τ|), where n is the size of the image and |τ| is the number of level lines. View full abstract»

• ### Video Keyframe Analysis Using a Segment-Based Statistical Metric in a Visually Sensitive Parametric Space

Publication Year: 2011, Page(s):2730 - 2737
Cited by:  Papers (12)
| |PDF (1047 KB) | HTML

This paper addresses a new approach to the keyframe extraction problem employing generalized Gaussian density (GGD) parameters of wavelet transform subbands along with Kullback-Leibler distance (KLD) measurement. Shot and cluster boundaries are selected using KLDs between GGD feature vectors, and then keyframes are located based on similarity and dissimilarity criteria. Objective and subjective ev... View full abstract»

• ### Zernike-Moment-Based Image Super Resolution

Publication Year: 2011, Page(s):2738 - 2747
Cited by:  Papers (53)
| |PDF (2167 KB) | HTML

Multiframe super-resolution (SR) reconstruction aims to produce a high-resolution (HR) image using a set of low-resolution (LR) images. In the process of reconstruction, fuzzy registration usually plays a critical role. It mainly focuses on the correlation between pixels of the candidate and the reference images to reconstruct each pixel by averaging all its neighboring pixels. Therefore, the fuzz... View full abstract»

• ### A Generalized Accelerated Proximal Gradient Approach for Total-Variation-Based Image Restoration

Publication Year: 2011, Page(s):2748 - 2759
Cited by:  Papers (41)
| |PDF (1706 KB) | HTML

This paper proposes a generalized accelerated proximal gradient (GAPG) approach for solving total variation (TV)-based image restoration problems. The GAPG algorithm generalizes the original APG algorithm by replacing the Lipschitz constant with an appropriate positive-definite matrix, resulting in faster convergence. For TV-based image restoration problems, we further introduce two auxiliary vari... View full abstract»

• ### Real-Time Artifact-Free Image Upscaling

Publication Year: 2011, Page(s):2760 - 2768
Cited by:  Papers (86)
| |PDF (932 KB) | HTML

The problem of creating artifact-free upscaled images appearing sharp and natural to the human observer is probably more interesting and less trivial than it may appear. The solution to the problem, often referred to also as “single-image super-resolution,” is related both to the statistical relationship between low-resolution and high-resolution image sampling and to the human perce... View full abstract»

• ### Hallucinating Face in the DCT Domain

Publication Year: 2011, Page(s):2769 - 2779
Cited by:  Papers (31)
| |PDF (3888 KB) | HTML

In this paper, we propose a novel learning-based face hallucination framework built in the DCT domain, which can produce a high-resolution face image from a single low-resolution one. The problem is formulated as inferring the DCT coefficients in frequency domain instead of estimating pixel intensities in spatial domain. Our study shows that DC coefficients can be estimated fairly accurately by si... View full abstract»

• ### Analysis of Dyadic Approximation Error for Hybrid Video Codecs With Integer Transforms

Publication Year: 2011, Page(s):2780 - 2787
| |PDF (1598 KB) | HTML

In this paper, we present an analysis of the dyadic approximation error introduced by the integerization of transform coding in H.264/AVC-like codecs. We derive the analytical formulations for dyadic approximation error and nonorthogonality error. We further classify the dyadic approximation error into a “system error” and a “nonflat error,” and proposed two models for ... View full abstract»

• ### Optimal Compression Plane for Efficient Video Coding

Publication Year: 2011, Page(s):2788 - 2799
Cited by:  Papers (9)
| |PDF (2551 KB) | HTML

All existing video coding standards developed so far deem video as a sequence of natural frames (formed in the XY plane), and treat spatial redundancy (redundancy along X and Y directions) and temporal redundancy (redundancy along T direction) differently and separately. In this paper, we investigate into a new compression (redundancy reduction) method for video in which the frames are allowed to ... View full abstract»

• ### Halftone-Image Security Improving Using Overall Minimal-Error Searching

Publication Year: 2011, Page(s):2800 - 2812
Cited by:  Papers (10)
| |PDF (3815 KB) | HTML

For image-based data hiding, it is difficult to achieve good image quality when high embedding capacity and 100% data extraction are also demanded. In this study, the proposed method, namely, overall minimal-error searching (OMES) is developed to meet the aforementioned requirements. Moreover, the concept of secret sharing is also adopted to distribute watermarks into multiple halftone images, and... View full abstract»

• ### Surface-Preserving Robust Watermarking of 3-D Shapes

Publication Year: 2011, Page(s):2813 - 2826
Cited by:  Papers (15)  |  Patents (1)
| |PDF (2673 KB) | HTML

This paper describes a new statistical approach for watermarking mesh representations of 3-D graphical objects. A robust digital watermarking method has to mitigate among the requirements of watermark invisibility, robustness, embedding capacity and key security. The proposed method employs a mesh propagation distance metric procedure called the fast marching method (FMM), which defines regions of... View full abstract»

• ### Lookup-Table-Based Gradient Field Reconstruction

Publication Year: 2011, Page(s):2827 - 2836
Cited by:  Papers (4)
| |PDF (1203 KB) | HTML

In computer vision, there are many applications, where it is advantageous to process an image in the gradient domain and then reintegrate the gradient field: important examples include shadow removal, lightness calculation, and data fusion. A serious problem with this approach is that the reconstruction step often introduces artefacts-commonly, smoothed and smeared edges-to the recovered image. Th... View full abstract»

• ### Halftone Image Classification Using LMS Algorithm and Naive Bayes

Publication Year: 2011, Page(s):2837 - 2847
Cited by:  Papers (12)
| |PDF (3126 KB) | HTML

Former research on inverse halftoning most focus on developing a general-purpose method for all types of halftone patterns, such as error diffusion, ordered dithering, etc., while fail to consider the natural discrepancies among various halftoning methods. To achieve optimal image quality for each halftoning method, the classification of halftone images is highly demanded. This study employed the ... View full abstract»

• ### Speed Improvement of B-Snake Algorithm Using Dynamic Programming Optimization

Publication Year: 2011, Page(s):2848 - 2855
Cited by:  Papers (2)
| |PDF (1155 KB) | HTML

This paper presents a novel approach to contour approximation carried out by means of the B-snake algorithm and the dynamic programming (DP) optimization technique. Using the proposed strategy for contour point search procedure, computing complexity is reduced to O(N × M2), whereas the standard DP method has an O(N × M4) complexity, with N being the number of co... View full abstract»

Publication Year: 2011, Page(s):2856 - 2864
Cited by:  Papers (14)
| |PDF (1039 KB) | HTML

Source and mask optimization (SMO) has been proposed recently as an effective solution to extend the lifespan of conventional 193 nm lithography, although the process is computationally intensive. In this study, we propose a highly effective and efficient method for source optimization and improve a previous method for mask optimization. An SMO framework is implemented by integrating them. Based o... View full abstract»

• ### Residues Cluster-Based Segmentation and Outlier-Detection Method for Large-Scale Phase Unwrapping

Publication Year: 2011, Page(s):2865 - 2875
Cited by:  Papers (12)
| |PDF (1648 KB) | HTML

2-D phase unwrapping is an important technique in many applications. However, with the growth of image scale, how to tile and splice the image effectively has become a new challenge. In this paper, the phase unwrapping problem is abstracted as solving a large-scale system of inconsistent linear equations. With the difficulties of large-scale phase unwrapping analyzed, L0-norm cri... View full abstract»

• ### An a priori Shading Correction Technique for Contact Imaging Devices

Publication Year: 2011, Page(s):2876 - 2885
Cited by:  Papers (3)
| |PDF (2593 KB) | HTML

Digital imaging devices are increasingly used for color measurements in fields such as forensics, the food industry, and ecological and medical research. Especially concerning the skin, in the follow-up of benign or malignant lesions, it is crucial to ensure that the measured colors are accurate and reproducible. Several color calibration methods having been presented over the last few years. Howe... View full abstract»

• ### Combined Affine Geometric Transformations and Spatially Dependent Radiometric Deformations: A Decoupled Linear Estimation Framework

Publication Year: 2011, Page(s):2886 - 2895
| |PDF (2025 KB) | HTML

This paper considers the problem of registering two observations of the same object, where the observations differ due to a combined effect of an affine geometric transformation and nonuniform illumination changes. The problem of deriving new representations of the observations that are both invariant to geometric transformations and linear in the illumination model is analyzed. In this framework,... View full abstract»

• ### Revisiting Complex Moments for 2-D Shape Representation and Image Normalization

Publication Year: 2011, Page(s):2896 - 2911
Cited by:  Papers (9)
| |PDF (2513 KB) | HTML

When comparing 2-D shapes, a key issue is their normalization. Translation and scale are easily taken care of by removing the mean and normalizing the energy. However, defining and computing the orientation of a 2-D shape is not so simple. In fact, although for elongated shapes the principal axis can be used to define one of two possible orientations, there is no such tool for general shapes. As w... View full abstract»

• ### Object Tracking and Target Reacquisition Based on 3-D Range Data for Moving Vehicles

Publication Year: 2011, Page(s):2912 - 2924
Cited by:  Papers (4)
| |PDF (2310 KB) | HTML

In this paper, we propose an approach for tracking an object of interest based on 3-D range data. We employ particle filtering and active contours to simultaneously estimate the global motion of the object and its local deformations. The proposed algorithm takes advantage of range information to deal with the challenging (but common) situation in which the tracked object disappears from the image ... View full abstract»

• ### Computation of Fluid and Particle Motion From a Time-Sequenced Image Pair: A Global Outlier Identification Approach

Publication Year: 2011, Page(s):2925 - 2936
Cited by:  Papers (6)
| |PDF (1652 KB) | HTML

Fluid motion estimation from time-sequenced images is a significant image analysis task. Its application is widespread in experimental fluidics research and many related areas like biomedical engineering and atmospheric sciences. In this paper, we present a novel flow computation framework to estimate the flow velocity vectors from two consecutive image frames. In an energy minimization-based flow... View full abstract»

• ### Pose-Free Structure From Motion Using Depth From Motion Constraints

Publication Year: 2011, Page(s):2937 - 2953
Cited by:  Papers (2)
| |PDF (1050 KB) | HTML

Structure from motion (SFM) is the problem of recovering the geometry of a scene from a stream of images taken from unknown viewpoints. One popular approach to estimate the geometry of a scene is to track scene features on several images and reconstruct their position in 3-D. During this process, the unknown camera pose must also be recovered. Unfortunately, recovering the pose can be an ill-condi... View full abstract»

• ### Accurate Moving Cast Shadow Suppression Based on Local Color Constancy Detection

Publication Year: 2011, Page(s):2954 - 2966
Cited by:  Papers (24)
| |PDF (1496 KB) | HTML

This paper describes a novel framework for detection and suppression of properly shadowed regions for most possible scenarios occurring in real video sequences. Our approach requires no prior knowledge about the scene, nor is it restricted to specific scene structures. Furthermore, the technique can detect both achromatic and chromatic shadows even in the presence of camouflage that occurs when fo... View full abstract»

## 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