346 research outputs found

    Digital Morphometry : A Taxonomy Of Morphological Filters And Feature Parameters With Application To Alzheimer\u27s Disease Research

    Get PDF
    In this thesis the expression digital morphometry collectively describes all those procedures used to obtain quantitative measurements of objects within a two-dimensional digital image. Quantitative measurement is a two-step process: the application of geometrical transformations to extract the features of interest, and then the actual measurement of these features. With regard to the first step the morphological filters of mathematical morphology provide a wealth of suitable geometric transfomations. Traditional radiometric and spatial enhancement techniques provide an additional source of transformations. The second step is more classical (e.g. Underwood, 1970; Bookstein, 1978; and Weibull, 1980); yet here again mathematical morphology is applicable - morphologically derived feature parameters. This thesis focuses on mathematical morphology for digital morphometry. In particular it proffers a taxonomy of morphological filters and investigates the morphologically derived feature parameters (Minkowski functionals) for digital images sampled on a square grid. As originally conceived by Georges Matheron, mathematical morphology concerns the analysis of binary images by means of probing with structuring elements [typically convex geometric shapes] (Dougherty, 1993, preface). Since its inception the theory has been extended to grey-level images and most recently to complete lattices. It is within the very general framework of the complete lattice that the taxonomy of morphological filters is presented. Examples are provided to help illustrate the behaviour of each type of filter. This thesis also introduces DIMPAL (Mehnert, 1994) - a PC-based image processing and analysis language suitable for researching and developing algorithms for a wide range of image processing applications. Though DIMPAL was used to produce the majority of the images in this thesis it was principally written to provide an environment in which to investigate the application of mathematical morphology to Alzheimer\u27s disease research. Alzheimer\u27s disease is a form of progressive dementia associated with the degeneration of the brain. It is the commonest type of dementia and probably accounts for half the dementia of old age (Forsythe, 1990, p. 21 ). Post mortem examination of the brain reveals the presence of characteristic neuropathologic lesions; namely neuritic plaques and neurofibrillary tangles. They occur predominantly in the cerebral cortex and hippocampus. Quantitative studies of the distribution of plaques and tangles in normally aged and Alzheimer brains are hampered by the enormous amount of time and effort required to count and measure these lesions. Here in a morphological algorithm is proposed for the automatic segmentation and measurement of neuritic plaques from light micrographs of post mortem brain tissue

    Detection And Correction Of Under-/Overexposed Optical Soundtracks By Coupling Image And Audio Signal Processing

    No full text
    International audienceFilm restoration using image processing, has been an active research field during the last years. However, the restoration of the soundtrack has been mainly performed in the sound domain, using signal processing methods, despite the fact that it is recorded as a continuous image between the images of the film and the perforations. While the very few published approaches focus on removing dust particles or concealing larger corrupted areas, no published works are devoted to the restoration of soundtracks degraded by substantial underexposure or overexposure. Digital restoration of optical soundtracks is an unexploited application field and, besides, scientifically rich, because it allows mixing both image and signal processing approaches. After introducing the principles of optical soundtrack recording and playback, this contribution focuses on our first approaches to detect and cancel the effects of under and overexposure. We intentionally choose to get a quantification of the effect of bad exposure in the 1D audio signal domain instead of 2D image domain. Our measurement is sent as feedback value to an image processing stage where the correction takes place, building up a "digital image and audio signal" closed loop processing. The approach is validated on both simulated alterations and real data

    Feature extraction and classification for hyperspectral remote sensing images

    Get PDF
    Recent advances in sensor technology have led to an increased availability of hyperspectral remote sensing data at very high both spectral and spatial resolutions. Many techniques are developed to explore the spectral information and the spatial information of these data. In particular, feature extraction (FE) aimed at reducing the dimensionality of hyperspectral data while keeping as much spectral information as possible is one of methods to preserve the spectral information, while morphological profile analysis is the most popular methods used to explore the spatial information. Hyperspectral sensors collect information as a set of images represented by hundreds of spectral bands. While offering much richer spectral information than regular RGB and multispectral images, the high dimensional hyperspectal data creates also a challenge for traditional spectral data processing techniques. Conventional classification methods perform poorly on hyperspectral data due to the curse of dimensionality (i.e. the Hughes phenomenon: for a limited number of training samples, the classification accuracy decreases as the dimension increases). Classification techniques in pattern recognition typically assume that there are enough training samples available to obtain reasonably accurate class descriptions in quantitative form. However, the assumption that enough training samples are available to accurately estimate the class description is frequently not satisfied for hyperspectral remote sensing data classification, because the cost of collecting ground-truth of observed data can be considerably difficult and expensive. In contrast, techniques making accurate estimation by using only small training samples can save time and cost considerably. The small sample size problem therefore becomes a very important issue for hyperspectral image classification. Very high-resolution remotely sensed images from urban areas have recently become available. The classification of such images is challenging because urban areas often comprise a large number of different surface materials, and consequently the heterogeneity of urban images is relatively high. Moreover, different information classes can be made up of spectrally similar surface materials. Therefore, it is important to combine spectral and spatial information to improve the classification accuracy. In particular, morphological profile analysis is one of the most popular methods to explore the spatial information of the high resolution remote sensing data. When using morphological profiles (MPs) to explore the spatial information for the classification of hyperspectral data, one should consider three important issues. Firstly, classical morphological openings and closings degrade the object boundaries and deform the object shapes, while the morphological profile by reconstruction leads to some unexpected and undesirable results (e.g. over-reconstruction). Secondly, the generated MPs produce high-dimensional data, which may contain redundant information and create a new challenge for conventional classification methods, especially for the classifiers which are not robust to the Hughes phenomenon. Last but not least, linear features, which are used to construct MPs, lose too much spectral information when extracted from the original hyperspectral data. In order to overcome these problems and improve the classification results, we develop effective feature extraction algorithms and combine morphological features for the classification of hyperspectral remote sensing data. The contributions of this thesis are as follows. As the first contribution of this thesis, a novel semi-supervised local discriminant analysis (SELD) method is proposed for feature extraction in hyperspectral remote sensing imagery, with improved performance in both ill-posed and poor-posed conditions. The proposed method combines unsupervised methods (Local Linear Feature Extraction Methods (LLFE)) and supervised method (Linear Discriminant Analysis (LDA)) in a novel framework without any free parameters. The underlying idea is to design an optimal projection matrix, which preserves the local neighborhood information inferred from unlabeled samples, while simultaneously maximizing the class discrimination of the data inferred from the labeled samples. Our second contribution is the application of morphological profiles with partial reconstruction to explore the spatial information in hyperspectral remote sensing data from the urban areas. Classical morphological openings and closings degrade the object boundaries and deform the object shapes. Morphological openings and closings by reconstruction can avoid this problem, but this process leads to some undesirable effects. Objects expected to disappear at a certain scale remain present when using morphological openings and closings by reconstruction, which means that object size is often incorrectly represented. Morphological profiles with partial reconstruction improve upon both classical MPs and MPs with reconstruction. The shapes of objects are better preserved than classical MPs and the size information is preserved better than in reconstruction MPs. A novel semi-supervised feature extraction framework for dimension reduction of generated morphological profiles is the third contribution of this thesis. The morphological profiles (MPs) with different structuring elements and a range of increasing sizes of morphological operators produce high-dimensional data. These high-dimensional data may contain redundant information and create a new challenge for conventional classification methods, especially for the classifiers which are not robust to the Hughes phenomenon. To the best of our knowledge the use of semi-supervised feature extraction methods for the generated morphological profiles has not been investigated yet. The proposed generalized semi-supervised local discriminant analysis (GSELD) is an extension of SELD with a data-driven parameter. In our fourth contribution, we propose a fast iterative kernel principal component analysis (FIKPCA) to extract features from hyperspectral images. In many applications, linear FE methods, which depend on linear projection, can result in loss of nonlinear properties of the original data after reduction of dimensionality. Traditional nonlinear methods will cause some problems on storage resources and computational load. The proposed method is a kernel version of the Candid Covariance-Free Incremental Principal Component Analysis, which estimates the eigenvectors through iteration. Without performing eigen decomposition on the Gram matrix, our approach can reduce the space complexity and time complexity greatly. Our last contribution constructs MPs with partial reconstruction on nonlinear features. Traditional linear features, on which the morphological profiles usually are built, lose too much spectral information. Nonlinear features are more suitable to describe higher order complex and nonlinear distributions. In particular, kernel principal components are among the nonlinear features we used to built MPs with partial reconstruction, which led to significant improvement in terms of classification accuracies. The experimental analysis performed with the novel techniques developed in this thesis demonstrates an improvement in terms of accuracies in different fields of application when compared to other state of the art methods

    Segmentation and feature extraction of fluid-filled uterine fibroid–A knowledge-based approach

    Get PDF
    Uterine fibroids are the most common pelvic tumours in females. Ultrasound images of fibroids require image segmentation and feature extraction for analysis. This paper proposes a new method for segmenting the fluid-filled fibroid found in the uterus. It presents a fully automatic approach in which there is no need for human intervention. The method used in this paper employs a number of knowledge-based rules to locate the object and also utilises the concepts in mathematical morphology. It also extracts the necessary features of the fibroid which can be used to prepare the radiological report. The performance of this method is evaluated using area-based metrics

    Morphological erosions and openings: fast algorithms based on anchors

    Full text link
    Several efficient algorithms for computing erosions and openings have been proposed recently. They improve on VAN HERK's algorithm in terms of number of comparisons for large structuring elements. In this paper we introduce a theoretical framework of anchors that aims at a better understanding of the process involved in the computation of erosions and openings. It is shown that the knowledge of opening anchors of a signal f is sufficient to perform both the erosion and the opening of f. Then we propose an algorithm for one-dimensional erosions and openings which exploits opening anchors. This algorithm improves on the fastest algorithms available in literature by approximately 30% in terms of computation speed, for a range of structuring element sizes and image content

    Generalized differential morphological profiles for remote sensing image classification

    Get PDF
    Differential morphological profiles (DMPs) are widely used for the spatial/structural feature extraction and classification of remote sensing images. They can be regarded as the shape spectrum, depicting the response of the image structures related to different scales and sizes of the structural elements (SEs). DMPs are defined as the difference of morphological profiles (MPs) between consecutive scales. However, traditional DMPs can ignore discriminative information for features that are across the scales in the profiles. To solve this problem, we propose scale-span differential profiles, i.e., generalized DMPs (GDMPs), to obtain the entire differential profiles. GDMPs can describe the complete shape spectrum and measure the difference between arbitrary scales, which is more appropriate for representing the multiscale characteristics and complex landscapes of remote sensing image scenes. Subsequently, the random forest (RF) classifier is applied to interpret GDMPs considering its robustness for high-dimensional data and ability of evaluating the importance of variables. Meanwhile, the RF "out-of-bag" error can be used to quantify the importance of each channel of GDMPs and select the most discriminative information in the entire profiles. Experiments conducted on three well-known hyperspectral data sets as well as an additional World View-2 data are used to validate the effectiveness of GDMPs compared to the traditional DMPs. The results are promising as GDMPs can significantly outperform the traditional one, as it is capable of adequately exploring the multiscale morphological information

    Colour morphological sieves for scale-space image processing

    Get PDF
    EThOS - Electronic Theses Online ServiceGBUnited Kingdo

    Computationally efficient, one-pass algorithm for morphological filters

    Get PDF
    International audienceMany useful morphological filters are built as long concatenations of erosions and dilations: openings, closings, size distributions, sequential filters, etc. This paper proposes a new algorithm implementing morphological dilation and erosion of functions. It supports rectangular structuring element, runs in linear time w.r.t. the image size and constant time w.r.t. the structuring element size, and has minimal memory usage. It has zero algorithm latency and processes data in stream. These properties are inherited by operators composed by concatenation, and allow their efficient implementation. We show how to compute in one pass an Alternate Sequential Filter (ASF(n)) regardless the number of stages n. This algorithm opens the way to such time-critical applications where the complexity and memory requirements of serial morphological operators represented a bottleneck limiting their usability. (C) 2011 Elsevier Inc. All rights reserved

    Multi-scale texture segmentation of synthetic aperture radar images

    Get PDF
    EThOS - Electronic Theses Online ServiceGBUnited Kingdo
    • …
    corecore