Proceedings of 3rd IEEE International Conference on Image Processing

19-19 Sept. 1996

Go

Filter Results

Displaying Results 1 - 25 of 263
  • International Conference on Image Processing

    Publication Year: 1996, Page(s):iii - xlv
    Request permission for commercial reuse | PDF file iconPDF (2536 KB)
    Freely Available from IEEE
  • Optimal decomposition of morphological structuring elements

    Publication Year: 1996, Page(s):1 - 4 vol.3
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    We propose a method of optimal morphological decomposition. We first formulate this kind of problem into a set of linear constraints, and then find out the solution to the set of linear constraints by using an integer linear programming technique. Our method has the following three advantages: (1) the size of the factors can be any n/spl times/n (n/spl ges/3), (2) it can be applied to both convex ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3/spl times/3 decomposition of circular structuring elements

    Publication Year: 1996, Page(s):5 - 8 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB)

    This paper presents some results to decompose circular structuring elements into 3/spl times/3 elements. Decomposition allows one to improve the expended time in computing morphological operations. Generally, the shape of the structuring element determines the image transformation. Morphological operations with disks can be used as shape and size descriptors. The optimal discrete approximation of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Directional dilation for the connection of piece-wise objects: a semiconductor manufacturing case study

    Publication Year: 1996, Page(s):9 - 12 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB)

    A technique for intelligent dilation of objects in an image was developed that, when compared to standard isotropic techniques, can create a better representative resultant image for subsequent morphological analysis. Individual masses in an image are forced to grow in preferential directions with varying degrees of strength according to a set of morphological parameters. These parameters are dete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling noise for a better simplification of skeletons

    Publication Year: 1996, Page(s):13 - 16 vol.3
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB)

    The skeleton of an object is the locus of the centers of maximal discs included in the shape. The skeleton provides a compact representation of objects, useful for shape description and recognition. A well-known drawback of the skeleton transformation is its lack of continuity. This paper is concerned with the modeling of noise that may affect objects and the consequence of this noise on the skele... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skeletonizing by compressed line adjacency graph in two directions

    Publication Year: 1996, Page(s):17 - 20 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    Now all the block based skeletonizing algorithms only use the compressed line adjacency graph scanned in one direction. For lines approximately parallel to the scan direction, there is difficulty extracting the skeleton because such a line may be separated into several graph nodes or mixed with some pixels of other lines in the intersection point. In this paper, we propose a new skeletonizing meth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Hausdorff distances based on robust statistics for comparing images

    Publication Year: 1996, Page(s):21 - 24 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB)

    A Hausdorff distance (HD) is one of commonly used measures for object matching. It calculates the distance between two point sets of edges in two-dimensional binary images without establishing correspondences. This paper analyzes the conventional HD measures based on robust statistics, and proposes robust HD measures based on M-estimation, least trimmed square (LTS), and /spl alpha/-trimmed mean m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An SIMD parallel algorithm for classifying binary image contours based on mathematical morphology

    Publication Year: 1996, Page(s):25 - 28 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    In this paper we analyze some problems concerned with connectivity on binary images. More precisely, by means of mathematical morphology we describe an algorithm which detects and classifies contours of connected sets as inner or outer contours. The method discussed here is quite parallel and can be directly implemented onto an SIMD (single-instruction multiple-data-stream) massively parallel comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On MAP optimality of gray-scale morphological filters

    Publication Year: 1996, Page(s):29 - 32 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    The estimation of finite-gray-scale digital images corrupted by supremum/infimum noise is posed within the statistical framework of discrete random functions (DRF). It is shown that morphological operators such as openings, closings, supremum of openings and infimum of closings are optimal Maximum-A-Posteriori (MAP) estimators under the assumption that noise is independent and identically distribu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical optimization of gray-scale morphological filters

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

    The problem of optimal morphological filtering is posed within the statistical framework of discrete random function theory. The optimal morphological estimator of realizations of the discrete random function (DRF) (modeling finite-gray scale digital images) corrupted by supremum/infimum noise is obtained. The mean absolute error (MAE) is used as a distance measure between the original and the est... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Medical image segmentation using the watershed transformation on graphs

    Publication Year: 1996, Page(s):37 - 40 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    In this paper the usability of the watershed transformation on graphs for segmentation of computer tomography images in hyperthermia planning is examined. In the past the segmentation step was done using interactively obtained contours. Now the segmentation should be realized applying the watershed transformation on graphs. The question arises if the results of the watershed transformation are sui... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of watershed algorithms for greyscale images

    Publication Year: 1996, Page(s):41 - 44 vol.3
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (530 KB)

    There are several different watershedding approaches in the literature, and many applications of watershedding exist in binary and greyscale image processing, particularly in vision systems. There seems to be little work published which systematically compares and assesses the performances of these algorithms. This paper discusses the different watershedding approaches for greyscale images in term... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New topological operators for segmentation

    Publication Year: 1996, Page(s):45 - 48 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (682 KB)

    In this paper, we propose an original method to segment bi-class images into regions. It is based on the use of low-level operators and works automatically, without any threshold or size criteria. This method is purely topological. We define a topology for grey-level images, called section topology, and two basic topological notions, the topological numbers and the topological values. We propose f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A textural analysis by mathematical morphology transformations: structural opening and top-hat

    Publication Year: 1996, Page(s):49 - 52 vol.3
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (781 KB)

    This paper presents a new method of texture characterization, recognition and defect detection in textures, based on mathematical morphology transformations: structural opening and top-hat. The structural opening and its properties of invariance allow the extraction of primitive patterns from a texture, some kind of "textons" which entirely characterize it. As a result, defect detection can be per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmentation of nautical chart components using mathematical morphology

    Publication Year: 1996, Page(s):53 - 56 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (329 KB)

    This paper presents some procedures for segmenting nautical charts using concepts of mathematical morphology. The method discussed, based on the multi-angled parallelism, is capable of extracting overlapped connected components such as lakes, isolines, railways, canals, small symbols and strings of characters. The problem of connectivity is solved using geodesic operations. The procedures have bee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new fast algorithm using an adaptative structuring element applied to a counting device

    Publication Year: 1996, Page(s):57 - 60 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB)

    This paper presents a new image processing approach using size and shape varying structuring element. This approach is used to analyse image sequences of pedestrians walking in an indoor corridor of a transport system. The algorithm counts in real time the pedestrians entering or leaving this transport system. For this application a new technology for the acquisition of the images has been develop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial differential equations in image analysis: continuous modeling, discrete processing

    Publication Year: 1996, Page(s):61 - 64 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (709 KB)

    Most traditional methodologies in digital image processing start with a discrete model which is directly related to the subsequent discrete processing of the image data. We review some examples and focus on some details of an emerging new methodology that starts from some continuous models provided by PDEs and proceeds with discrete processing of the image data via the numerical implementation of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimized single site update algorithms for image deblurring

    Publication Year: 1996, Page(s):65 - 68 vol.3
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    We present optimized algorithms for image deblurring in the case of a separable point spread function (PSF). Our work is in the usual context of Bayesian estimation with Gibbs random fields (GRF). The derived algorithms fall into the class of single site update algorithms (SSUAs), which exhibit a high convergence rate per iteration and small memory requirements, while hard domain constraints such ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained parallel projection methods for optimal signal estimation and design-constrained inconsistent signal feasibility problems

    Publication Year: 1996, Page(s):69 - 72 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    The convex set feasibility framework has been widely applied to signal and image processing problems including signal deconvolution, tomographic reconstruction, band limited extrapolation, image restoration and image synthesis. In this paper, we consider convex constrained versions of inconsistent signal feasibility problems. First we derive some new properties of variational nonexpansive operator... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the global asymptotic stability of the NAS-RIF algorithm for blind image restoration

    Publication Year: 1996, Page(s):73 - 76 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (491 KB)

    In this paper, the authors present a convergence analysis for the NAS-RIF (nonnegativity and support constraints recursive inverse filtering) algorithm used in blind image restoration. A novel approach is presented to determine sufficient conditions for the global convergence of the technique. The approach is general to many signal processing algorithms and incorporates Lyapunov's direct method us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image blur identification by using higher order statistic techniques

    Publication Year: 1996, Page(s):77 - 80 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (526 KB)

    In this paper, higher order statistic (HOS) based blur identification methods are proposed to estimate blur coefficients in image restoration, in which the image is considered as a colored process. One dimensional (1-D) based blur identification algorithms are proposed, and their extensions to two dimensional (2-D) cases are discussed. The experimental results are presented to demonstrate the perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Restoration of uncertain blurs using an error in variables criterion

    Publication Year: 1996, Page(s):81 - 84 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    In image-restoration problems involving a known blur, set-theoretic estimation provides an effective framework for incorporation of both noise statistics and a priori information. However, the sets formulated for use with known blurs are not suitable for situations involving unknown stochastic blurs. In this paper, new sets based on an error in variables criterion are developed, which are more app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regularized blur-assisted displacement field estimation

    Publication Year: 1996, Page(s):85 - 88 vol.3
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (514 KB)

    Due to the finite acquisition time of practical cameras, objects can move during image acquisition, therefore introducing motion blur degradations. Traditionally, these degradations are treated as undesirable artifacts that should be removed before further processing. We consider the use of motion blur as an indication of scene motion. We present two robust regularized motion estimation algorithms... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A sure-fired way to choose smoothing parameters in ill-conditioned inverse problems

    Publication Year: 1996, Page(s):89 - 92 vol.3
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (353 KB)

    Regularisation methods for the solution of inverse problems are well known although the theoretical study of their performance especially in image processing contexts is not well advanced. What is also much less resolved is smoothing or penalty parameter estimation. We describe a general procedure for estimation of auxiliary finite dimensional parameters in ill-conditioned inverse problems. The me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FWT-based preconditioners for image restoration problems

    Publication Year: 1996, Page(s):93 - 96 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    The problem of removing or minimizing degradations in a blurred and noisy image is known as image restoration. The computational kernel of many image restoration problems is the solution of the following inverse problem: Hf=g+/spl eta/ where where the n/sup 2/-vectors f and g represent the real and the observed image, respectively. The n/sup 2/ vector /spl eta/ is an additive noise which is usuall... View full abstract»

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