7,895 research outputs found

    Unsupervised morphological segmentation for images

    Get PDF
    This paper deals with a morphological approach to unsupervised image segmentation. The proposed technique relies on a multiscale Top-Down approach allowing a hierarchical processing of the data ranging from the most global scale to the most detailed one. At each scale, the algorithm consists of four steps: image simplification, feature extraction, contour localization and quality estimation. The main emphasis of this paper is to discuss the selection of a simplification filter for segmentation. Morphological filters based on reconstruction proved to be very efficient for this purpose. The resulting unsupervised algorithm is very robust and can deal with very different type of images.Peer ReviewedPostprint (published version

    Cognitive Deficit of Deep Learning in Numerosity

    Full text link
    Subitizing, or the sense of small natural numbers, is an innate cognitive function of humans and primates; it responds to visual stimuli prior to the development of any symbolic skills, language or arithmetic. Given successes of deep learning (DL) in tasks of visual intelligence and given the primitivity of number sense, a tantalizing question is whether DL can comprehend numbers and perform subitizing. But somewhat disappointingly, extensive experiments of the type of cognitive psychology demonstrate that the examples-driven black box DL cannot see through superficial variations in visual representations and distill the abstract notion of natural number, a task that children perform with high accuracy and confidence. The failure is apparently due to the learning method not the CNN computational machinery itself. A recurrent neural network capable of subitizing does exist, which we construct by encoding a mechanism of mathematical morphology into the CNN convolutional kernels. Also, we investigate, using subitizing as a test bed, the ways to aid the black box DL by cognitive priors derived from human insight. Our findings are mixed and interesting, pointing to both cognitive deficit of pure DL, and some measured successes of boosting DL by predetermined cognitive implements. This case study of DL in cognitive computing is meaningful for visual numerosity represents a minimum level of human intelligence.Comment: Accepted for presentation at the AAAI-1

    Adaptive Markov random fields for joint unmixing and segmentation of hyperspectral image

    Get PDF
    Linear spectral unmixing is a challenging problem in hyperspectral imaging that consists of decomposing an observed pixel into a linear combination of pure spectra (or endmembers) with their corresponding proportions (or abundances). Endmember extraction algorithms can be employed for recovering the spectral signatures while abundances are estimated using an inversion step. Recent works have shown that exploiting spatial dependencies between image pixels can improve spectral unmixing. Markov random fields (MRF) are classically used to model these spatial correlations and partition the image into multiple classes with homogeneous abundances. This paper proposes to define the MRF sites using similarity regions. These regions are built using a self-complementary area filter that stems from the morphological theory. This kind of filter divides the original image into flat zones where the underlying pixels have the same spectral values. Once the MRF has been clearly established, a hierarchical Bayesian algorithm is proposed to estimate the abundances, the class labels, the noise variance, and the corresponding hyperparameters. A hybrid Gibbs sampler is constructed to generate samples according to the corresponding posterior distribution of the unknown parameters and hyperparameters. Simulations conducted on synthetic and real AVIRIS data demonstrate the good performance of the algorithm

    Quantale Modules and their Operators, with Applications

    Full text link
    The central topic of this work is the categories of modules over unital quantales. The main categorical properties are established and a special class of operators, called Q-module transforms, is defined. Such operators - that turn out to be precisely the homomorphisms between free objects in those categories - find concrete applications in two different branches of image processing, namely fuzzy image compression and mathematical morphology

    Inf-structuring functions and self-dual marked flattenings in bi-Heyting algebra

    Get PDF
    International audienceThis paper introduces a generalization of self-dual marked flattenings defined in the lattice of mappings. This definition provides a way to associate a self-dual operator to every mapping that decomposes an element into sub-elements (i.e. gives a cover). Contrary to classical flattenings whose definition relies on the complemented structure of the powerset lattices, our approach uses the pseudo relative complement and supplement of the bi-Heyting algebra and a new notion of \textit{inf-structuring functions} that provides a very general way to structure the space. We show that using an inf-structuring function based on connections allows to recover the original definition of marked flattenings and we provide, as an example, a simple inf-structuring function whose derived self-dual operator better preserves contrasts and does not introduce new pixel values

    Inf-semilattice approach to self-dual morphology

    Get PDF
    Today, the theoretical framework of mathematical morphology is phrased in terms of complete lattices and operators defined on them. That means in particular that the choice of the underlying partial ordering is of eminent importance, as it determines the class of morphological operators that one ends up with. The duality principle for partially ordered sets, which says that the opposite of a partial ordering is also a partial ordering, gives rise to the fact that all morphological operators occur in pairs, e.g., dilation and erosion, opening and closing, etc. This phenomenon often prohibits the construction of tools that treat foreground and background of signals in exactly the same way. In this paper we discuss an alternative framework for morphological image processing that gives rise to image operators which are intrinsically self-dual. As one might expect, this alternative framework is entirely based upon the definition of a new self-dual partial ordering

    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
    corecore