By Topic

IEEE Transactions on Image Processing

Issue 5 • Date May 1996

Filter Results

Displaying Results 1 - 14 of 14
  • Further results on MAP optimality and strong consistency of certain classes of morphological filters

    Publication Year: 1996, Page(s):762 - 764
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    Morphological openings and closings can be viewed as consistent MAP estimators of smooth random binary image signals immersed in i.i.d. clutter, or suffering from i.i.d. random dropouts. We revisit this viewpoint under much more general assumptions and show that, quite surprisingly, the above interpretation is still valid View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic gradient threshold determination for edge detection

    Publication Year: 1996, Page(s):784 - 787
    Cited by:  Papers (35)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    We describe a method to automatically find gradient thresholds to separate edge from nonedge pixels. A statistical model that is the weighted sum of two gamma densities corresponding to edge and nonedge pixels is used to identify a threshold. Results closely match human perceptual thresholds even under low signal-to-noise ratio (SNR) levels View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved method for 2-D self-similar image synthesis

    Publication Year: 1996, Page(s):754 - 761
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1156 KB)

    We propose a new method called incremental Fourier synthesis to generate 2-D self-similar images based on a 2D fractional Brownian motion (fBm) model. With this method, the stationary increments of fBm are created by a Fourier synthesis method and the increments are added up to generate the nonstationary 2D fBm process. Since the new method takes advantage of the FFT, its computational complexity ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block-iterative methods for image reconstruction from projections

    Publication Year: 1996, Page(s):792 - 794
    Cited by:  Papers (117)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    The simultaneous MART algorithm (SMART) and the expectation maximization method for likelihood maximization (EMML) are extended to block-iterative versions, BI-SMART and BI-EMML, that converge to a solution in the feasible case, for any choice of subsets. The BI-EMML reduces to the “ordered subset” EMML of Hudson et al. (1992, 1994) when their “subset balanced” property hol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image enhancement using the modified ICM method

    Publication Year: 1996, Page(s):765 - 771
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    A generalized version of the iterative conditional modes (ICM) method for image enhancement is developed. The proposed algorithm utilizes the characteristic of Markov random fields (MRF) in modeling the contextual information embedded in image formation. To cope with real images, a new local MRF model with a second-order neighborhood is introduced. This model extracts contextual information not on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One-pixel-wide closed boundary identification

    Publication Year: 1996, Page(s):780 - 783
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    An appropriate space of one-pixel-wide closed (OPWC) boundary configurations is explicitly defined and an automatic algorithm to obtain OPWC contour estimates from a segmented image is presented. The motivation is to obtain a reasonable starting estimate for a Markov chain Monte Carlo-based (McMC-based) boundary optimization algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast and accurate Fourier algorithm for iterative parallel-beam tomography

    Publication Year: 1996, Page(s):740 - 753
    Cited by:  Papers (34)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2728 KB)

    We use a series-expansion approach and an operator framework to derive a new, fast, and accurate Fourier algorithm for iterative tomographic reconstruction. This algorithm is applicable for parallel-ray projections collected at a finite number of arbitrary view angles and radially sampled at a rate high enough that aliasing errors are small. The conjugate gradient (CG) algorithm is used to minimiz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance of linear phase wavelet transforms in low bit-rate image coding

    Publication Year: 1996, Page(s):689 - 704
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1472 KB)

    The behavior of linear phase wavelet transforms in low bit-rate image coding is investigated. The influence of certain characteristics of these transforms such as regularity, number of vanishing moments, filter length, coding gain, frequency selectivity, and the shape of the wavelets on the coding performance is analyzed. The wavelet transforms performance is assessed based on a first-order Markov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal detection and estimation of straight patterns

    Publication Year: 1996, Page(s):787 - 792
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1476 KB)

    This correspondence illustrates the optimal detector and slope estimator of straight patterns. In particular, it is recognized that the output of the likelihood processor, constituted by the Radon transform and a whitening filter, provides a sufficient statistic for both problems of signal detection as well as orientation and offset estimation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the metric properties of discrete space-filling curves

    Publication Year: 1996, Page(s):794 - 797
    Cited by:  Papers (54)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    A space-filling curve is a linear traversal of a discrete finite multidimensional space. In order for this traversal to be useful in many applications, the curve should preserve “locality”. We quantify “locality” and bound the locality of multidimensional space-filling curves. Classic Hilbert space-filling curves come close to achieving optimal locality View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frame representations for texture segmentation

    Publication Year: 1996, Page(s):771 - 780
    Cited by:  Papers (62)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1464 KB)

    We introduce a novel method of feature extraction for texture segmentation that relies on multichannel wavelet frames and 2-D envelope detection. We describe and compare two algorithms for envelope detection based on (1) the Hilbert transform and (2) zero crossings. We present criteria for filter selection and discuss quantitatively their effect on feature extraction. The performance of our method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speeding up the generalized adaptive neural filters

    Publication Year: 1996, Page(s):705 - 712
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    A new class of adaptive filters called generalized adaptive neural filters (GANFs) has emerged. They share many things in common with stack filters and include all stack filters as a subset. The GANFs allow a very efficient hardware implementation once they are trained. However, the training process can be slow. This paper discusses structural modifications to allow for faster training. In additio... View full abstract»

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

    Publication Year: 1996, Page(s):713 - 719
    Cited by:  Papers (49)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Adaptive DPCM methods using linear prediction are described for the lossless compression of hyperspectral (224-band) images recorded by the Airborne Visible/Infrared Imaging Spectrometer (AVIRIS). The methods have two stages-predictive decorrelation (which produces residuals) and residual encoding. Good predictors are described, whose performance closely approaches limits imposed by sensor noise. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optical flow computation using extended constraints

    Publication Year: 1996, Page(s):720 - 739
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2092 KB)

    Several approaches for optical flow estimation use partial differential equations to model changes in image brightness throughout time. A commonly used equation is the so-called optical flow constraint (OFC), which assumes that the image brightness is stationary with respect to time. More recently, a different constraint referred to as the extended optical flow constraint (EOFC) has been introduce... 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