Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)

7-7 Oct. 1998

Go

Filter Results

Displaying Results 1 - 25 of 209
  • 1998 International Conference on Image Processing [front matter]

    Publication Year: 1998, Page(s):i - xlvi
    Request permission for reuse | PDF file iconPDF (2050 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 1998, Page(s):lvii - lxxi
    Request permission for reuse | PDF file iconPDF (1012 KB)
    Freely Available from IEEE
  • Functional brain mapping

    Publication Year: 1998, Page(s):1 - 4 vol.2
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (378 KB)

    Functional magnetic resonance imaging or fMRI is a means by which dynamic processes in the body can be imaged. The ability to measure real time processes exists thanks to technological advances in the system hardware and the imaging techniques inherent in MRI itself. The massive amounts of data that can be collected today to study such processes presents a challenge not only in terms of data handl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible shapes for segmentation and tracking of cardiovascular data

    Publication Year: 1998, Page(s):5 - 9 vol.2
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (573 KB)

    In this invited paper, an overview of techniques developed at the Cardiovascular Image Analysis Laboratory at Washington University is discussed. At the core of the authors' methodologies lie flexible shape models, which are employed in automated as well as semi-automated analysis of cardiac MRI and X-ray angiography images. The mathematical bases used for the flexible templates are of the B-splin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new class of sampling theorems for Fourier imaging of multiple regions

    Publication Year: 1998, Page(s):10 - 14 vol.2
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (595 KB)

    Traditional Fourier imaging utilizes the Whittaker-Kotel'nikov-Shannon (WKS) sampling theorem. This specifies the spatial frequency components which need to be measured in order to reconstruct an image completely contained within a known field of view (FOV). Here, the authors generalize this result in order to find the optimal k-space sampling for images that vanish except in multiple, possibly no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feasibility of tomography with unknown view angles

    Publication Year: 1998, Page(s):15 - 19 vol.2
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    The authors recently demonstrated that the view angles of tomographic projections were uniquely determined by the projection data alone for almost all objects, given enough projections. Here, they present results on the stability of the solution, as well as bounds on the variance of Convolution Back Projection (CBP) based reconstructions. To demonstrate that the problem can be feasibly solved in t... View full abstract»

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

    Publication Year: 1998, Page(s):20 - 24 vol.2
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (591 KB)

    Segmentation of biomedical images separates scenes into their components based on recognition of locally similar patterns of intensity, color, texture or other features, with or without use of a priori knowledge regarding the objects or "camera" used to acquire the images. Segmented images are required for most types of object models, labeling, morphometry and geometrical investigations on imaged ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • COCGV: a method for multi-modality 3D volume registration

    Publication Year: 1998, Page(s):25 - 28 vol.2
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    Even with the large quantity of registration algorithms available, there is still a significant number of potential users who are not able to grasp the technical aspects of a particular algorithm in order to use it to its fall potential. Thus, in most non-ideal cases, registrations are either non-optimal or worse, unsuccessful. The COCGV algorithm is an attempt to provide an easily understandable ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Medical image databases and informatics

    Publication Year: 1998, Page(s):29 - 33 vol.2
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (559 KB)

    In order to make use of the overwhelming amount of clinical text and images and supporting information available for medical clinical practice and research, high level intelligence will be integrated into next-generation PACS in the following areas: computer-based decision support, in the development of intelligent user interfaces, in the federation of heterogeneous medical imaging databases, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Look-up-table based halftoning algorithm

    Publication Year: 1998, Page(s):34 - 38 vol.2
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (735 KB)

    Screen design requires that the stacking property be obeyed. This constraint limits the texture quality at each gray level. To improve the texture quality, we introduce a look-up-table based halftoning algorithm for which the stacking constraint is not necessarily satisfied but the binary patterns for individual levels are still correlated. The algorithm improves the halftone image quality compare... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Green noise digital halftoning

    Publication Year: 1998, Page(s):39 - 43 vol.2
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (521 KB)

    We introduce the concept of green noise-the mid-frequency component of white noise-and its advantages over blue noise for digital halftoning. Unlike blue noise, which creates the illusion of continuous tone by spreading the minority pixels of a binary dither pattern as homogeneously as possible, green noise forms minority pixel clusters which are themselves distributed as homogeneously as possible... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model based direct binary search halftone optimization with a dual interpretation

    Publication Year: 1998, Page(s):44 - 48 vol.2
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (467 KB)

    The direct binary search (DBS) algorithm is an iterative method designed to minimize one metric of error between the grayscale original and halftone image. This metric incorporates a model for the human visual system. To achieve the optimization, an initial halftone is adjusted until a local minimum of the metric is achieved at each pixel. However this local minimum can be shown to simultaneously ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QR-RLS algorithm for error diffusion of color images

    Publication Year: 1998, Page(s):49 - 53 vol.2
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (729 KB)

    Printing color images on color printers, and displaying them on computer monitors requires a significant reduction of physically distinct colors, which causes degradation in image quality. An efficient method to improve the display quality of a quantized image is error diffusion which works by distributing the previous quantization errors to neighboring pixels exploiting the eye's averaging of col... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image halftoning and inverse halftoning for optimized dot diffusion

    Publication Year: 1998, Page(s):54 - 58 vol.2
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1025 KB)

    The dot diffusion method for digital halftoning has the advantage of parallelism unlike the error diffusion method. However, the image quality offered by error diffusion is still regarded as superior to other known methods. In a previous paper we showed how the dot diffusion method can be improved by optimization of the so-called class matrix. In this paper we first review the dot diffusion algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high quality, fast inverse halftoning algorithm for error diffused halftones

    Publication Year: 1998, Page(s):59 - 63 vol.2
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (871 KB)

    We present an inverse halftoning algorithm for error diffused halftones. At each pixel, the algorithm applies a separable 7/spl times/7 FIR filter parameterized by the computed local horizontal and vertical gradients. All operations are entirely local; only 7 rows of image storage and fewer than 300 operations per pixel are required. The algorithm can be easily implemented in embedded software or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast blind inverse halftoning

    Publication Year: 1998, Page(s):64 - 68 vol.2
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1787 KB)

    We present a fast, non-iterative technique for producing grayscale images from error diffused and dithered halftones. The first stage of the algorithm consists of a Gaussian filter and a median filter, while the second stage consists of a bandpass filter, a thresholding operation, and a median filter. The second stage enhances the rendering of edges in the inverse halftone. We compare our algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Total least square techniques in color printer characterization

    Publication Year: 1998, Page(s):69 - 73 vol.2
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (443 KB)

    The Neugebauer model is a powerful tool in obtaining end-to-end device characterization profiles for halftone color printer calibration. In this paper, we propose total least square (TLS) regression methods to estimate the parameters of Neugebauer models. Compared to the traditional least squares (LS) based methods, the TLS approach is a physically more appropriate procedure, because it accounts f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MAP estimation of a class of morphologically constrained Gibbs random fields

    Publication Year: 1998, Page(s):74 - 78 vol.2
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    We revisit the problem of non-linear image filtering by means of maximum-a-posteriori (MAP) estimation and mathematical morphology. Based on "mild" modeling assumptions, we bound the optimal MAP estimate from above and below and provide explicit morphological expressions for such bounds. The derived bounds can be easily calculated and effectively used to design a fast MAP algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive restoration of speckled SAR images using a compound random Markov field

    Publication Year: 1998, Page(s):79 - 83 vol.2
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (681 KB)

    This paper proposes a restoration scheme for noisy images generated by coherent imaging systems (e.g., synthetic aperture radar, synthetic aperture sonar ultrasound imaging, and laser imaging). The approach is Bayesian: the observed image intensity is assumed to be a random variable with gamma density; the image to be restored (mean amplitude) is modeled by a compound Gauss-Markov random field whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unsupervised deconvolution of satellite images

    Publication Year: 1998, Page(s):84 - 87 vol.2
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (414 KB)

    This paper focuses on hyperparameter estimation of a variational model for image deconvolution. Using the generalized maximum likelihood (GML) estimator, the estimation problem is reduced to the ML estimation in the case of perfectly observed data. A method based on stochastic gradient is then developed for the estimation of both linear and nonlinear hyperparameters. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image restoration with 1/f-type fractal models and statistical estimation of the model parameters

    Publication Year: 1998, Page(s):88 - 92 vol.2
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    A common problem in image processing is recovery of an image given noisy linear functionals of the original. While it has been shown that in certain situations, models possessing a 1/f-type power spectrum perform well as regularizers to stabilize these ill-posed inverse problems, the optimal parameters for the model are rarely known a priori. Previously, it was demonstrated that the expectation ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Bayesian image restoration algorithms from partially-known blurs

    Publication Year: 1998, Page(s):93 - 97 vol.2
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (453 KB)

    In this paper we examine the restoration problem when the point-spread function (PSF) of the degradation system, is partially known. For this problem the PSF is assumed to be the sum of a known deterministic and an unknown random component. This problem, has been examined before; however, in most previous works the problem of estimating the parameters that define the restoration, filters was not a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nested recursive approach to MAP estimation based on Gauss-Markov random fields

    Publication Year: 1998, Page(s):98 - 102 vol.2
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (582 KB)

    Many large multidimensional space-time signal processing and data inversion applications (e.g. deconvolution) require some form of regularization to extract meaningful information. A popular approach to regularizing such problems in a statistical context is via a Gauss-Markov random field (GMRF) prior model in a maximum a posteriori (MAP) estimation framework. While providing good reconstructions,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelet domain image restoration using edge preserving prior models

    Publication Year: 1998, Page(s):103 - 107 vol.2
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1061 KB)

    We consider a wavelet-based edge preserving regularization scheme for use in linear image restoration problems. Our efforts build on a collection of mathematical results indicating that wavelets are especially useful for representing functions that contain discontinuities (i.e. edges in two dimensions or jumps in 1D). We interpret the resulting theory in a statistical signal processing framework a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of binary images by minimizing convex criteria

    Publication Year: 1998, Page(s):108 - 112 vol.2
    Cited by:  Papers (24)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (702 KB)

    Reconstructing binary images is a problem which arises in various application fields. In this paper, this problem is considered in a regularization framework: the sought solution minimizes an objective function (a criterion). Criteria defined over the set of the binary images are nonconvex and there are no general methods permitting one to calculate the global minimum, while approximate solutions ... View full abstract»

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