By Topic

Image Processing, IEEE Transactions on

Issue 3 • Date Mar 1995

Filter Results

Displaying Results 1 - 15 of 15
  • Recursive erosion, dilation, opening, and closing transforms

    Publication Year: 1995 , Page(s): 335 - 345
    Cited by:  Papers (11)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (980 KB)  

    A new group of recursive morphological transforms on the discrete space Z2 are discussed. The set of transforms include the recursive erosion transform (RET), the recursive dilation transform (RDT), the recursive opening transform (ROT), and the recursive closing transform (RCT), The transforms are able to compute in constant time per pixel erosions, dilations, openings, and closings wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image motion estimation algorithms using cumulants

    Publication Year: 1995 , Page(s): 346 - 357
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (892 KB)  

    A class of algorithms is presented that estimates the displacement vector from two successive image frames consisting of signal plus noise. In the model, the signals are assumed to be either non-Gaussian or (quasistationary) deterministic; and, via a consistency result for cumulant estimators, the authors unify the stochastic and deterministic signal viewpoints. The noise sources are assumed to be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameter reduction for the compound Gauss-Markov model

    Publication Year: 1995 , Page(s): 382 - 386
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB)  

    The efficacy of the compound Gauss-Markov (CGM) model, initially proposed by Jeng and Woods (1990), has been demonstrated in several image processing applications. However, parameter estimation for the CGM model is difficult since it is not clear as to how the constraints or interdependence amongst the model parameters can be incorporated into the estimation procedures. As result, the parameter es... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A digit-serial architecture for gray-scale morphological filtering

    Publication Year: 1995 , Page(s): 387 - 391
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (436 KB)  

    We present a digit-serial architecture for gray-scale morphological operations that operate on radix-2 redundant numbers. We present new implementations for a redundant number adder and a maximum unit that are used in the morphological dilation unit. These new designs have areas comparable to 2's complement implementations but have significantly smaller latencies View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noise reduction of image sequences using motion compensation and signal decomposition

    Publication Year: 1995 , Page(s): 274 - 284
    Cited by:  Papers (14)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1168 KB)  

    In this paper, a new spatio-temporal filtering method for removing noise from image sequences is proposed. This method combines the use of motion compensation and signal decomposition to account for the effects of object motion. Because of object motion, image sequences are temporally nonstationary, which requires the use of adaptive filters. By motion compensating the sequence prior to filtering,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probability estimation in arithmetic and adaptive-Huffman entropy coders

    Publication Year: 1995 , Page(s): 237 - 246
    Cited by:  Papers (21)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (864 KB)  

    Entropy coders, such as Huffman and arithmetic coders, achieve compression by exploiting nonuniformity in the probabilities under which a random variable to be coded takes on its possible values. Practical realizations generally require running adaptive estimates of these probabilities. An analysis of the relationship between estimation quality and the resulting coding efficiency suggests a partic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scanning tomographic acoustic microscopy

    Publication Year: 1995 , Page(s): 358 - 369
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (792 KB)  

    The scanning tomographic acoustic microscope (STAM) was proposed in 1982 as a method of improving the resolution capability of the scanning laser acoustic microscope (SLAM) based on the principles of tomography. By modifying the SLAM with a quadrature detector, tomographic projections that contain both the amplitude and phase information of the scattered wavefield can be acquired. Subsequently, mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Video coding scheme using DCT-pyramid vector quantization

    Publication Year: 1995 , Page(s): 309 - 319
    Cited by:  Papers (8)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (840 KB)  

    A new and effective video coding scheme for contribution quality is proposed. The CMTT/2, a joint committee of CCIR and CCITT, has proposed a video coding scheme (already approved at European level by ETS) working at 34-45 Mbit/s. Basically this proposal includes a DCT transform for spatial correlation removal and motion compensation for temporal correlation removal. The individual transform coeff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal transforms for multispectral and multilayer image coding

    Publication Year: 1995 , Page(s): 296 - 308
    Cited by:  Papers (11)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1084 KB)  

    Multispectral images are composed of a series of images at differing optical wavelengths. Since these images can be quite large, they invite efficient source coding schemes for reducing storage and transmission requirements. Because multispectral images include a third (spectral) dimension with nonstationary behavior, these multilayer data sets require specialized coding techniques. The authors de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information loss recovery for block-based image coding techniques-a fuzzy logic approach

    Publication Year: 1995 , Page(s): 259 - 273
    Cited by:  Papers (56)  |  Patents (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2036 KB)  

    A new technique to recover the information loss in a block-based image coding system is developed in this paper. The proposed scheme is based on fuzzy logic reasoning and can be divided into three main steps: (1) hierarchical compass interpolation/extrapolation (HCIE) in the spatial domain for initial recovery of lost blocks that mainly contain low-frequency information such as smooth background (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A contour-based approach to multisensor image registration

    Publication Year: 1995 , Page(s): 320 - 334
    Cited by:  Papers (126)  |  Patents (31)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1456 KB)  

    Image registration is concerned with the establishment of correspondence between images of the same scene. One challenging problem in this area is the registration of multispectral/multisensor images. In general, such images have different gray level characteristics, and simple techniques such as those based on area correlations cannot be applied directly. On the other hand, contours representing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subpixel edge localization and the interpolation of still images

    Publication Year: 1995 , Page(s): 285 - 295
    Cited by:  Papers (148)  |  Patents (20)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1224 KB)  

    In this paper, we present a nonlinear interpolation scheme for still image resolution enhancement. The algorithm is based on a source model emphasizing the visual integrity of detected edges and incorporates a novel edge fitting operator that has been developed for this application. A small neighborhood about each pixel in the low-resolution image is first mapped to a best-fit continuous space ste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enlargement or reduction of digital images with minimum loss of information

    Publication Year: 1995 , Page(s): 247 - 258
    Cited by:  Papers (73)  |  Patents (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1544 KB)  

    The purpose of this paper is to derive optimal spline algorithms for the enlargement or reduction of digital images by arbitrary (noninteger) scaling factors. In our formulation, the original and rescaled signals are each represented by an interpolating polynomial spline of degree n with step size one and Δ, respectively. The change of scale is achieved by determining the spline with step si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Motion vector quantization for video coding

    Publication Year: 1995 , Page(s): 378 - 382
    Cited by:  Papers (21)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (472 KB)  

    A new algorithm is developed for the vector quantization of motion vectors. This algorithm, called motion vector quantization (MVQ), simultaneously estimates and vector quantizes the motion vectors by reinterpreting the block matching algorithm as a type of vector quantization. An iterative design algorithm, based on this concept, is developed. In addition to reducing rate for fixed length encodin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new criterion for automatic multilevel thresholding

    Publication Year: 1995 , Page(s): 370 - 378
    Cited by:  Papers (45)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3192 KB)  

    A new criterion for multilevel thresholding is proposed. The criterion is based on the consideration of two factors. The first one is the discrepancy between the thresholded and original images and the second one is the number of bits required to represent the thresholded image. Based on a new maximum correlation criterion for bilevel thresholding, the discrepancy is defined and then a cost functi... 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