# IEEE Transactions on Image Processing

## Filter Results

Displaying Results 1 - 25 of 28

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

Publication Year: 2010, Page(s): C2
| PDF (39 KB)
• ### Properties of $BV-G$ Structures $+$ Textures Decomposition Models. Application to Road Detection in Satellite Images

Publication Year: 2010, Page(s):2793 - 2800
Cited by:  Papers (17)
| | PDF (3850 KB) | HTML

In this paper, we present some theoretical results about a structures-textures image decomposition model which was proposed by the second author. We prove a theorem which gives the behavior of this model in different cases. Finally, as a consequence of the theorem we derive an algorithm for the detection of long and thin objects applied to a road networks detection application in aerial or satelli... View full abstract»

• ### Relevance of a Feed-Forward Model of Visual Attention for Goal-Oriented and Free-Viewing Tasks

Publication Year: 2010, Page(s):2801 - 2813
Cited by:  Papers (19)
| | PDF (1433 KB) | HTML

A purely bottom-up model of visual attention is proposed and compared to five state-of-the-art models. The role of the low-level visual features is examined in two contexts. Two datasets are used: one containing data coming from an eye tracking experiment obtained in a free-viewing task and a second containing 5000 hand-label pictures (observers had to enclose the most visually interesting objects... View full abstract»

• ### Edge Detecting for Range Data Using Laplacian Operators

Publication Year: 2010, Page(s):2814 - 2824
Cited by:  Papers (15)
| | PDF (1014 KB) | HTML

Feature extraction in image data has been investigated for many years, and more recently the problem of processing images containing irregularly distributed data has become prominent. Range data are now commonly used in the areas of image processing and computer vision. However, due to the data irregularity found in range images that occurs with a variety of image sensors, direct image processing,... View full abstract»

• ### A PDE Formalization of Retinex Theory

Publication Year: 2010, Page(s):2825 - 2837
Cited by:  Papers (66)
| | PDF (1106 KB) | HTML

In 1964, Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the “reset Retinex” were further formalized by Land and McCann. Several Retinex algorithms have been developed ever since. These color constancy algorithms modify the RGB values at each pixel to give an estimate of t... View full abstract»

• ### Environmentally Robust Motion Detection for Video Surveillance

Publication Year: 2010, Page(s):2838 - 2848
Cited by:  Papers (9)
| | PDF (2692 KB) | HTML

Most video surveillance systems require to manually set a motion detection sensitivity level to generate motion alarms. The performance of motion detection algorithms, embedded in closed circuit television (CCTV) camera and digital video recorder (DVR), usually depends upon the preselected motion sensitivity level, which is expected to work in all environmental conditions. Due to the preselected s... View full abstract»

• ### Minimization of Monotonically Levelable Higher Order MRF Energies via Graph Cuts

Publication Year: 2010, Page(s):2849 - 2860
| | PDF (2390 KB) | HTML

A feature of minimizing images of submodular binary Markov random field (MRF) energies is introduced. Using this novel feature, the collection of minimizing images of levels of higher order, monotonically levelable multilabel MRF energies is shown to constitute a monotone collection. This implies that these minimizing binary images can be combined to give minimizing images of the multilabel MRF en... View full abstract»

• ### Image Super-Resolution Via Sparse Representation

Publication Year: 2010, Page(s):2861 - 2873
Cited by:  Papers (1297)  |  Patents (24)
| | PDF (1802 KB) | HTML

This paper presents a new approach to single-image superresolution, based upon sparse signal representation. Research on image statistics suggests that image patches can be well-represented as a sparse linear combination of elements from an appropriately chosen over-complete dictionary. Inspired by this observation, we seek a sparse representation for each patch of the low-resolution input, and th... View full abstract»

• ### Bayesian Blind Deconvolution From Differently Exposed Image Pairs

Publication Year: 2010, Page(s):2874 - 2888
Cited by:  Papers (13)  |  Patents (1)
| | PDF (1863 KB) | HTML

Photographs acquired under low-lighting conditions require long exposure times and therefore exhibit significant blurring due to the shaking of the camera. Using shorter exposure times results in sharper images but with a very high level of noise. In this paper, we address the problem of utilizing two such images in order to obtain an estimate of the original scene and present a novel blind deconv... View full abstract»

• ### Super-Resolution With Sparse Mixing Estimators

Publication Year: 2010, Page(s):2889 - 2900
Cited by:  Papers (140)  |  Patents (1)
| | PDF (5464 KB) | HTML

We introduce a class of inverse problem estimators computed by mixing adaptively a family of linear estimators corresponding to different priors. Sparse mixing weights are calculated over blocks of coefficients in a frame providing a sparse signal representation. They minimize an l1 norm taking into account the signal regularity in each block. Adaptive directional image interpolations a... View full abstract»

• ### Multiframe Super-Resolution Reconstruction of Small Moving Objects

Publication Year: 2010, Page(s):2901 - 2912
Cited by:  Papers (19)  |  Patents (1)
| | PDF (1537 KB) | HTML

Multiframe super-resolution (SR) reconstruction of small moving objects against a cluttered background is difficult for two reasons: a small object consists completely of “mixed” boundary pixels and the background contribution changes from frame-to-frame. We present a solution to this problem that greatly improves recognition of small moving objects under the assumption of a simple l... View full abstract»

• ### Simplified 2-D Cubic Spline Interpolation Scheme Using Direct Computation Algorithm

Publication Year: 2010, Page(s):2913 - 2923
Cited by:  Papers (4)
| | PDF (4646 KB) | HTML

It has been shown that the 2-D cubic spline interpolation (CSI) proposed by Truong is one of the best algorithms for image resampling or compression. Such a CSI algorithm together with the image coding standard, e.g., JPEG, can be used to obtain a modified image codec while still maintaining a good quality of the reconstructed image for higher compression ratios. In this paper, a fast direct compu... View full abstract»

• ### A Novel Approach to FRUC Using Discriminant Saliency and Frame Segmentation

Publication Year: 2010, Page(s):2924 - 2934
Cited by:  Papers (33)  |  Patents (2)
| | PDF (1624 KB) | HTML

Motion-compensated frame interpolation (MCFI) is a technique used extensively for increasing the temporal frequency of a video sequence. In order to obtain a high quality interpolation, the motion field between frames must be well-estimated. However, many current techniques for determining the motion are prone to errors in occlusion regions, as well as regions with repetitive structure. We propose... View full abstract»

• ### Directional Filtering Transform for Image/Intra-Frame Compression

Publication Year: 2010, Page(s):2935 - 2946
Cited by:  Papers (5)
| | PDF (2519 KB) | HTML

While directional adaption is introduced into traditional transforms, different orders of two 1-D transforms will result in different results of one 2-D transform. Based upon an anisotropic image model, this paper analyzes the effect of transform orders in terms of theoretical coding gain. Our results reveal that the transform orders have little effect on the coding gain with full decomposition, g... View full abstract»

• ### Rate Distortion Analysis for Spatially Scalable Video Coding

Publication Year: 2010, Page(s):2947 - 2957
Cited by:  Papers (7)
| | PDF (993 KB) | HTML

In this paper, we derive the rate distortion lower bounds of spatially scalable video coding techniques. The methods we evaluate are subband and pyramid motion compensation where temporal redundancies in the same spatial layer as well as interlayer spatial redundancies are exploited in the enhancement layer encoding. The rate distortion bounds are derived from rate distortion theory for stationary... View full abstract»

• ### Integer DCT Based on Direct-Lifting of DCT-IDCT for Lossless-to-Lossy Image Coding

Publication Year: 2010, Page(s):2958 - 2965
Cited by:  Papers (27)
| | PDF (749 KB) | HTML

A discrete cosine transform (DCT) can be easily implemented in software and hardware for the JPEG and MPEG formats. However, even though some integer DCTs (IntDCTs) for lossless-to-lossy image coding have been proposed, such transform requires redesigned devices. This paper proposes a hardware-friendly IntDCT that can be applied to both lossless and lossy coding. Our IntDCT is implemented by direc... View full abstract»

• ### A Perceptually Tuned Watermarking Scheme for Color Images

Publication Year: 2010, Page(s):2966 - 2982
Cited by:  Papers (37)
| | PDF (1432 KB) | HTML

Transparency and robustness are two conflicting requirements demanded by digital image watermarking for copyright protection and many other purposes. A feasible way to simultaneously satisfy the two conflicting requirements is to embed high-strength watermark signals in the host signals that can accommodate the distortion due to watermark insertion as part of perceptual redundancy. The search of d... View full abstract»

• ### A Novel Technique for Subpixel Image Classification Based on Support Vector Machine

Publication Year: 2010, Page(s):2983 - 2999
Cited by:  Papers (51)
| | PDF (2046 KB) | HTML

This paper presents a novel support vector machine classifier designed for subpixel image classification (pixel/spectral unmixing). The proposed classifier generalizes the properties of SVMs to the identification and modeling of the abundances of classes in mixed pixels by using fuzzy logic. This results in the definition of a fuzzy-input fuzzy-output support vector machine (F2SVM) clas... View full abstract»

• ### On Optimal Dynamic Sequential Search for Matching in Real-Time Machine Vision

Publication Year: 2010, Page(s):3000 - 3011
| | PDF (819 KB) | HTML

In tracking and geometrical vision, there are usually priors available on the image locations of features of interest. In this paper, we use these priors dynamically to guide a feature by feature matching search. Much less image processing and lower overall computational cost can be expected for getting global matchings. First, the concept of dynamic sequential search (DSS) is presented. Then, the... View full abstract»

• ### LULU Operators and Discrete Pulse Transform for Multidimensional Arrays

Publication Year: 2010, Page(s):3012 - 3023
Cited by:  Papers (6)
| | PDF (1188 KB) | HTML

The LULU operators for sequences, that is Ln, Un and their compositions, are extended to multidimensional arrays in a way which preserves their essential properties, e.g., consistent separation, total variation and shape preservation. The power of the operators is demonstrated by deriving the discrete pulse transform (DPT), which is a hierarchical decomposition of the input array int... View full abstract»

• ### TurboPixel Segmentation Using Eigen-Images

Publication Year: 2010, Page(s):3024 - 3034
Cited by:  Papers (12)
| | PDF (4078 KB) | HTML

TurboPixel (TP) is a powerful tool for image over-segmentation. It is fast and can yield a lattice-like structure of superpixel regions with uniform size. This paper presents a method to learn eigen-images from the image to be segmented. Such eigen-images are used to generate the evolution speed in the TP framework. The task is formulated as a problem of pixel clustering. Specifically, for the pix... View full abstract»

• ### A Distributed Approach for Optimizing Cascaded Classifier Topologies in Real-Time Stream Mining Systems

Publication Year: 2010, Page(s):3035 - 3048
Cited by:  Papers (10)  |  Patents (4)
| | PDF (1360 KB) | HTML

In this paper, we discuss distributed optimization techniques for configuring classifiers in a real-time, informationally-distributed stream mining system. Due to the large volume of streaming data, stream mining systems must often cope with overload, which can lead to poor performance and intolerable processing delay for real-time applications. Furthermore, optimizing over an entire system of cla... View full abstract»

• ### One-Dimensional Mapping for Estimating Projective Transformations

Publication Year: 2010, Page(s):3049 - 3058
Cited by:  Papers (1)
| | PDF (2929 KB) | HTML

In this paper, the 1-D mapping is studied for estimating a general projective transformation between images. First, a ray model of image patches is proposed to convert a complex projective deformation of a patch in the Cartesian space into two simple rigid shifts of radial lines in the log-polar/inverse-polar space. To capture these shifts via direct search, two types of radial image line matching... View full abstract»

• ### Bidirectional Scalable Motion for Scalable Video Coding

Publication Year: 2010, Page(s):3059 - 3064
Cited by:  Papers (2)
| | PDF (1919 KB) | HTML

Motion information scalability is an important requirement for a fully scalable video codec, especially in low bit rate or small resolution decoding scenarios, for which the fully scalable motion model (SMM) has been proposed. SMM can collaborate flawlessly with other scalabilities, such as spatial, temporal and quality, in a scalable video codec. It performs better than the nonscalable motion mod... 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

Gaurav Sharma
University of Rochester
Rochester, NY, USA
E-mail: gaurav.sharma@rochester.edu
Phone: +1 585-275-7313