<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Image Processing, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 83 </description>
		<year>2012</year>
		<month>February </month>
		<day>10</day>
		<item>
			<title><![CDATA[Table of Contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129826]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129826]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>C1</startPage>
			<endPage>C4</endPage>
			<fileSize>191</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Image Processing publication information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129830]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129830]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>C2</startPage>
			<endPage>C2</endPage>
			<fileSize>39</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[A Semitransparency-Based Optical-Flow Method With a Point Trajectory Model for Particle-Like Video]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986712]]></link>
			<description><![CDATA[This paper proposes a new semitransparency-based optical-flow model with a point trajectory (PT) model for particle-like video. Previous optical-flow models have used ranging from image brightness constancy to image brightness change models as constraints. However, two important issues remain unsolved. The first is how to track/match a semitransparent object with a very large displacement between frames. Such moving objects with different shapes and sizes in an outdoor scene move against a complicated background. Second, due to semitransparency, the image intensity between frames can also violate a previous image brightness-based optical-flow model. Thus, we propose a two-step optimization for the optical-flow estimation model for a moving semitransparent object, i.e., particle. In the first step, a rough optical flow between particles is estimated by a new alpha constancy constraint that is based on an image generation model of semitransparency. In the second step, the optical flow of a particle with a continuous trajectory in a definite temporal interval based on a PT model can be refined. Many experiments using various falling-snow and foggy scenes with multiple moving vehicles show the significant improvement of the optical flow compared with a previous optical-flow model.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986712]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>441</startPage>
			<endPage>450</endPage>
			<fileSize>1361</fileSize>
			<authors><![CDATA[Sakaino, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Model-Assisted Adaptive Recovery of Compressed Sensing with Imaging Applications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5975218]]></link>
			<description><![CDATA[In compressive sensing (CS), a challenge is to find a space in which the signal is sparse and, hence, faithfully recoverable. Since many natural signals such as images have locally varying statistics, the sparse space varies in time/spatial domain. As such, CS recovery should be conducted in locally adaptive signal-dependent spaces to counter the fact that the CS measurements are global and irrespective of signal structures. On the contrary, existing CS reconstruction methods use a fixed set of bases (e.g., wavelets, DCT, and gradient spaces) for the entirety of a signal. To rectify this problem, we propose a new framework for model-guided adaptive recovery of compressive sensing (MARX) and show how a 2-D piecewise autoregressive model can be integrated into the MARX framework to make CS recovery adaptive to spatially varying second order statistics of an image. In addition, MARX offers a mechanism of characterizing and exploiting structured sparsities of natural images, greatly restricting the CS solution space. Simulation results over a wide range of natural images show that the proposed MARX technique can improve the reconstruction quality of existing CS methods by 2-7 dB.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5975218]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>451</startPage>
			<endPage>458</endPage>
			<fileSize>5200</fileSize>
			<authors><![CDATA[Xiaolin Wu;Weisheng Dong;Xiangjun Zhang;Guangming Shi;]]></authors>
		</item>
		<item>
			<title><![CDATA[Reciprocal Focus Profile]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981388]]></link>
			<description><![CDATA[A focus profile having a steeper peak is more resistant to image noise in the autofocus (AF) process of a digital camera. However, a focus profile of such shape normally has a flatter out-of-focus region on either side of the profile, resulting in a slow AF process due to the lack of clue about where the lens should move when the lens is in such regions. To address the problem, we provide a statistical analysis of the focus profile and show that a strictly monotonic transformation of the focus profile preserves the accuracy of the AF. On the basis of this analysis, we propose a new focus profile representation that transforms the focus profile to the reciprocal domain in which the reciprocal focus profile is modeled by a polynomial function. This transformation makes the AF mathematically tractable and boosts the search speed. Experimental results are shown to demonstrate the advantage of the proposed representation .]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981388]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>459</startPage>
			<endPage>468</endPage>
			<fileSize>2014</fileSize>
			<authors><![CDATA[Dong-Chen Tsai;Chen, H.H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Joint Learning for Single-Image Super-Resolution via a Coupled Constraint]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5948382]]></link>
			<description><![CDATA[The neighbor-embedding (NE) algorithm for single-image super-resolution (SR) reconstruction assumes that the feature spaces of low-resolution (LR) and high-resolution (HR) patches are locally isometric. However, this is not true for SR because of one-to-many mappings between LR and HR patches. To overcome or at least to reduce the problem for NE-based SR reconstruction, we apply a joint learning technique to train two projection matrices simultaneously and to map the original LR and HR feature spaces onto a unified feature subspace. Subsequently, the <i>k</i> -nearest neighbor selection of the input LR image patches is conducted in the unified feature subspace to estimate the reconstruction weights. To handle a large number of samples, joint learning locally exploits a coupled constraint by linking the LR-HR counterparts together with the <i>K</i>-nearest grouping patch pairs. In order to refine further the initial SR estimate, we impose a global reconstruction constraint on the SR outcome based on the maximum a posteriori framework. Preliminary experiments suggest that the proposed algorithm outperforms NE-related baselines.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5948382]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>469</startPage>
			<endPage>480</endPage>
			<fileSize>1319</fileSize>
			<authors><![CDATA[Xinbo Gao;Kaibing Zhang;Dacheng Tao;Xuelong Li;]]></authors>
		</item>
		<item>
			<title><![CDATA[Stochastic Uncertainty Models for the Luminance Consistency Assumption]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5960790]]></link>
			<description><![CDATA[In this paper, a stochastic formulation of the brightness consistency used in many computer vision problems involving dynamic scenes (for instance, motion estimation or point tracking) is proposed. Usually, this model, which assumes that the luminance of a point is constant along its trajectory, is expressed in a differential form through the total derivative of the luminance function. This differential equation linearly links the point velocity to the spatial and temporal gradients of the luminance function. However, when dealing with images, the available information only holds at discrete time and on a discrete grid. In this paper, we formalize the image luminance as a continuous function transported by a flow known only up to some uncertainties related to such a discretization process. Relying on stochastic calculus, we define a formulation of the luminance function preservation in which these uncertainties are taken into account. From such a framework, it can be shown that the usual deterministic optical flow constraint equation corresponds to our stochastic evolution under some strong constraints. These constraints can be relaxed by imposing a weaker temporal assumption on the luminance function and also in introducing anisotropic intensity-based uncertainties. We also show that these uncertainties can be computed at each point of the image grid from the image data and hence provide meaningful information on the reliability of the motion estimates. To demonstrate the benefit of such a stochastic formulation of the brightness consistency assumption, we have considered a local least-squares motion estimator relying on this new constraint. This new motion estimator significantly improves the quality of the results.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5960790]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>481</startPage>
			<endPage>493</endPage>
			<fileSize>1480</fileSize>
			<authors><![CDATA[Corpetti, T.;Memin, E.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Kronecker Compressive Sensing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986706]]></link>
			<description><![CDATA[Compressive sensing (CS) is an emerging approach for the acquisition of signals having a sparse or compressible representation in some basis. While the CS literature has mostly focused on problems involving 1-D signals and 2-D images, many important applications involve multidimensional signals; the construction of sparsifying bases and measurement systems for such signals is complicated by their higher dimensionality. In this paper, we propose the use of Kronecker product matrices in CS for two purposes. First, such matrices can act as sparsifying bases that jointly model the structure present in all of the signal dimensions. Second, such matrices can represent the measurement protocols used in distributed settings. Our formulation enables the derivation of analytical bounds for the sparse approximation of multidimensional signals and CS recovery performance, as well as a means of evaluating novel distributed measurement schemes.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986706]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>494</startPage>
			<endPage>504</endPage>
			<fileSize>2050</fileSize>
			<authors><![CDATA[Duarte, M.F.;Baraniuk, R.G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Two-Dimensional Approach to Full-Reference Image Quality Assessment Based on Positional Structural Information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986705]]></link>
			<description><![CDATA[A method for full-reference visual quality assessment based on the 2-D combination of two diverse metrics is described. The first metric is a measure of structural information loss based on the Fisher information about the position of the structures in the observed images. The second metric acts as a categorical indicator of the type of distortion that images underwent. These two metrics constitute the inner state of a virtual cognitive model, viewed as a system whose output is the automatic visual quality estimate. The use of a 2-D metric fills the intrinsic incompleteness of methods based on a single metric while providing consistent response across different image impairment factors and blind distortion classification capability with a modest computational overhead. The high accuracy and robustness of the method are demonstrated through cross-validation experiments.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986705]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>505</startPage>
			<endPage>516</endPage>
			<fileSize>1516</fileSize>
			<authors><![CDATA[Capodiferro, L.;Jacovitti, G.;Di Claudio, E.D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[RRED Indices: Reduced Reference Entropic Differencing for Image Quality Assessment]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5999718]]></link>
			<description><![CDATA[We study the problem of automatic &#x201C;reduced-reference&#x201D; image quality assessment (QA) algorithms from the point of view of image information change. Such changes are measured between the reference- and natural-image approximations of the distorted image. Algorithms that measure differences between the entropies of wavelet coefficients of reference and distorted images, as perceived by humans, are designed. The algorithms differ in the data on which the entropy difference is calculated and on the amount of information from the reference that is required for quality computation, ranging from almost full information to almost no information from the reference. A special case of these is algorithms that require just a single number from the reference for QA. The algorithms are shown to correlate very well with subjective quality scores, as demonstrated on the Laboratory for Image and Video Engineering Image Quality Assessment Database and the Tampere Image Database. Performance degradation, as the amount of information is reduced, is also studied.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5999718]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>517</startPage>
			<endPage>526</endPage>
			<fileSize>566</fileSize>
			<authors><![CDATA[Soundararajan, R.;Bovik, A.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Kalman-Filtering Approach to High Dynamic Range Imaging for Measurement Applications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981389]]></link>
			<description><![CDATA[High dynamic range imaging (HDRI) methods in computational photography address situations where the dynamic range of a scene exceeds what can be captured by an image sensor in a single exposure. HDRI techniques have also been used to construct radiance maps in measurement applications; unfortunately, the design and evaluation of HDRI algorithms for use in these applications have received little attention. In this paper, we develop a novel HDRI technique based on pixel-by-pixel Kalman filtering and evaluate its performance using objective metrics that this paper also introduces. In the presented experiments, this new technique achieves as much as 9.4-dB improvement in signal-to-noise ratio and can achieve as much as a 29% improvement in radiometric accuracy over a classic method.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981389]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>527</startPage>
			<endPage>536</endPage>
			<fileSize>3854</fileSize>
			<authors><![CDATA[Dedrick, E.;Lau, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Wavelet Variance Analysis for Random Fields on a Regular Lattice]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5989864]]></link>
			<description><![CDATA[There has been considerable recent interest in using wavelets to analyze time series and images that can be regarded as realizations of certain 1-D and 2-D stochastic processes on a regular lattice. Wavelets give rise to the concept of the wavelet variance (or wavelet power spectrum), which decomposes the variance of a stochastic process on a scale-by-scale basis. The wavelet variance has been applied to a variety of time series, and a statistical theory for estimators of this variance has been developed. While there have been applications of the wavelet variance in the 2-D context (in particular, in works by Unser in 1995 on wavelet-based texture analysis for images and by Lark and Webster in 2004 on analysis of soil properties), a formal statistical theory for such analysis has been lacking. In this paper, we develop the statistical theory by generalizing and extending some of the approaches developed for time series, thus leading to a large-sample theory for estimators of 2-D wavelet variances. We apply our theory to simulated data from Gaussian random fields with exponential covariances and from fractional Brownian surfaces. We demonstrate that the wavelet variance is potentially useful for texture discrimination. We also use our methodology to analyze images of four types of clouds observed over the southeast Pacific Ocean.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5989864]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>537</startPage>
			<endPage>549</endPage>
			<fileSize>1568</fileSize>
			<authors><![CDATA[Mondal, D.;Percival, D.B.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Critically Sampled Wavelets With Composite Dilations]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981390]]></link>
			<description><![CDATA[Wavelets with composite dilations provide a general framework for the construction of waveforms defined not only at various scales and locations, as traditional wavelets, but also at various orientations and with different scaling factors in each coordinate. As a result, they are useful to analyze the geometric information that often dominate multidimensional data much more efficiently than traditional wavelets. The shearlet system, for example, is a particular well-known realization of this framework, which provides optimally sparse representations of images with edges. In this paper, we further investigate the constructions derived from this approach to develop critically sampled wavelets with composite dilations for the purpose of image coding. Not only do we show that many nonredundant directional constructions recently introduced in the literature can be derived within this setting, but we also introduce new critically sampled discrete transforms that achieve much better nonlinear approximation rates than traditional discrete wavelet transforms and outperform the other critically sampled multiscale transforms recently proposed.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981390]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>550</startPage>
			<endPage>561</endPage>
			<fileSize>5428</fileSize>
			<authors><![CDATA[Easley, G.R.;Labate, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Framelet-Based Blind Motion Deblurring From a Single Image]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981391]]></link>
			<description><![CDATA[How to recover a clear image from a single motion-blurred image has long been a challenging open problem in digital imaging. In this paper, we focus on how to recover a motion-blurred image due to camera shake. A regularization-based approach is proposed to remove motion blurring from the image by regularizing the sparsity of both the original image and the motion-blur kernel under tight wavelet frame systems. Furthermore, an adapted version of the split Bregman method is proposed to efficiently solve the resulting minimization problem. The experiments on both synthesized images and real images show that our algorithm can effectively remove complex motion blurring from natural images without requiring any prior information of the motion-blur kernel.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981391]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>562</startPage>
			<endPage>572</endPage>
			<fileSize>1220</fileSize>
			<authors><![CDATA[Jian-Feng Cai;Hui Ji;Chaoqiang Liu;Zuowei Shen;]]></authors>
		</item>
		<item>
			<title><![CDATA[Algorithms for the Digital Restoration of Torn Films]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5957281]]></link>
			<description><![CDATA[This paper presents algorithms for the digital restoration of films damaged by tear. As well as causing local image data loss, a tear results in a noticeable relative shift in the frame between the regions at either side of the tear boundary. This paper describes a method for delineating the tear boundary and for correcting the displacement. This is achieved using a graph-cut segmentation framework that can be either automatic or interactive when automatic segmentation is not possible. Using temporal intensity differences to form the boundary conditions for the segmentation facilitates the robust division of the frame. The resulting segmentation map is used to calculate and correct the relative displacement using a global-motion estimation approach based on motion histograms. A high-quality restoration is obtained when a suitable missing-data treatment algorithm is used to recover any missing pixel intensities.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5957281]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>573</startPage>
			<endPage>587</endPage>
			<fileSize>5070</fileSize>
			<authors><![CDATA[Corrigan, D.;Kokaram, A.;Harte, N.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Rate-Distortion Analysis of Directional Wavelets]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5993540]]></link>
			<description><![CDATA[The inefficiency of separable wavelets in representing smooth edges has led to a great interest in the study of new 2-D transformations. The most popular criterion for analyzing these transformations is the approximation power. Transformations with near-optimal approximation power are useful in many applications such as denoising and enhancement. However, they are not necessarily good for compression. Therefore, most of the nearly optimal transformations such as curvelets and contourlets have not found any application in image compression yet. One of the most promising schemes for image compression is the elegant idea of directional wavelets (DIWs). While these algorithms outperform the state-of-the-art image coders in practice, our theoretical understanding of them is very limited. In this paper, we adopt the notion of rate-distortion and calculate the performance of the DIW on a class of edge-like images. Our theoretical analysis shows that if the edges are not &#x201C;sharp,&#x201D; the DIW will compress them more efficiently than the separable wavelets. It also demonstrates the inefficiency of the quadtree partitioning that is often used with the DIW. To solve this issue, we propose a new partitioning scheme called megaquad partitioning. Our simulation results on real-world images confirm the benefits of the proposed partitioning algorithm, promised by our theoretical analysis.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5993540]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>588</startPage>
			<endPage>600</endPage>
			<fileSize>2709</fileSize>
			<authors><![CDATA[Maleki, A.;Rajaei, B.;Pourreza, H.R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Bayesian Estimation for Optimized Structured Illumination Microscopy]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5959980]]></link>
			<description><![CDATA[Structured illumination microscopy is a recent imaging technique that aims at going beyond the classical optical resolution by reconstructing high-resolution (HR) images from low-resolution (LR) images acquired through modulation of the transfer function of the microscope. The classical implementation has a number of drawbacks, such as requiring a large number of images to be acquired and parameters to be manually set in an ad-hoc manner that have, until now, hampered its wide dissemination. Here, we present a new framework based on a Bayesian inverse problem formulation approach that enables the computation of one HR image from a reduced number of LR images and has no specific constraints on the modulation. Moreover, it permits to automatically estimate the optimal reconstruction hyperparameters and to compute an uncertainty bound on the estimated values. We demonstrate through numerical evaluations on simulated data and examples on real microscopy data that our approach represents a decisive advance for a wider use of HR microscopy through structured illumination.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5959980]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>601</startPage>
			<endPage>614</endPage>
			<fileSize>3528</fileSize>
			<authors><![CDATA[Orieux, F.;Sepulveda, E.;Loriette, V.;Dubertret, B.;Olivo-Marin, J.-C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multiscale Semilocal Interpolation With Antialiasing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986708]]></link>
			<description><![CDATA[Aliasing is a common artifact in low-resolution (LR) images generated by a downsampling process. Recovering the original high-resolution image from its LR counterpart while at the same time removing the aliasing artifacts is a challenging image interpolation problem. Since a natural image normally contains redundant similar patches, the values of missing pixels can be available at texture-relevant LR pixels. Based on this, we propose an iterative multiscale semilocal interpolation method that can effectively address the aliasing problem. The proposed method estimates each missing pixel from a set of texture-relevant semilocal LR pixels with the texture similarity iteratively measured from a sequence of patches of varying sizes. Specifically, in each iteration, top texture-relevant LR pixels are used to construct a data fidelity term in a maximum a posteriori estimation, and a bilateral total variation is used as the regularization term. Experimental results compared with existing interpolation methods demonstrate that our method can not only substantially alleviate the aliasing problem but also produce better results across a wide range of scenes both in terms of quantitative evaluation and subjective visual quality.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986708]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>615</startPage>
			<endPage>625</endPage>
			<fileSize>7578</fileSize>
			<authors><![CDATA[Kai Guo;Xiaokang Yang;Hongyuan Zha;Weiyao Lin;Songyu Yu;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Efficient Camera Calibration Technique Offering Robustness and Accuracy Over a Wide Range of Lens Distortion]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5982395]]></link>
			<description><![CDATA[In the field of machine vision, camera calibration refers to the experimental determination of a set of parameters that describe the image formation process for a given analytical model of the machine vision system. Researchers working with low-cost digital cameras and off-the-shelf lenses generally favor camera calibration techniques that do not rely on specialized optical equipment, modifications to the hardware, or an a priori knowledge of the vision system. Most of the commonly used calibration techniques are based on the observation of a single 3-D target or multiple planar (2-D) targets with a large number of control points. This paper presents a novel calibration technique that offers improved accuracy, robustness, and efficiency over a wide range of lens distortion. This technique operates by minimizing the error between the reconstructed image points and their experimentally determined counterparts in &#x201C;distortion free&#x201D; space. This facilitates the incorporation of the exact lens distortion model. In addition, expressing spatial orientation in terms of unit quaternions greatly enhances the proposed calibration solution by formulating a minimally redundant system of equations that is free of singularities. Extensive performance benchmarking consisting of both computer simulation and experiments confirmed higher accuracy in calibration regardless of the amount of lens distortion present in the optics of the camera. This paper also experimentally confirmed that a comprehensive lens distortion model including higher order radial and tangential distortion terms improves calibration accuracy.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5982395]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>626</startPage>
			<endPage>637</endPage>
			<fileSize>1838</fileSize>
			<authors><![CDATA[Rahman, T.;Krouglicof, N.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Feature-Specific Difference Imaging]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5993541]]></link>
			<description><![CDATA[Difference images quantify changes in the object scene over time. In this paper, we use the feature-specific imaging paradigm to present methods for estimating a sequence of difference images from a sequence of compressive measurements of the object scene. Our goal is twofold. First is to design, where possible, the optimal sensing matrix for taking compressive measurements. In scenarios where such sensing matrices are not tractable, we consider plausible candidate sensing matrices that either use the available a priori information or are nonadaptive. Second, we develop closed-form and iterative techniques for estimating the difference images. We specifically look at <i>l</i><sub>2</sub> - and <i>l</i><sub>1</sub> -based methods. We show that <i>l</i><sub>2</sub>-based techniques can directly estimate the difference image from the measurements without first reconstructing the object scene. This direct estimation exploits the spatial and temporal correlations between the object scene at two consecutive time instants. We further develop a method to estimate a generalized difference image from multiple measurements and use it to estimate the sequence of difference images. For <i>l</i><sub>1</sub>-based estimation, we consider modified forms of the total-variation method and basis pursuit denoising. We also look at a third method that directly exploits the sparsity of the difference image. We present results to show the efficacy of these techniques and discuss the advantages of each.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5993541]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>638</startPage>
			<endPage>652</endPage>
			<fileSize>1971</fileSize>
			<authors><![CDATA[Uttam, S.;Goodman, N.A.;Neifeld, M.A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multiple Descriptions Coinciding Lattice Vector Quantizer for Wavelet Image Coding]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5982394]]></link>
			<description><![CDATA[Multiple description (MD) coding has been a popular choice for robust data transmission over the unreliable network channels. Lattice vector quantization provides lower computation for efficient data compression. In this paper, a new MD coinciding lattice vector quantizer (MDCLVQ) is presented. The design of the quantizer is based on coinciding 2-D hexagonal sublattices. The coinciding sublattices are geometrically similar sublattices, with the same index but generated by different generator matrices. A novel labeling algorithm based on the hexagonal coinciding sublattices is also developed. Performance results of the MDCLVQ scheme, together with the new labeling algorithm applied to standard test images, show improvements of the central and side decoders, as compared with the renowned techniques for several test images.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5982394]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>653</startPage>
			<endPage>661</endPage>
			<fileSize>780</fileSize>
			<authors><![CDATA[Akhtarkavan, E.;Salleh, M.F.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Investigation of Dehazing Effects on Image and Video Coding]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6008642]]></link>
			<description><![CDATA[This paper makes an investigation of the dehazing effects on image and video coding for surveillance systems. The goal is to achieve good dehazed images and videos at the receiver while sustaining low bitrates (using compression) in the transmission pipeline. At first, this paper proposes a novel method for single-image dehazing, which is used for the investigation. It operates at a faster speed than current methods and can avoid halo effects by using the median operation. We then consider the dehazing effects in compression by investigating the coding artifacts and motion estimation in cases of applying any dehazing method before or after compression. We conclude that better dehazing performance with fewer artifacts and better coding efficiency is achieved when the dehazing is applied before compression. Simulations for Joint Photographers Expert Group images in addition to subjective and objective tests with H.264 compressed sequences validate our conclusion.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6008642]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>662</startPage>
			<endPage>673</endPage>
			<fileSize>1202</fileSize>
			<authors><![CDATA[Gibson, K.B.;Vo, D.T.;Nguyen, T.Q.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Low-Complexity Video Coding Based on Two-Dimensional Singular Value Decomposition]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6008644]]></link>
			<description><![CDATA[In this paper, we propose a low-complexity video coding scheme based upon 2-D singular value decomposition (2-D SVD), which exploits basic temporal correlation in visual signals without resorting to motion estimation (ME). By exploring the energy compaction property of 2-D SVD coefficient matrices, high coding efficiency is achieved. The proposed scheme is for the better compromise of computational complexity and temporal redundancy reduction, i.e., compared with the existing video coding methods. In addition, the problems caused by frame decoding dependence in hybrid video coding, such as unavailability of random access, are avoided. The comparison of the proposed 2-D SVD coding scheme with the existing relevant non-ME-based low-complexity codecs shows its advantages and potential in applications.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6008644]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>674</startPage>
			<endPage>687</endPage>
			<fileSize>2271</fileSize>
			<authors><![CDATA[Zhouye Gu;Weisi Lin;Bu-sung Lee;ChiewTong Lau;]]></authors>
		</item>
		<item>
			<title><![CDATA[HANS: Controlling Ink-Jet Print Attributes Via Neugebauer Primary Area Coverages]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5985532]]></link>
			<description><![CDATA[Ink-jet print attributes such as color gamut, grain, and cost are consequences of the materials and printing technology used and of choices made during color management, color separation, and halftoning operation. Traditionally, color separation determines what amounts of the available inks to use for each reproducible color, and halftoning deals with the spatial distribution of inks that also results in the nature of their overprinting. However, using an ink space as a means of communication between color separation and halftoning gives access only to some of the printed patterns that a printing system is capable of and, therefore, only to a reduced range of print attributes. Here, a method, i.e., Halftone Area Neugebauer Separation, is proposed to gain access to all possible printable patterns by specifying relative area coverages of a printing system's Neugebauer primaries instead of only ink amounts. This results in delivering prints with more optimal attributes (e.g., using less ink and giving rise to a larger color gamut) than is possible using current methods.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5985532]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>688</startPage>
			<endPage>696</endPage>
			<fileSize>3172</fileSize>
			<authors><![CDATA[Morovic, J.;Morovic, P.;Arnabat, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Color Constancy for Multiple Light Sources]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986707]]></link>
			<description><![CDATA[Color constancy algorithms are generally based on the simplifying assumption that the spectral distribution of a light source is uniform across scenes. However, in reality, this assumption is often violated due to the presence of multiple light sources. In this paper, we will address more realistic scenarios where the uniform light-source assumption is too restrictive. First, a methodology is proposed to extend existing algorithms by applying color constancy locally to image patches, rather than globally to the entire image. After local (patch-based) illuminant estimation, these estimates are combined into more robust estimations, and a local correction is applied based on a modified diagonal model. Quantitative and qualitative experiments on spectral and real images show that the proposed methodology reduces the influence of two light sources simultaneously present in one scene. If the chromatic difference between these two illuminants is more than 1<sup>&#x00B0;</sup> , the proposed framework outperforms algorithms based on the uniform light-source assumption (with error-reduction up to approximately 30%). Otherwise, when the chromatic difference is less than 1<sup>&#x00B0;</sup> and the scene can be considered to contain one (approximately) uniform light source, the performance of the proposed method framework is similar to global color constancy methods.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986707]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>697</startPage>
			<endPage>707</endPage>
			<fileSize>1342</fileSize>
			<authors><![CDATA[Gijsenij, A.;Rui Lu;Gevers, T.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On the Bandwidth of the Plenoptic Function]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5978219]]></link>
			<description><![CDATA[The plenoptic function (POF) provides a powerful conceptual tool for describing a number of problems in image/video processing, vision, and graphics. For example, image-based rendering is shown as sampling and interpolation of the POF. In such applications, it is important to characterize the bandwidth of the POF. We study a simple but representative model of the scene where band-limited signals (e.g., texture images) are &#x201C;painted&#x201D; on smooth surfaces (e.g., of objects or walls). We show that, in general, the POF is not band limited unless the surfaces are flat. We then derive simple rules to estimate the essential bandwidth of the POF for this model. Our analysis reveals that, in addition to the maximum and minimum depths and the maximum frequency of painted signals, the bandwidth of the POF also depends on the maximum surface slope. With a unifying formalism based on multidimensional signal processing, we can verify several key results in POF processing, such as induced filtering in space and depth-corrected interpolation, and quantify the necessary sampling rates.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5978219]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>708</startPage>
			<endPage>717</endPage>
			<fileSize>706</fileSize>
			<authors><![CDATA[Do, M.N.;Marchand-Maillet, D.;Vetterli, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Theoretical Analysis of View Interpolation With Inaccurate Depth Information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6054054]]></link>
			<description><![CDATA[A problem of view interpolation from a pair of rectified stereo images with inaccurate depth information is addressed. Errors in geometric information greatly affect the quality of the resulting images since inaccurate geometry causes miscorrespondences between the input images. A new theory for quantitatively analyzing the effect of depth errors and providing a principled optimization scheme based on the mean-squared error metric is proposed. The theory clarifies that, if the probabilistic distribution of the depth errors is given, an optimized view-interpolation scheme that outperforms conventional linear interpolation can be derived. It also reveals that, under specific conditions, linear interpolation is acceptable as an approximation of the optimized-interpolation scheme. Furthermore, band limitation combined with linear interpolation is also analyzed, leading to an optimal cutoff frequency, which achieves better results than the antialias scheme proposed in previous studies. Experimental results using real scenes are also presented to confirm this theory.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6054054]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>718</startPage>
			<endPage>732</endPage>
			<fileSize>5881</fileSize>
			<authors><![CDATA[Takahashi, K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[CT Reconstruction From Parallel and Fan-Beam Projections by a 2-D Discrete Radon Transform]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981387]]></link>
			<description><![CDATA[The discrete Radon transform (DRT) was defined by Abervuch et al. as an analog of the continuous Radon transform for discrete data. Both the DRT and its inverse are computable in <i>O</i>(<i>n</i><sup>2</sup>log<i>n</i>) operations for images of size <i>n</i> &#x00D7;<i>n</i>. In this paper, we demonstrate the applicability of the inverse DRT for the reconstruction of a 2-D object from its continuous projections. The DRT and its inverse are shown to model accurately the continuum as the number of samples increases. Numerical results for the reconstruction from parallel projections are presented. We also show that the inverse DRT can be used for reconstruction from fan-beam projections with equispaced detectors.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5981387]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>733</startPage>
			<endPage>741</endPage>
			<fileSize>3226</fileSize>
			<authors><![CDATA[Averbuch, A.;Sedelnikov, I.;Shkolnisky, Y.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Fast Majorize&#x2013;Minimize Algorithm for the Recovery of Sparse and Low-Rank Matrices]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5993539]]></link>
			<description><![CDATA[We introduce a novel algorithm to recover sparse and low-rank matrices from noisy and undersampled measurements. We pose the reconstruction as an optimization problem, where we minimize a linear combination of data consistency error, nonconvex spectral penalty, and nonconvex sparsity penalty. We majorize the nondifferentiable spectral and sparsity penalties in the criterion by quadratic expressions to realize an iterative three-step alternating minimization scheme. Since each of these steps can be evaluated either analytically or using fast schemes, we obtain a computationally efficient algorithm. We demonstrate the utility of the algorithm in the context of dynamic magnetic resonance imaging (MRI) reconstruction from sub-Nyquist sampled measurements. The results show a significant improvement in signal-to-noise ratio and image quality compared with classical dynamic imaging algorithms. We expect the proposed scheme to be useful in a range of applications including video restoration and multidimensional MRI.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5993539]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>742</startPage>
			<endPage>753</endPage>
			<fileSize>1329</fileSize>
			<authors><![CDATA[Yue Hu;Lingala, S.G.;Jacob, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Robust Through-the-Wall Radar Image Classification Using a Target-Model Alignment Procedure]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6008645]]></link>
			<description><![CDATA[A through-the-wall radar image (TWRI) bears little resemblance to the equivalent optical image, making it difficult to interpret. To maximize the intelligence that may be obtained, it is desirable to automate the classification of targets in the image to support human operators. This paper presents a technique for classifying stationary targets based on the high-range resolution profile (HRRP) extracted from 3-D TWRIs. The dependence of the image on the target location is discussed using a system point spread function (PSF) approach. It is shown that the position dependence will cause a classifier to fail, unless the image to be classified is aligned to a classifier-training location. A target image alignment technique based on deconvolution of the image with the system PSF is proposed. Comparison of the aligned target images with measured images shows the alignment process introducing normalized mean squared error (NMSE) &#x2264; 9%. The HRRP extracted from aligned target images are classified using a naive Bayesian classifier supported by principal component analysis. The classifier is tested using a real TWRI of canonical targets behind a concrete wall and shown to obtain correct classification rates &#x2265;97%.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6008645]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>754</startPage>
			<endPage>767</endPage>
			<fileSize>1554</fileSize>
			<authors><![CDATA[Smith, G.E.;Mobasseri, B.G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Precision-Aware Self-Quantizing Hardware Architectures for the Discrete Wavelet Transform]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5971788]]></link>
			<description><![CDATA[This paper presents designs for both bit-parallel (BP) and digit-serial (DS) precision-optimized implementations of the discrete wavelet transform (DWT), with specific consideration given to the impact of depth (the number of levels of DWT) on the overall computational accuracy. These methods thus allow customizing the precision of a multilevel DWT to a given error tolerance requirement and ensuring an energy-minimal implementation, which increases the applicability of DWT-based algorithms such as JPEG 2000 to energy-constrained platforms and environments. Additionally, quantization of DWT coefficients to a specific target step size is performed as an inherent part of the DWT computation, thereby eliminating the need to have a separate downstream quantization step in applications such as JPEG 2000. Experimental measurements of design performance in terms of area, speed, and power for 90-nm complementary metal-oxide-semiconductor implementation are presented. Results indicate that while BP designs exhibit inherent speed advantages, DS designs require significantly fewer hardware resources with increasing precision and DWT level. A four-level DWT with medium precision, for example, while the BP design is four times faster than the digital-serial design, occupies twice the area. In addition to the BP and DS designs, a novel flexible DWT processor is presented, which supports run-time configurable DWT parameters.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5971788]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>768</startPage>
			<endPage>777</endPage>
			<fileSize>716</fileSize>
			<authors><![CDATA[Dong-U Lee;Lok-Won Kim;Villasenor, J.D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Histogram Contextualization]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5975216]]></link>
			<description><![CDATA[Histograms have been widely used for feature representation in image and video content analysis. However, due to the orderless nature of the summarization process, histograms generally lack spatial information. This may degrade their discrimination capability in visual classification tasks. Although there have been several research attempts to encode spatial context into histograms, how to extend the encodings to higher order spatial context is still an open problem. In this paper,we propose a general histogram contextualization method to encode efficiently higher order spatial context. The method is based on the cooccurrence of local visual homogeneity patterns and hence is able to generate more discriminative histogram representations while remaining compact and robust. Moreover, we also investigate how to extend the histogram contextualization to multiple modalities of context. It is shown that the proposed method can be naturally extended to combine both temporal and spatial context and facilitate video content analysis. In addition, a method to combine cross-feature context with spatial context via the technique of random forest is also introduced in this paper. Comprehensive experiments on face image classification and human activity recognition tasks demonstrate the superiority of the proposed histogram contextualization method compared with the existing encoding methods.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5975216]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>778</startPage>
			<endPage>788</endPage>
			<fileSize>1165</fileSize>
			<authors><![CDATA[Jiashi Feng;Bingbing Ni;Dong Xu;Shuicheng Yan;]]></authors>
		</item>
		<item>
			<title><![CDATA[Abrupt Motion Tracking Via Intensively Adaptive Markov-Chain Monte Carlo Sampling]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6021372]]></link>
			<description><![CDATA[The robust tracking of abrupt motion is a challenging task in computer vision due to its large motion uncertainty. While various particle filters and conventional Markov-chain Monte Carlo (MCMC) methods have been proposed for visual tracking, these methods often suffer from the well-known local-trap problem or from poor convergence rate. In this paper, we propose a novel sampling-based tracking scheme for the abrupt motion problem in the Bayesian filtering framework. To effectively handle the local-trap problem, we first introduce the stochastic approximation Monte Carlo (SAMC) sampling method into the Bayesian filter tracking framework, in which the filtering distribution is adaptively estimated as the sampling proceeds, and thus, a good approximation to the target distribution is achieved. In addition, we propose a new MCMC sampler with intensive adaptation to further improve the sampling efficiency, which combines a density-grid-based predictive model with the SAMC sampling, to give a proposal adaptation scheme. The proposed method is effective and computationally efficient in addressing the abrupt motion problem. We compare our approach with several alternative tracking algorithms, and extensive experimental results are presented to demonstrate the effectiveness and the efficiency of the proposed method in dealing with various types of abrupt motions.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6021372]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>789</startPage>
			<endPage>801</endPage>
			<fileSize>1212</fileSize>
			<authors><![CDATA[Xiuzhuang Zhou;Yao Lu;Jiwen Lu;Jie Zhou;]]></authors>
		</item>
		<item>
			<title><![CDATA[Combining Head Pose and Eye Location Information for Gaze Estimation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5959981]]></link>
			<description><![CDATA[Head pose and eye location for gaze estimation have been separately studied in numerous works in the literature. Previous research shows that satisfactory accuracy in head pose and eye location estimation can be achieved in constrained settings. However, in the presence of nonfrontal faces, eye locators are not adequate to accurately locate the center of the eyes. On the other hand, head pose estimation techniques are able to deal with these conditions; hence, they may be suited to enhance the accuracy of eye localization. Therefore, in this paper, a hybrid scheme is proposed to combine head pose and eye location information to obtain enhanced gaze estimation. To this end, the transformation matrix obtained from the head pose is used to normalize the eye regions, and in turn, the transformation matrix generated by the found eye location is used to correct the pose estimation procedure. The scheme is designed to enhance the accuracy of eye location estimations, particularly in low-resolution videos, to extend the operative range of the eye locators, and to improve the accuracy of the head pose tracker. These enhanced estimations are then combined to obtain a novel visual gaze estimation system, which uses both eye location and head information to refine the gaze estimates. From the experimental results, it can be derived that the proposed unified scheme improves the accuracy of eye estimations by 16% to 23%. Furthermore, it considerably extends its operating range by more than 15<sup>&#x00B0;</sup> by overcoming the problems introduced by extreme head poses. Moreover, the accuracy of the head pose tracker is improved by 12% to 24%. Finally, the experimentation on the proposed combined gaze estimation system shows that it is accurate (with a mean error between 2<sup>&#x00B0;</sup> and 5<sup>&#x00B0;</sup>) and that it can be used in cases where classic approaches would fail without imposing restraints on the position of the head.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5959981]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>802</startPage>
			<endPage>815</endPage>
			<fileSize>1703</fileSize>
			<authors><![CDATA[Valenti, R.;Sebe, N.;Gevers, T.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Tensor Learning for Regression]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986711]]></link>
			<description><![CDATA[In this paper, we exploit the advantages of tensorial representations and propose several tensor learning models for regression. The model is based on the canonical/parallel-factor decomposition of tensors of multiple modes and allows the simultaneous projections of an input tensor to more than one direction along each mode. Two empirical risk functions are studied, namely, the square loss and &#x03B5;-insensitive loss functions. The former leads to higher rank tensor ridge regression (TRR), and the latter leads to higher rank support tensor regression (STR), both formulated using the Frobenius norm for regularization. We also use the group-sparsity norm for regularization, favoring in that way the low rank decomposition of the tensorial weight. In that way, we achieve the automatic selection of the rank during the learning process and obtain the optimal-rank TRR and STR. Experiments conducted for the problems of head-pose, human-age, and 3-D body-pose estimations using real data from publicly available databases, verified not only the superiority of tensors over their vector counterparts but also the efficiency of the proposed algorithms.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986711]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>816</startPage>
			<endPage>827</endPage>
			<fileSize>1167</fileSize>
			<authors><![CDATA[Weiwei Guo;Kotsia, I.;Patras, I.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Object Segmentation of Database Images by Dual Multiscale Morphological Reconstructions and Retrieval Applications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6006528]]></link>
			<description><![CDATA[Processing images for specific targets on a large scale has to handle various kinds of contents with regular processing steps. To segment objects in one image, we utilized dual multiScalE Graylevel mOrphological open and close recoNstructions (SEGON) to build a background (BG) gray-level variation mesh, which can help to identify BG and object regions. It was developed from a macroscopic perspective on image BG gray levels and implemented using standard procedures, thus robustly dealing with large-scale database images. The image segmentation capability of existing methods can be exploited by the BG mesh to improve object segmentation accuracy. To evaluate the segmentation accuracy, the probability of coherent segmentation labeling, i.e., the normalized probability random index (PRI), between a computer-segmented image and the hand-labeled one is computed for comparisons. Content-based image retrieval (CBIR) was carried out to evaluate the object segmentation capability in dealing with large-scale database images. Retrieval precision-recall (PR) and rank performances, with and without SEGON, were compared. For multi-instance retrieval with shape feature, AdaBoost was used to select salient common feature elements. For color features, the histogram intersection between two scalable HSV descriptors was calculated, and the mean feature vector was used for multi-instance retrieval. The distance measure for color feature can be adapted when both positive and negative queries are provided. The normalized correlation coefficient of features among query samples was computed to integrate the similarity ranks of different features in order to perform multi-instance with multifeature query. Experiments showed that the proposed object segmentation method outperforms others by 21% in the PRI. Performing SEGON-enabled CBIR on large-scale databases also improves on the PR performance reported elsewhere by up to 42% at a recall rate of 0.5. The proposed object segmentation method -
an be extended to extract other image features, and new feature types can be incorporated into the algorithm to further improve the image retrieval performance.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6006528]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>828</startPage>
			<endPage>843</endPage>
			<fileSize>2135</fileSize>
			<authors><![CDATA[Jiann-Jone Chen;Chun-Rong Su;Grimson, W.E.L.;Jun-Lin Liu;De-Hui Shiue;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Statistical Method for 2-D Facial Landmarking]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5963714]]></link>
			<description><![CDATA[Many facial-analysis approaches rely on robust and accurate automatic facial landmarking to correctly function. In this paper, we describe a statistical method for automatic facial-landmark localization. Our landmarking relies on a parsimonious mixture model of Gabor wavelet features, computed in coarse-to-fine fashion and complemented with a shape prior. We assess the accuracy and the robustness of the proposed approach in extensive cross-database conditions conducted on four face data sets (Face Recognition Grand Challenge, Cohn-Kanade, Bosphorus, and BioID). Our method has 99.33% accuracy on the Bosphorus database and 97.62% accuracy on the BioID database on the average, which improves the state of the art. We show that the method is not significantly affected by low-resolution images, small rotations, facial expressions, and natural occlusions such as beard and mustache. We further test the goodness of the landmarks in a facial expression recognition application and report landmarking-induced improvement over baseline on two separate databases for video-based expression recognition (Cohn-Kanade and BU-4DFE).]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5963714]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>844</startPage>
			<endPage>858</endPage>
			<fileSize>1440</fileSize>
			<authors><![CDATA[Dibeklioglu, H.;Salah, A.A.;Gevers, T.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Spatially Optimized Data-Level Fusion of Texture and Shape for Face Recognition]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986710]]></link>
			<description><![CDATA[Data-level fusion is believed to have the potential for enhancing human face recognition. However, due to a number of challenges, current techniques have failed to achieve its full potential. We propose spatially optimized data/pixel-level fusion of 3-D shape and texture for face recognition. Fusion functions are objectively optimized to model expression and illumination variations in linear subspaces for invariant face recognition. Parameters of adjacent functions are constrained to smoothly vary for effective numerical regularization. In addition to spatial optimization, multiple nonlinear fusion models are combined to enhance their learning capabilities. Experiments on the FRGC v2 data set show that spatial optimization, higher order fusion functions, and the combination of multiple such functions systematically improve performance, which is, for the first time, higher than score-level fusion in a similar experimental setup.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986710]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>859</startPage>
			<endPage>872</endPage>
			<fileSize>1126</fileSize>
			<authors><![CDATA[Al-Osaimi, F.R.;Bennamoun, M.;Mian, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Single-Image Refocusing and Defocusing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5959982]]></link>
			<description><![CDATA[In this paper, we present a postprocessing method to tackle the single-image refocusing-and-defocusing problem. The proposed method can accomplish the tasks of focus-map estimation and image refocusing and defocusing. Given an image with a mixture of focused and defocused objects, we first detect the edges and then estimate the focus map based on the edge blurriness, which is depicted explicitly by a parametric model. The image refocusing problem is addressed in a blind deconvolution framework, where the image prior is modeled by using both global and local constraints. In particular, we correct the defocused blurry edges to sharp ones with the aid of the parametric edge model and then render this cue as a local prior to ensure the sharpness of the refocused image. Experimental results demonstrate that the proposed method performs well in producing visually plausible images with different focus effects from a single input.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5959982]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>873</startPage>
			<endPage>882</endPage>
			<fileSize>1413</fileSize>
			<authors><![CDATA[Wei Zhang;Wai-Kuen Cham;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Alternating Minimization Algorithm for Binary Image Restoration]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5957297]]></link>
			<description><![CDATA[The problem we will consider in this paper is binary image restoration. It is, in essence, difficult to solve because of the combinatorial nature of the problem. To overcome this difficulty, we propose a new minimization model by making use of a new variable to enforce the image to be binary. Based on the proposed minimization model, we present a fast alternating minimization algorithm for binary image restoration. We prove the convergence of the proposed alternating minimization algorithm. Experimental results show that the proposed method is feasible and effective for binary image restoration.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5957297]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>883</startPage>
			<endPage>888</endPage>
			<fileSize>902</fileSize>
			<authors><![CDATA[Jianjun Zhang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Design of Interpolation Functions for Subpixel-Accuracy Stereo-Vision Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5963716]]></link>
			<description><![CDATA[Traditionally, subpixel interpolation in stereo-vision systems was designed for the block-matching algorithm. During the evaluation of different interpolation strategies, a strong correlation was observed between the type of the stereo algorithm and the subpixel accuracy of the different solutions. Subpixel interpolation should be adapted to each stereo algorithm to achieve maximum accuracy. In consequence, it is more important to propose methodologies for interpolation function generation than specific function shapes. We propose two such methodologies based on data generated by the stereo algorithms. The first proposal uses a histogram to model the environment and applies histogram equalization to an existing solution adapting it to the data. The second proposal employs synthetic images of a known environment and applies function fitting to the resulted data. The resulting function matches the algorithm and the data as best as possible. An extensive evaluation set is used to validate the findings. Both real and synthetic test cases were employed in different scenarios. The test results are consistent and show significant improvements compared with traditional solutions.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5963716]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>889</startPage>
			<endPage>898</endPage>
			<fileSize>1257</fileSize>
			<authors><![CDATA[Haller, I.;Nedevschi, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Eye-Tracking Database for a Set of Standard Video Sequences]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986709]]></link>
			<description><![CDATA[This correspondence describes a publicly available database of eye-tracking data, collected on a set of standard video sequences that are frequently used in video compression, processing, and transmission simulations. A unique feature of this database is that it contains eye-tracking data for both the first and second viewings of the sequence. We have made available the uncompressed video sequences and the raw eye-tracking data for each sequence, along with different visualizations of the data and a preliminary analysis based on two well-known visual attention models.]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=5986709]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>898</startPage>
			<endPage>903</endPage>
			<fileSize>457</fileSize>
			<authors><![CDATA[Hadizadeh, H.;Enriquez, M.J.;Bajic, I.V.;]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Image Processing Edics]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129828]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129828]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>904</startPage>
			<endPage>904</endPage>
			<fileSize>21</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Image Processing information for authors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129829]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129829]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>905</startPage>
			<endPage>906</endPage>
			<fileSize>46</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Have you visited lately? www.ieee.org]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129832]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129832]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>907</startPage>
			<endPage>907</endPage>
			<fileSize>225</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Why we joined]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129831]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129831]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>908</startPage>
			<endPage>908</endPage>
			<fileSize>205</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Signal Processing Society Information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129827]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Feb.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6129825&arnumber=6129827]]></guid>
			<volume>21</volume>
			<issue>2</issue>
			<startPage>C3</startPage>
			<endPage>C3</endPage>
			<fileSize>34</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>
