By Topic

Image Processing, IEEE Transactions on

Issue 12 • Date Dec. 1998

Filter Results

Displaying Results 1 - 18 of 18
  • List of reviewers

    Publication Year: 1998 , Page(s): 1759 - 1761
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | PDF file iconPDF (15 KB)  
    Freely Available from IEEE
  • 1998 Index IEEE Trans Actions on Image Processing Vol. 7

    Publication Year: 1998 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | PDF file iconPDF (218 KB)  
    Freely Available from IEEE
  • Subject index

    Publication Year: 1998 , Page(s): 6 - 22
    Save to Project icon | Request Permissions | PDF file iconPDF (285 KB)  
    Freely Available from IEEE
  • MAP image restoration and segmentation by constrained optimization

    Publication Year: 1998 , Page(s): 1730 - 1735
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1080 KB)  

    The combinatorial optimization problem of MAP estimation is converted to one of constrained real optimization and then solved by using the augmented Lagrange-Hopfield (ALH) method proposed in 1984. The ALH effectively overcomes instabilities that are inherent in the penalty method or the Lagrange multiplier method in constrained optimization. It produces good solutions with reasonable costs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing JPEG-compressed images and documents

    Publication Year: 1998 , Page(s): 1661 - 1672
    Cited by:  Papers (21)  |  Patents (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (884 KB)  

    As the Joint Photographic Experts Group (JPEG) has become an international standard for image compression, we present techniques that allow the processing of an image in the “JPEG-compressed” domain. The goal is to reduce memory requirements while increasing speed by avoiding decompression and space domain operations. In each case, an effort is made to implement the minimum number of J... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reproducing kernel Hilbert space method for optimal interpolation of potential field data

    Publication Year: 1998 , Page(s): 1725 - 1730
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2504 KB)  

    The RKHS-based optimal image interpolation method, presented by Chen and de Figueiredo (1993), is applied to scattered potential field measurements. The RKHS which admits only interpolants consistent with Laplace's equation is defined and its kernel, derived. The algorithm is compared to bicubic spline interpolation, and is found to yield vastly superior results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inverse error-diffusion using classified vector quantization

    Publication Year: 1998 , Page(s): 1753 - 1758
    Cited by:  Papers (11)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (708 KB)  

    This correspondence extends and modifies classified vector quantization (CVQ) to solve the problem of inverse halftoning. The proposed process consists of two phases: the encoding phase and decoding phase. The encoding procedure needs a codebook for the encoder which transforms a halftoned image to a set of codeword-indices. The decoding process also requires a different codebook for the decoder w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2-D moving average models for texture synthesis and analysis

    Publication Year: 1998 , Page(s): 1741 - 1746
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1308 KB)  

    A random field model based on moving average (MA) time-series model is proposed for modeling stochastic and structured textures. A frequency domain algorithm to synthesize MA textures is developed, and maximum likelihood estimators are derived. The Cramer-Rao lower bound is also derived for measuring the estimator accuracy. The estimation algorithm is applied to real textures, and images resemblin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the reconstruction of quadtree data

    Publication Year: 1998 , Page(s): 1653 - 1660
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (864 KB)  

    Image compression schemes consist of compression and decompression phases. Often, the decompression phase includes mechanisms for improving the quality of the resulting image. Quadtree compression is one such type of compression. Reconstructed quadtree images can be blocky because of the nature of the compression method, unless additional processing, generally smoothing, is performed. We propose i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking nonstationary probabilities in adaptive binary arithmetic coding

    Publication Year: 1998 , Page(s): 1715 - 1717
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (72 KB)  

    Adaptive arithmetic coders sometimes exhibit nonstationary symbol probabilities when coding digital halftone images with neighborhood-template models. If these nonstationary probabilities vary nonrandomly, the variations can be tracked robustly when each context derived from the coding model is expanded by conditioning on previously coded values for that model context View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis filterbank with low hardware complexity for subband image coding

    Publication Year: 1998 , Page(s): 1717 - 1724
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (232 KB)  

    Different algorithms are evaluated and optimizations are performed to obtain a filterbank for subband coding of images especially suited for very large scale integration (VLSI) implementation. Based on a filterbank consisting of two finite impulse response (FIR) filters combined with an 8-point discrete cosine transform (DCT), we investigate how the quantization of filter coefficients and twiddle ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid image segmentation using watersheds and fast region merging

    Publication Year: 1998 , Page(s): 1684 - 1699
    Cited by:  Papers (128)  |  Patents (31)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1256 KB)  

    A hybrid multidimensional image segmentation algorithm is proposed, which combines edge and region-based techniques through the morphological algorithm of watersheds. An edge-preserving statistical noise reduction approach is used as a preprocessing stage in order to compute an accurate estimate of the image gradient. Then, an initial partitioning of the image into primitive regions is produced by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Line and boundary detection in speckle images

    Publication Year: 1998 , Page(s): 1700 - 1714
    Cited by:  Papers (33)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1128 KB)  

    This paper considers the problem of detecting lines in speckle imagery, such as that produced by synthetic aperture radar (SAR) or ultrasound techniques. Using the physical principles that account for the speckle phenomenon, we derive the optimal detector for lines in fully developed speckle, and we compare the optimal detector to several suboptimal detection rules that are more computationally ef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intensity mappings within the context of near-sensor image processing

    Publication Year: 1998 , Page(s): 1736 - 1741
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (316 KB)  

    In the original near-sensor image processing (NSIP) concept, the intensity level for an individual sensor element is mapped onto the time axis so that the time to reach the threshold is inversely proportional to the intensity. In many cases this is favorable, in some cases there is a need for another mapping between time and intensity. We show that such mappings can be achieved by either inserting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossy compression of noisy images

    Publication Year: 1998 , Page(s): 1641 - 1652
    Cited by:  Papers (24)  |  Patents (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1764 KB)  

    Noise degrades the performance of any image compression algorithm. This paper studies the effect of noise on lossy image compression. The effect of Gaussian, Poisson, and film-grain noise on compression is studied. To reduce the effect of the noise on compression, the distortion is measured with respect to the original image not to the input of the coder. Results of noisy source coding are then us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Corrections to “JPEG dequantization array for regularized decompression”

    Publication Year: 1998
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (28 KB)  

    An error in the theoretical derivations leading up to the main equation in the article by Frost et al. (see ibid., vol.6, p.883-88, 1997) is pointed out, and corrections are presented. Due to the error, the experimentally obtained “optimal” parameters are really only suboptimal View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A maximum likelihood estimate for two-variable fractal surface

    Publication Year: 1998 , Page(s): 1746 - 1753
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (164 KB)  

    The fractal dimension estimate for two-variable fractional Brownian motion using the maximum likelihood estimate (MLE) is developed. We formulate a model to describe the two-variable fractional Brownian motion, then derive the likelihood function for that model and estimate the fractal dimension by maximizing the likelihood function. We then compare the MLE with the box-dimension estimation method View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image segmentation via adaptive K-mean clustering and knowledge-based morphological operations with biomedical applications

    Publication Year: 1998 , Page(s): 1673 - 1683
    Cited by:  Papers (39)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (468 KB)  

    Image segmentation remains one of the major challenges in image analysis. In medical applications, skilled operators are usually employed to extract the desired regions that may be anatomically separate but statistically indistinguishable. Such manual processing is subject to operator errors and biases, is extremely time consuming, and has poor reproducibility. We propose a robust algorithm for th... View full abstract»

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

Aims & Scope

IEEE Transactions on Image Processing focuses on signal-processing aspects of image processing, imaging systems, and image scanning, display, and printing.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Scott Acton
University of Virginia
Charlottesville, VA, USA
E-mail: acton@virginia.edu 
Phone: +1 434-982-2003