By Topic

IEEE Transactions on Image Processing

Issue 3 • Date March 2005

Filter Results

Displaying Results 1 - 17 of 17
  • Table of contents

    Publication Year: 2005, Page(s):c1 - c4
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • IEEE Transactions on Image Processing publication information

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Fast free-vibration modal analysis of 2-D physics-based deformable objects

    Publication Year: 2005, Page(s):281 - 293
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (899 KB) | HTML iconHTML

    This paper presents an accurate, very fast approach for the deformations of two-dimensional physically based shape models representing open and closed curves. The introduced models are much faster than other deformable models (e.g., finite-element methods). The approach relies on the determination of explicit deformation governing equations that involve neither eigenvalue decomposition, nor any ot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image change detection algorithms: a systematic survey

    Publication Year: 2005, Page(s):294 - 307
    Cited by:  Papers (351)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1340 KB) | HTML iconHTML

    Detecting regions of change in multiple images of the same scene taken at different times is of widespread interest due to a large number of applications in diverse disciplines, including remote sensing, surveillance, medical diagnosis and treatment, civil infrastructure, and underwater sensing. This paper presents a systematic survey of the common processing steps and core decision rules in moder... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate-constrained fast full-search algorithm based on block sum pyramid

    Publication Year: 2005, Page(s):308 - 311
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (221 KB) | HTML iconHTML

    This paper presents a fast full-search algorithm (FSA) for rate-constrained motion estimation. The proposed algorithm, which is based on the block sum pyramid frame structure, successively eliminates unnecessary search positions according to rate-constrained criterion. This algorithm provides the identical estimation performance to a conventional FSA having rate constraint, while achieving conside... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unsupervised multistage image classification using hierarchical clustering with a bayesian similarity measure

    Publication Year: 2005, Page(s):312 - 320
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB) | HTML iconHTML

    A new multistage method using hierarchical clustering for unsupervised image classification is presented. In the first phase, the multistage method performs segmentation using a hierarchical clustering procedure which confines merging to spatially adjacent clusters and generates an image partition such that no union of any neighboring segments has homogeneous intensity values. In the second phase,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Choosing parameters in block-iterative or ordered subset reconstruction algorithms

    Publication Year: 2005, Page(s):321 - 327
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    Viewed abstractly, all the algorithms considered here are designed to provide a nonnegative solution x to the system of linear equations y=Px, where y is a vector with positive entries and P a matrix whose entries are nonnegative and with no purely zero columns. The expectation maximization maximum likelihood method, as it occurs in emission tomography, and the simultaneous multiplicative algebrai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Color image resolution conversion

    Publication Year: 2005, Page(s):328 - 333
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2105 KB) | HTML iconHTML

    In this paper, we look at the problem of spatially scaling color images. We focus on an approach that takes advantage of the human visual system's color spatial frequency sensitivity. The algorithm performs an efficient least-squares (LS) resolution conversion for the luminance channel and a low-complexity pixel replication/reduction in the chrominance channels. The performance of the algorithm is... View full abstract»

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

    Publication Year: 2005, Page(s):334 - 342
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1519 KB) | HTML iconHTML

    We introduce the eidochromatic transform as a tool for improved lossy coding of color images. Many current image-coding formats (such as JPEG 2000) utilize both a color-component transform (relating values of different image components at a single location) and a wavelet or other spatial transform (relating values of a single-image component at proximate, but different image locations). The eidoch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images

    Publication Year: 2005, Page(s):343 - 359
    Cited by:  Papers (62)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1743 KB) | HTML iconHTML

    This paper presents novel coding algorithms based on tree-structured segmentation, which achieve the correct asymptotic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise polynomials, by using an R-D based prune and join scheme. For the one-dimensional case, our scheme is based on binary-tree segmentation of the signal. This scheme approximates the signal segments usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive homogeneity-directed demosaicing algorithm

    Publication Year: 2005, Page(s):360 - 369
    Cited by:  Papers (121)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1387 KB) | HTML iconHTML

    A cost-effective digital camera uses a single-image sensor, applying alternating patterns of red, green, and blue color filters to each pixel location. A way to reconstruct a full three-color representation of color images by estimating the missing pixel components in each color plane is called a demosaicing algorithm. This paper presents three inherent problems often associated with demosaicing a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Demosaicing by successive approximation

    Publication Year: 2005, Page(s):370 - 379
    Cited by:  Papers (74)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (674 KB) | HTML iconHTML

    In this paper, we present a fast and high-performance algorithm for color filter array (CFA) demosaicing. CFA demosaicing is formulated as a problem of reconstructing correlated signals from their downsampled versions with an opposite phase. The major contributions of this work include 1) a new iterative demosaicing algorithm in the color difference domain and 2) a spatially adaptive stopping crit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quality without compromise [advertisement]

    Publication Year: 2005, Page(s): 380
    Request permission for commercial reuse | PDF file iconPDF (318 KB)
    Freely Available from IEEE
  • Have you visited lately? www.ieee.org [advertisement]

    Publication Year: 2005, Page(s): 381
    Request permission for commercial reuse | PDF file iconPDF (220 KB)
    Freely Available from IEEE
  • Call for Papers IEEE Transactions on Information Forensics and Security

    Publication Year: 2005, Page(s): 382
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • IEEE Transactions on Image Processing Information for authors

    Publication Year: 2005, Page(s):383 - 384
    Request permission for commercial reuse | PDF file iconPDF (45 KB) | HTML iconHTML
    Freely Available from IEEE
  • IEEE Signal Processing Society Information

    Publication Year: 2005, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE

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