IEEE Transactions on Image Processing

Issue 9 • Sep 1999

Filter Results

Displaying Results 1 - 17 of 17
  • Spatial undersampling for synthetic aperture ultrasonic imaging via digital spotlighting technique

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

    High resolution ultrasonic imaging may be achieved via the synthetic aperture focusing technique, provided that the synthetic antenna is correctly spatially sampled. We show that spatial undersampling is possible, using a digital spotlighting technique that permits to recover the correct reconstructed images from aliased data. The proposed method is applied to experimental ultrasonic data View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal bit allocation and best-basis selection for wavelet packets and TSVQ

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

    To use wavelet packets for lossy data compression, the following issues must be addressed: quantization of the wavelet subbands, allocation of bits to each subband, and best-basis selection. We present an algorithm for wavelet packets that systematically identifies all bit allocations/best-basis selections on the lower convex hull of the rate-distortion curve. We demonstrate the algorithm on tree-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ℒ-M-S filters for image restoration applications

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

    A new filtering architecture is proposed, generalizing some previously introduced multilevel median filters. An efficient design procedure for the new filtering architecture is demonstrated for image restoration application. Simulation results show a good noise rejection performance, combined with a fine detail preservation capability View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two- and three-dimensional image rotation using the FFT

    Publication Year: 1999, Page(s):1297 - 1299
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    Techniques for rotating two- and three-dimensional (2-D and 3-D) images using fast Fourier transforms (FFTs) are presented. The methods are applications of the multidimensional chirp algorithm. In the 2-D case, one chirp transformation is sufficient, requiring four 2-D FFTs, In the 3-D case, two successive chirp transformations are required, needing six 3-D FFTs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient parallel-processing method for transposing large matrices in place

    Publication Year: 1999, Page(s):1265 - 1275
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    We have developed an efficient algorithm for transposing large matrices in place. The algorithm is efficient because data are accessed either sequentially in blocks or randomly within blocks small enough to fit in cache, and because the same indexing calculations are shared among identical procedures operating on independent subsets of the data. This inherent parallelism makes the method well suit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Demosaicing: image reconstruction from color CCD samples

    Publication Year: 1999, Page(s):1221 - 1228
    Cited by:  Papers (254)  |  Patents (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    A simplified color image formation model is used to construct an algorithm for image reconstruction from CCD sensors samples. The proposed method involves two successive steps. The first is motivated by Cok's (1994) template matching technique, while the second step uses steerable inverse diffusion in color. Classical linear signal processing techniques tend to oversmooth the image and result in n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image coding based on a morphological representation of wavelet data

    Publication Year: 1999, Page(s):1161 - 1174
    Cited by:  Papers (113)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1508 KB)

    An experimental study of the statistical properties of wavelet coefficients of image data is presented, as well as the design of two different morphology-based image coding algorithms that make use of these statistics. A salient feature of the proposed methods is that, by a simple change of quantizers, the same basic algorithm yields high performance embedded or fixed rate coders. Another importan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regularity-preserving image interpolation

    Publication Year: 1999, Page(s):1293 - 1297
    Cited by:  Papers (149)  |  Patents (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    Assumptions about image continuity lead to oversmoothed edges in common image interpolation algorithms. A wavelet-based interpolation method that imposes no continuity constraints is introduced. The algorithm estimates the regularity of edges by measuring the decay of wavelet transform coefficients across scales and preserves the underlying regularity by extrapolating a new subband to be used in i... View full abstract»

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

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

    Quadtree-like pyramids have the advantage of re-suiting in a multiresolution representation where each pyramid node has four unambiguous parents. Such a centered topology guarantees a clearly defined up-projection of labels. This concept has been successfully and extensively used in applications of contour detection, object recognition and segmentation. Unfortunately, the quadtree-like type of pyr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Markovian reconstruction using a GNC approach

    Publication Year: 1999, Page(s):1204 - 1220
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1696 KB)

    This paper is concerned with the reconstruction of images (or signals) from incomplete, noisy data, obtained at the output of an observation system. The solution is defined in maximum a posteriori (MAP) sense and it appears as the global minimum of an energy function joining a convex data-fidelity term and a Markovian prior energy. The sought images are composed of nearly homogeneous zones separat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model of the effect of image motion in the Radon transform domain

    Publication Year: 1999, Page(s):1276 - 1281
    Cited by:  Papers (26)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    One of the most fundamental properties of the Radon (projection) transform is that shifting of the image results in shifted projections. This useful property relates translational motion in the image to simple displacement in the projections. It is far from clear, however, how more general types of motion in the image domain will be manifested in the projections. In this paper, we present a model ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy thresholding and its parallel algorithm on the reconfigurable array of processors with wider bus networks

    Publication Year: 1999, Page(s):1229 - 1242
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    Thresholding is the most commonly used technique in image segmentation. We first propose an efficient sequential algorithm to improve the relative entropy-based thresholding technique. This algorithm combines the concepts of the relative entropy with that of the local entropy and also includes the quadtree hierarchical structure in it. Second, we derive a constant time parallel algorithm to solve ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector-scalar classification for transform image coding

    Publication Year: 1999, Page(s):1175 - 1182
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1120 KB)

    This paper introduces vector-scalar classification (VSC) for discrete cosine transform (DCT) coding of images. Two main characteristics of VSC differentiate it from previously proposed classification methods. First, pattern classification is effectively performed in the energy domain of the DCT subvectors using vector quantization. Second, the subvectors, instead of the DCT vectors, are mapped int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the phase response of the error diffusion filter for image halftoning

    Publication Year: 1999, Page(s):1282 - 1292
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2424 KB)

    Conventional error diffusion halftoning uses a causal error filter. We propose the iterative error diffusion algorithm by extending the error diffusion to accommodate noncausal error filters. We realize the importance of the phase response of the error filter in the error diffusion halftoning method, and demonstrate it using examples. Iterative error diffusion is able to realize a zero phase error... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image segmentation and labeling using the Polya urn model

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

    We propose a segmentation method based on Polya's (1931) urn model for contagious phenomena. A preliminary segmentation yields the initial composition of an urn representing the pixel. The resulting urns are then subjected to a modified urn sampling scheme mimicking the development of an infection to yield a segmentation of the image into homogeneous regions. This process is implemented using cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Karhunen-Loeve decomposition in the presence of symmetry. I

    Publication Year: 1999, Page(s):1183 - 1190
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    The Karhunen-Loeve (KL) decomposition is widely used for data which very often exhibit some symmetry, afforded by a group action. For a finite group, we derive an algorithm using group representation theory to reduce the cost of determining the KL basis. We demonstrate the technique on a Lorenz-type ODE system. For a compact group such as tori or SO(3,R) the method also applies, and we ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive regularized constrained least squares image restoration

    Publication Year: 1999, Page(s):1191 - 1203
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1156 KB)

    In noisy environments, a constrained least-squares (CLS) approach is presented to restore images blurred by a Gaussian impulse response, where instead of choosing a global regularization parameter, each point in the signal has its own associated regularization parameter. These parameters are found by constraining the weighted standard deviation of the wavelet transform coefficients on the finest s... 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