By Topic

IEEE Transactions on Image Processing

Issue 7 • Date Jul 1999

Filter Results

Displaying Results 1 - 14 of 14
  • An embedded still image coder with rate-distortion optimization

    Publication Year: 1999, Page(s):913 - 924
    Cited by:  Papers (45)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB)

    It is well known that the fixed rate coder achieves optimality when all coefficients are coded with the same rate-distortion (R-D) slope. In this paper, we show that the performance of the embedded coder can be optimized in a rate-distortion sense by coding the coefficients with decreasing R-D slope. We denote such a coding strategy as rate-distortion optimized embedding (RDE). RDE allocates the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple wavelet threshold estimation by generalized cross validation for images with correlated noise

    Publication Year: 1999, Page(s):947 - 953
    Cited by:  Papers (39)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    Denoising algorithms based on wavelet thresholding replace small wavelet coefficients by zero and keep or shrink the coefficients with absolute value above the threshold. The optimal threshold minimizes the error of the result as compared to the unknown, exact data. To estimate this optimal threshold, we use generalized cross validation. This procedure does not require an estimation for the noise ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear filtering by threshold decomposition

    Publication Year: 1999, Page(s):925 - 933
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1540 KB)

    A new threshold decomposition architecture is introduced to implement stack filters. The architecture is also generalized to a new class of nonlinear filters known as threshold decomposition (TD) filters which are shown to be equivalent to the class of L1-filters under certain conditions. Another new class of filters known as linear and order statistic (LOS) filters result from the intersection of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An enhanced NAS-RIF algorithm for blind image deconvolution

    Publication Year: 1999, Page(s):988 - 992
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    We enhance the performance of the nonnegativity and support constraints recursive inverse filtering (NAS-RIF) algorithm for blind image deconvolution. The original cost function is modified to overcome the problem of operation on images with different scales for the representation of pixel intensity levels. Algorithm resetting is used to enhance the convergence of the conjugate gradient algorithm.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bit allocation method based on picture activity for still image coding

    Publication Year: 1999, Page(s):974 - 977
    Cited by:  Papers (25)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    Bit allocation or the quantizer assignment problem is a basic and essential issue in lossy picture coding. The optimal solution for the bit allocation problem can be found by the Lagrangian method. However, it requires much computational time and memory. To reduce complexity overhead, we propose a fast scheme using a picture activity measure. Comparison among the existing activity measurement meth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of Markov random field prior parameters using Markov chain Monte Carlo maximum likelihood

    Publication Year: 1999, Page(s):954 - 963
    Cited by:  Papers (44)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Developments in statistics now allow maximum likelihood estimators for the parameters of Markov random fields (MRFs) to be constructed. We detail the theory required, and present an algorithm that is easily implemented and practical in terms of computation time. We demonstrate this algorithm on three MRF models-the standard Potts model, an inhomogeneous variation of the Potts model, and a long-ran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-dimensional object recognition through two-stage string matching

    Publication Year: 1999, Page(s):978 - 981
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    A two-stage string matching method for the recognition of two-dimensional (2-D) objects is proposed in this work. The first stage is a global cyclic string matching. The second stage is a local matching with local dissimilarity measure computing. The dissimilarity measure function of the input shape and the reference shape are obtained by combining the global matching cost and the local dissimilar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-dimensional Bayesian estimator for image filtering

    Publication Year: 1999, Page(s):993 - 996
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    The two-dimensional (2-D) Bayesian estimator is a recursive filtering useful in smoothing Gaussian white noise of images. In this correspondence, a formula is derived for precomputing the steady-state gain of the 2-D Bayesian estimator. Based on it, some new filterings are developed. Examples show that they can smooth Gaussian white noise more efficiently View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of object location from wideband scattering data

    Publication Year: 1999, Page(s):996 - 1001
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    We present a time domain algorithm for computation of the maximum likelihood estimate of the location of a known scattering object from wide-band scattering data acquired in a suite of scattering experiments. The algorithm consists of a three-step procedure: (1) data filtering, (2) time-domain backpropagation, and (3) coherent summation and is implemented via a number of forward and inverse Radon ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast reconstruction of subband-decomposed progressively transmitted signals

    Publication Year: 1999, Page(s):891 - 898
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    We propose a fast reconstruction method for a subband-decomposed, progressive signal coding system. We show that unlike the conventional approach which requires a fixed computational complexity, the computational complexity of the proposed approach is proportional to the number of refined coefficients at each level of progression. Therefore, unrefined coefficients do not add to the computational c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image registration and object recognition using affine invariants and convex hulls

    Publication Year: 1999, Page(s):934 - 946
    Cited by:  Papers (31)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    This paper is concerned with the problem of feature point registration and scene recognition from images under weak perspective transformations which are well approximated by affine transformations and under possible occlusion and/or appearance of new objects. It presents a set of local absolute affine invariants derived from the convex hull of scattered feature points (e.g., fiducial or marking p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new algorithm for N-dimensional Hilbert scanning

    Publication Year: 1999, Page(s):964 - 973
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    There have been many applications of the Hilbert curve, such as image processing, image compression, computer hologram, etc. The Hilbert curve is a one-to-one mapping between N-dimensional space and one-dimensional (l-D) space which preserves point neighborhoods as much as possible. There are several algorithms for N-dimensional Hilbert scanning, such as the Butz algorithm and the Quinqueton algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source-channel optimized trellis codes for bitonal image transmission over AWGN channels

    Publication Year: 1999, Page(s):899 - 912
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    We consider the design of trellis codes for transmission of binary images over additive white Gaussian noise (AWGN) channels. We first model the image as a binary asymmetric Markov source (BAMS) and then design source-channel optimized (SCO) trellis codes for the BAMS and AWGN channel. The SCO codes are shown to be superior to Ungerboeck's codes by approximately 1.1 dB (64-state code, 10... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Watershed-based maximum-homogeneity filtering

    Publication Year: 1999, Page(s):982 - 988
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB)

    We introduce an image enhancement method referred to as the watershed-based maximum-homogeneity filter. This method first uses watershed analysis to subdivide the image into homogeneous pixel clusters called catchment basins. Next, using an adaptive, local, catchment-basin selection scheme, similar neighboring catchment basins are combined together to produce an enhanced image. Because the method ... 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