By Topic

IEEE Transactions on Image Processing

Issue 11 • Date Nov 1996

Filter Results

Displaying Results 1 - 11 of 11
  • Behavioral analysis of anisotropic diffusion in image processing

    Publication Year: 1996, Page(s):1539 - 1553
    Cited by:  Papers (258)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2596 KB)

    In this paper, we analyze the behavior of the anisotropic diffusion model of Perona and Malik (1990). The main idea is to express the anisotropic diffusion equation as coming from a certain optimization problem, so its behavior can be analyzed based on the shape of the corresponding energy surface. We show that anisotropic diffusion is the steepest descent method for solving an energy minimization... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector quantization with variable-precision classification

    Publication Year: 1996, Page(s):1528 - 1538
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    We investigate variable-precision classification (VPC) for speeding vector quantization (VQ). VPC evaluates bit-serially, from the most significant bit. When the magnitude of the error due to the unevaluated bits is less than the absolute magnitude of the discriminant, we can classify without processing the remaining bits. A proof shows that as the operand precision increases, the average necessar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On ordering color maps for lossless predictive coding

    Publication Year: 1996, Page(s):1522 - 1527
    Cited by:  Papers (43)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    Linear predictive techniques perform poorly when used with color-mapped images where pixel values represent indices that point to color values in a look-up table. Reordering the color table, however, can lead to a lower entropy of prediction errors. In this paper, we investigate the problem of ordering the color table such that the absolute sum of prediction errors is minimized. The problem turns ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anisotropic diffusion of multivalued images with applications to color filtering

    Publication Year: 1996, Page(s):1582 - 1586
    Cited by:  Papers (246)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1364 KB)

    A general framework for anisotropic diffusion of multivalued images is presented. We propose an evolution equation where, at each point in time, the directions and magnitudes of the maximal and minimal rate of change in the vector-image are first evaluated. These are given by eigenvectors and eigenvalues of the first fundamental form in the given image metric. Then, the image diffuses via a system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of disparity gradient based cooperative stereo

    Publication Year: 1996, Page(s):1493 - 1506
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1948 KB)

    This paper argues that the disparity gradient subsumes various constraints for stereo matching, and can thus be used as the basis of a unified cooperative stereo algorithm. Traditionally, selection of the neighborhood support function (NSF) in cooperative stereo was left as a heuristic exercise. We present an analysis and evaluation of three families of NSFs based on the disparity gradient. It is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified approach to noise removal, image enhancement, and shape recovery

    Publication Year: 1996, Page(s):1554 - 1568
    Cited by:  Papers (85)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4484 KB)

    We present a unified approach to noise removal, image enhancement, and shape recovery in images. The underlying approach relies on the level set formulation of the curve and surface motion, which leads to a class of PDE-based algorithms. Beginning with an image, the first stage of this approach removes noise and enhances the image by evolving the image under flow controlled by min/max curvature an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multistage, optimal active contour model

    Publication Year: 1996, Page(s):1586 - 1591
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    Energy-minimizing active contour models or snakes can be used in many applications such as edge detection, motion tracking, image matching, computer vision, and three-dimensional (3-D) reconstruction. We present a novel snake that is superior both in accuracy and convergence speed over previous snake algorithms. High performance is achieved by using spline representation and dividing the energy-mi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of constrained clustering algorithms for object boundary extraction

    Publication Year: 1996, Page(s):1507 - 1521
    Cited by:  Papers (78)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1760 KB)

    Boundary extraction is a key task in many image analysis operations. This paper describes a class of constrained clustering algorithms for object boundary extraction that includes several well-known algorithms proposed in different fields (deformable models, constrained clustering, data ordering, and traveling salesman problems). The algorithms belonging to this class are obtained by the minimizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Morphological residual representations of signals

    Publication Year: 1996, Page(s):1569 - 1572
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    A general approach for residual representation of one-dimensional (1-D) and two-dimensional (2-D) signals is defined. Signals are reconstructed as a sum of components that are recursively determined by using a constructive transform. Several morphological constructive transforms are proposed and their corresponding representations are discussed. The use of residual representations in signal and im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image recovery using the anisotropic diffusion equation

    Publication Year: 1996, Page(s):1573 - 1578
    Cited by:  Papers (44)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2092 KB)

    A new approach for image recovery using the anisotropic diffusion equation is developed which is based on the first derivative of the signal in time embedded in family of images with different scales. The diffusion coefficient is determined as a function of the gradient of the signal convolved with a symmetric exponential filter. A new discrete realization is developed for the simultaneous removal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless compression of VQ index with search-order coding

    Publication Year: 1996, Page(s):1579 - 1582
    Cited by:  Papers (76)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    In memoryless vector quantization (VQ) for images, each block is quantized independently and its corresponding index is sent to the decoder. This paper presents a new lossless algorithm that exploits the interblock correlation in the index domain. We compare the current index with previous indices in a predefined search path, and then send the corresponding search order to the decoder. The new alg... 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