IEEE Transactions on Image Processing
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 21 Issue: 7
- Vol: 21 Issue: 8
- Vol: 21 Issue: 9
- Vol: 21 Issue: 10
- Vol: 21 Issue: 11
- Vol: 21 Issue: 12
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 20 Issue: 7
- Vol: 20 Issue: 8
- Vol: 20 Issue: 9
- Vol: 20 Issue: 10
- Vol: 20 Issue: 11
- Vol: 20 Issue: 12
- Vol: 19 Issue: 1
- Vol: 19 Issue: 2
- Vol: 19 Issue: 3
- Vol: 19 Issue: 4
- Vol: 19 Issue: 5
- Vol: 19 Issue: 6
- Vol: 19 Issue: 7
- Vol: 19 Issue: 8
- Vol: 19 Issue: 9
- Vol: 19 Issue: 10
- Vol: 19 Issue: 11
- Vol: 19 Issue: 12
- Vol: 18 Issue: 1
- Vol: 18 Issue: 2
- Vol: 18 Issue: 3
- Vol: 18 Issue: 4
- Vol: 18 Issue: 5
- Vol: 18 Issue: 6
- Vol: 18 Issue: 7
- Vol: 18 Issue: 8
- Vol: 18 Issue: 9
- Vol: 18 Issue: 10
- Vol: 18 Issue: 11
- Vol: 18 Issue: 12
- Vol: 7 Issue: 1
- Vol: 7 Issue: 2
- Vol: 7 Issue: 3
- Vol: 7 Issue: 4
- Vol: 7 Issue: 5
- Vol: 7 Issue: 6
- Vol: 7 Issue: 7
- Vol: 7 Issue: 8
- Vol: 7 Issue: 9
- Vol: 7 Issue: 10
- Vol: 7 Issue: 11
- Vol: 7 Issue: 12
- Vol: 17 Issue: 1
- Vol: 17 Issue: 2
- Vol: 17 Issue: 3
- Vol: 17 Issue: 4
- Vol: 17 Issue: 5
- Vol: 17 Issue: 6
- Vol: 17 Issue: 7
- Vol: 17 Issue: 8
- Vol: 17 Issue: 9
- Vol: 17 Issue: 10
- Vol: 17 Issue: 11
- Vol: 17 Issue: 12
- Vol: 6 Issue: 1
- Vol: 6 Issue: 2
- Vol: 6 Issue: 3
- Vol: 6 Issue: 4
- Vol: 6 Issue: 5
- Vol: 6 Issue: 6
- Vol: 6 Issue: 7
- Vol: 6 Issue: 8
- Vol: 6 Issue: 9
- Vol: 6 Issue: 10
- Vol: 6 Issue: 11
- Vol: 6 Issue: 12
- Vol: 16 Issue: 1
- Vol: 16 Issue: 2
- Vol: 16 Issue: 3
- Vol: 16 Issue: 4
- Vol: 16 Issue: 5
- Vol: 16 Issue: 6
- Vol: 16 Issue: 7
- Vol: 16 Issue: 8
- Vol: 16 Issue: 9
- Vol: 16 Issue: 10
- Vol: 16 Issue: 11
- Vol: 16 Issue: 12
- Vol: 5 Issue: 1
- Vol: 5 Issue: 2
- Vol: 5 Issue: 3
- Vol: 5 Issue: 4
- Vol: 5 Issue: 5
- Vol: 5 Issue: 6
- Vol: 5 Issue: 7
- Vol: 5 Issue: 8
- Vol: 5 Issue: 9
- Vol: 5 Issue: 10
- Vol: 5 Issue: 11
- Vol: 5 Issue: 12
- Vol: 15 Issue: 1
- Vol: 15 Issue: 2
- Vol: 15 Issue: 3
- Vol: 15 Issue: 4
- Vol: 15 Issue: 5
- Vol: 15 Issue: 6
- Vol: 15 Issue: 7
- Vol: 15 Issue: 8
- Vol: 15 Issue: 9
- Vol: 15 Issue: 10
- Vol: 15 Issue: 11
- Vol: 15 Issue: 12
- Vol: 4 Issue: 1
- Vol: 4 Issue: 2
- Vol: 4 Issue: 3
- Vol: 4 Issue: 4
- Vol: 4 Issue: 5
- Vol: 4 Issue: 6
- Vol: 4 Issue: 7
- Vol: 4 Issue: 8
- Vol: 4 Issue: 9
- Vol: 4 Issue: 10
- Vol: 4 Issue: 11
- Vol: 4 Issue: 12
- Vol: 14 Issue: 1
- Vol: 14 Issue: 2
- Vol: 14 Issue: 3
- Vol: 14 Issue: 4
- Vol: 14 Issue: 5
- Vol: 14 Issue: 6
- Vol: 14 Issue: 7
- Vol: 14 Issue: 8
- Vol: 14 Issue: 9
- Vol: 14 Issue: 10
- Vol: 14 Issue: 11
- Vol: 14 Issue: 12
- Vol: 13 Issue: 1
- Vol: 13 Issue: 2
- Vol: 13 Issue: 3
- Vol: 13 Issue: 4
- Vol: 13 Issue: 5
- Vol: 13 Issue: 6
- Vol: 13 Issue: 7
- Vol: 13 Issue: 8
- Vol: 13 Issue: 9
- Vol: 13 Issue: 10
- Vol: 13 Issue: 11
- Vol: 13 Issue: 12
- Vol: 12 Issue: 1
- Vol: 12 Issue: 2
- Vol: 12 Issue: 3
- Vol: 12 Issue: 4
- Vol: 12 Issue: 5
- Vol: 12 Issue: 6
- Vol: 12 Issue: 7
- Vol: 12 Issue: 8
- Vol: 12 Issue: 9
- Vol: 12 Issue: 10
- Vol: 12 Issue: 11
- Vol: 12 Issue: 12
- Vol: 11 Issue: 1
- Vol: 11 Issue: 2
- Vol: 11 Issue: 3
- Vol: 11 Issue: 4
- Vol: 11 Issue: 5
- Vol: 11 Issue: 6
- Vol: 11 Issue: 7
- Vol: 11 Issue: 8
- Vol: 11 Issue: 9
- Vol: 11 Issue: 10
- Vol: 11 Issue: 11
- Vol: 11 Issue: 12
- Vol: 8 Issue: 1
- Vol: 8 Issue: 2
- Vol: 8 Issue: 3
- Vol: 8 Issue: 4
- Vol: 8 Issue: 5
- Vol: 8 Issue: 6
- Vol: 8 Issue: 7
- Vol: 8 Issue: 8
- Vol: 8 Issue: 9
- Vol: 8 Issue: 10
- Vol: 8 Issue: 11
- Vol: 8 Issue: 12
- Vol: 10 Issue: 1
- Vol: 10 Issue: 2
- Vol: 10 Issue: 3
- Vol: 10 Issue: 4
- Vol: 10 Issue: 5
- Vol: 10 Issue: 6
- Vol: 10 Issue: 7
- Vol: 10 Issue: 8
- Vol: 10 Issue: 9
- Vol: 10 Issue: 10
- Vol: 10 Issue: 11
- Vol: 10 Issue: 12
- Vol: 9 Issue: 1
- Vol: 9 Issue: 2
- Vol: 9 Issue: 3
- Vol: 9 Issue: 4
- Vol: 9 Issue: 5
- Vol: 9 Issue: 6
- Vol: 9 Issue: 7
- Vol: 9 Issue: 8
- Vol: 9 Issue: 9
- Vol: 9 Issue: 10
- Vol: 9 Issue: 11
- Vol: 9 Issue: 12
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 26 Issue: 7
- Vol: 26 Issue: 8
- Vol: 26 Issue: 9
- Vol: 26 Issue: 10
- Vol: 26 Issue: 11
- Vol: 26 Issue: 12
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 25 Issue: 7
- Vol: 25 Issue: 8
- Vol: 25 Issue: 9
- Vol: 25 Issue: 10
- Vol: 25 Issue: 11
- Vol: 25 Issue: 12
- Vol: 24 Issue: 1
- Vol: 24 Issue: 2
- Vol: 24 Issue: 3
- Vol: 24 Issue: 4
- Vol: 24 Issue: 5
- Vol: 24 Issue: 6
- Vol: 24 Issue: 7
- Vol: 24 Issue: 8
- Vol: 24 Issue: 9
- Vol: 24 Issue: 10
- Vol: 24 Issue: 11
- Vol: 24 Issue: 12
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 21 Issue: 7
- Vol: 21 Issue: 8
- Vol: 21 Issue: 9
- Vol: 21 Issue: 10
- Vol: 21 Issue: 11
- Vol: 21 Issue: 12
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 20 Issue: 7
- Vol: 20 Issue: 8
- Vol: 20 Issue: 9
- Vol: 20 Issue: 10
- Vol: 20 Issue: 11
- Vol: 20 Issue: 12
- Vol: 19 Issue: 1
- Vol: 19 Issue: 2
- Vol: 19 Issue: 3
- Vol: 19 Issue: 4
- Vol: 19 Issue: 5
- Vol: 19 Issue: 6
- Vol: 19 Issue: 7
- Vol: 19 Issue: 8
- Vol: 19 Issue: 9
- Vol: 19 Issue: 10
- Vol: 19 Issue: 11
- Vol: 19 Issue: 12
- Vol: 18 Issue: 1
- Vol: 18 Issue: 2
- Vol: 18 Issue: 3
- Vol: 18 Issue: 4
- Vol: 18 Issue: 5
- Vol: 18 Issue: 6
- Vol: 18 Issue: 7
- Vol: 18 Issue: 8
- Vol: 18 Issue: 9
- Vol: 18 Issue: 10
- Vol: 18 Issue: 11
- Vol: 18 Issue: 12
- Vol: 7 Issue: 1
- Vol: 7 Issue: 2
- Vol: 7 Issue: 3
- Vol: 7 Issue: 4
- Vol: 7 Issue: 5
- Vol: 7 Issue: 6
- Vol: 7 Issue: 7
- Vol: 7 Issue: 8
- Vol: 7 Issue: 9
- Vol: 7 Issue: 10
- Vol: 7 Issue: 11
- Vol: 7 Issue: 12
- Vol: 17 Issue: 1
- Vol: 17 Issue: 2
- Vol: 17 Issue: 3
- Vol: 17 Issue: 4
- Vol: 17 Issue: 5
- Vol: 17 Issue: 6
- Vol: 17 Issue: 7
- Vol: 17 Issue: 8
- Vol: 17 Issue: 9
- Vol: 17 Issue: 10
- Vol: 17 Issue: 11
- Vol: 17 Issue: 12
- Vol: 6 Issue: 1
- Vol: 6 Issue: 2
- Vol: 6 Issue: 3
- Vol: 6 Issue: 4
- Vol: 6 Issue: 5
- Vol: 6 Issue: 6
- Vol: 6 Issue: 7
- Vol: 6 Issue: 8
- Vol: 6 Issue: 9
- Vol: 6 Issue: 10
- Vol: 6 Issue: 11
- Vol: 6 Issue: 12
- Vol: 16 Issue: 1
- Vol: 16 Issue: 2
- Vol: 16 Issue: 3
- Vol: 16 Issue: 4
- Vol: 16 Issue: 5
- Vol: 16 Issue: 6
- Vol: 16 Issue: 7
- Vol: 16 Issue: 8
- Vol: 16 Issue: 9
- Vol: 16 Issue: 10
- Vol: 16 Issue: 11
- Vol: 16 Issue: 12
- Vol: 5 Issue: 1
- Vol: 5 Issue: 2
- Vol: 5 Issue: 3
- Vol: 5 Issue: 4
- Vol: 5 Issue: 5
- Vol: 5 Issue: 6
- Vol: 5 Issue: 7
- Vol: 5 Issue: 8
- Vol: 5 Issue: 9
- Vol: 5 Issue: 10
- Vol: 5 Issue: 11
- Vol: 5 Issue: 12
- Vol: 15 Issue: 1
- Vol: 15 Issue: 2
- Vol: 15 Issue: 3
- Vol: 15 Issue: 4
- Vol: 15 Issue: 5
- Vol: 15 Issue: 6
- Vol: 15 Issue: 7
- Vol: 15 Issue: 8
- Vol: 15 Issue: 9
- Vol: 15 Issue: 10
- Vol: 15 Issue: 11
- Vol: 15 Issue: 12
- Vol: 4 Issue: 1
- Vol: 4 Issue: 2
- Vol: 4 Issue: 3
- Vol: 4 Issue: 4
- Vol: 4 Issue: 5
- Vol: 4 Issue: 6
- Vol: 4 Issue: 7
- Vol: 4 Issue: 8
- Vol: 4 Issue: 9
- Vol: 4 Issue: 10
- Vol: 4 Issue: 11
- Vol: 4 Issue: 12
- Vol: 14 Issue: 1
- Vol: 14 Issue: 2
- Vol: 14 Issue: 3
- Vol: 14 Issue: 4
- Vol: 14 Issue: 5
- Vol: 14 Issue: 6
- Vol: 14 Issue: 7
- Vol: 14 Issue: 8
- Vol: 14 Issue: 9
- Vol: 14 Issue: 10
- Vol: 14 Issue: 11
- Vol: 14 Issue: 12
- Vol: 13 Issue: 1
- Vol: 13 Issue: 2
- Vol: 13 Issue: 3
- Vol: 13 Issue: 4
- Vol: 13 Issue: 5
- Vol: 13 Issue: 6
- Vol: 13 Issue: 7
- Vol: 13 Issue: 8
- Vol: 13 Issue: 9
- Vol: 13 Issue: 10
- Vol: 13 Issue: 11
- Vol: 13 Issue: 12
- Vol: 12 Issue: 1
- Vol: 12 Issue: 2
- Vol: 12 Issue: 3
- Vol: 12 Issue: 4
- Vol: 12 Issue: 5
- Vol: 12 Issue: 6
- Vol: 12 Issue: 7
- Vol: 12 Issue: 8
- Vol: 12 Issue: 9
- Vol: 12 Issue: 10
- Vol: 12 Issue: 11
- Vol: 12 Issue: 12
- Vol: 11 Issue: 1
- Vol: 11 Issue: 2
- Vol: 11 Issue: 3
- Vol: 11 Issue: 4
- Vol: 11 Issue: 5
- Vol: 11 Issue: 6
- Vol: 11 Issue: 7
- Vol: 11 Issue: 8
- Vol: 11 Issue: 9
- Vol: 11 Issue: 10
- Vol: 11 Issue: 11
- Vol: 11 Issue: 12
- Vol: 8 Issue: 1
- Vol: 8 Issue: 2
- Vol: 8 Issue: 3
- Vol: 8 Issue: 4
- Vol: 8 Issue: 5
- Vol: 8 Issue: 6
- Vol: 8 Issue: 7
- Vol: 8 Issue: 8
- Vol: 8 Issue: 9
- Vol: 8 Issue: 10
- Vol: 8 Issue: 11
- Vol: 8 Issue: 12
- Vol: 10 Issue: 1
- Vol: 10 Issue: 2
- Vol: 10 Issue: 3
- Vol: 10 Issue: 4
- Vol: 10 Issue: 5
- Vol: 10 Issue: 6
- Vol: 10 Issue: 7
- Vol: 10 Issue: 8
- Vol: 10 Issue: 9
- Vol: 10 Issue: 10
- Vol: 10 Issue: 11
- Vol: 10 Issue: 12
- Vol: 9 Issue: 1
- Vol: 9 Issue: 2
- Vol: 9 Issue: 3
- Vol: 9 Issue: 4
- Vol: 9 Issue: 5
- Vol: 9 Issue: 6
- Vol: 9 Issue: 7
- Vol: 9 Issue: 8
- Vol: 9 Issue: 9
- Vol: 9 Issue: 10
- Vol: 9 Issue: 11
- Vol: 9 Issue: 12
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 26 Issue: 7
- Vol: 26 Issue: 8
- Vol: 26 Issue: 9
- Vol: 26 Issue: 10
- Vol: 26 Issue: 11
- Vol: 26 Issue: 12
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 25 Issue: 7
- Vol: 25 Issue: 8
- Vol: 25 Issue: 9
- Vol: 25 Issue: 10
- Vol: 25 Issue: 11
- Vol: 25 Issue: 12
- Vol: 24 Issue: 1
- Vol: 24 Issue: 2
- Vol: 24 Issue: 3
- Vol: 24 Issue: 4
- Vol: 24 Issue: 5
- Vol: 24 Issue: 6
- Vol: 24 Issue: 7
- Vol: 24 Issue: 8
- Vol: 24 Issue: 9
- Vol: 24 Issue: 10
- Vol: 24 Issue: 11
- Vol: 24 Issue: 12
Volume 5 Issue 4 • Apr 1996
Sponsor
Filter Results
-
An improved recursive median filtering scheme for image processing
Publication Year: 1996, Page(s):646 - 648
Cited by: Papers (35)In a recent publication, it was shown that median filtering is an optimization process in which a two-term cost function is minimized. Based on this functional optimization property of the median filtering process, a new approach for designing the recursive median filter for image processing applications is introduced in this paper. We prove that the new approach is guaranteed to converge to root ... View full abstract»
-
Feature extraction for texture discrimination via random field models with random spatial interaction
Publication Year: 1996, Page(s):635 - 645
Cited by: Papers (20)In this paper, we attack the problem of distinguishing textured images of real surfaces using small samples. We first analyze experimental data that results from applying ordinary conditional Markov fields. In the face of the disappointing performance of these models, we introduce a random field with spatial interaction that is itself a random variable (usually referred to as a random field in a r... View full abstract»
-
Spatially adaptive wavelet-based multiscale image restoration
Publication Year: 1996, Page(s):619 - 634
Cited by: Papers (78) | Patents (2)In this paper, we present a new spatially adaptive approach to the restoration of noisy blurred images, which is particularly effective at producing sharp deconvolution while suppressing the noise in the flat regions of an image. This is accomplished through a multiscale Kalman smoothing filter applied to a prefiltered observed image in the discrete, separable, 2-D wavelet domain. The prefiltering... View full abstract»
-
Still image coding based on vector quantization and fractal approximation
Publication Year: 1996, Page(s):587 - 597
Cited by: Papers (13) | Patents (26)In this paper, we propose a coding algorithm for still images using vector quantization (VQ) and fractal approximation, in which low-frequency components of an input image are approximated by VQ, and its residual is coded by fractal mapping. The conventional fractal coding algorithms indirectly used the gray patterns of an original image with contraction mapping, whereas the proposed fractal codin... View full abstract»
-
Reduction of boundary artifacts in image restoration
Publication Year: 1996, Page(s):611 - 618
Cited by: Papers (20) | Patents (14)The abrupt boundary truncation of an image introduces artifacts in the restored image. The traditional solution is to smooth the image data using special window functions such as Hamming or trapezoidal windows. This is followed by zero-padding and linear convolution with the restoration filter. This method improves the results but still distorts the image, especially at the margins. Instead of the... View full abstract»
-
Applications of universal context modeling to lossless compression of gray-scale images
Publication Year: 1996, Page(s):575 - 586
Cited by: Papers (138) | Patents (50)Inspired by theoretical results on universal modeling, a general framework for sequential modeling of gray-scale images is proposed and applied to lossless compression. The model is based on stochastic complexity considerations and is implemented with a tree structure. It is efficiently estimated by a modification of the universal algorithm context. Several variants of the algorithm are described.... View full abstract»
-
Epipolar line estimation and rectification for stereo image pairs
Publication Year: 1996, Page(s):672 - 676
Cited by: Papers (71) | Patents (10)The assumption that epipolar lines are parallel to image scan lines is made in many algorithms for stereo analysis. If valid, it enables the search for corresponding image features to be confined to one dimension and, hence, simplified. An algorithm that generates a vertically aligned stereo pair by warped resampling is described. The method uses grey scale image matching between the components of... View full abstract»
-
Adaptive restoration of textured images with mixed spectra
Publication Year: 1996, Page(s):648 - 652
Cited by: Papers (10)We consider the adaptive restoration of inhomogeneous textured images, where the individual regions are modeled using a Wold-like decomposition. A generalized Wiener filter is developed to accommodate mixed spectra, and unsupervised restoration is achieved by using the expectation-maximization (EM) algorithm to estimate the degradation parameters. This algorithm yields superior results when compar... View full abstract»
-
Optical flow: a curve evolution approach
Publication Year: 1996, Page(s):598 - 610
Cited by: Papers (42) | Patents (22)A novel approach for the computation of optical flow based on an L 1 type minimization is presented. It is shown that the approach has inherent advantages since it does not smooth the flow-velocity across the edges and hence preserves edge information. A numerical approach based on computation of evolving curves is proposed for computing the optical flow field. Computations are carried ... View full abstract»
-
The EREC: an error-resilient technique for coding variable-length blocks of data
Publication Year: 1996, Page(s):565 - 574
Cited by: Papers (165) | Patents (13)Many source and data compression schemes work by splitting the input signal into blocks and producing variable-length coded data for each block. If these variable-length blocks are transmitted consecutively, then the resulting coder is highly sensitive to channel errors. Synchronization code words are often used to provide occasional resynchronization at the expense of some added redundant informa... View full abstract»
-
Sampling and processing of color signals
Publication Year: 1996, Page(s):677 - 681
Cited by: Papers (25) | Patents (3)Digital signal processing tools are used to determine the proper sampling of color spectra and the effect of sampling on the accuracy of derived properties such as CIE tristimulus values and color rendering indexes. It is found that 10 nm sampling is adequate for most applications, but not for more exacting textile and paint matching applications. Special methods are proposed to treat the cases of... View full abstract»
-
On the reconstructive matching of multidimensional objects
Publication Year: 1996, Page(s):653 - 661To determine a known object position and orientation within a scene is a task of fundamental importance. A scheme called reconstructive matching (RM), which is inherently invariant to shift, rotation, and optionally to scale changes is introduced. RM decomposes the matching within the source space into a set of mutually independent processes of dimensionality reduced by one. Applied to computerize... View full abstract»
-
A robust automatic clustering scheme for image segmentation using wavelets
Publication Year: 1996, Page(s):662 - 665
Cited by: Papers (71) | Patents (8)The optimal features with which to discriminate between regions and, thus, segment an image often differ depending on the nature of the image. Many real images are made up of both smooth and textured regions and are best segmented using different features in different areas. A scheme that automatically selects the optimal features for each pixel using wavelet analysis is proposed, leading to a rob... View full abstract»
-
Progressive transmission of line drawings using the wavelet transform
Publication Year: 1996, Page(s):666 - 672
Cited by: Papers (1) | Patents (2)This paper presents a method to apply progressive transmission to line drawings using the wavelet transform. Experiments have been conducted and showed that the wavelet transform, combined with a quantization step, performs progressive transmission using a data rate comparable to standard chain coding at the expense of almost no visually perceptible distortion 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.
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