113,352 research outputs found

    SPATIAL ARCHAEOLOGY USING IMAGE ANALYSIS AND MATHEMATICAL MORPHOLOGY

    Get PDF
    For the last ten years, geographers, archaeologists and historians work together around the analysis of space transformation processes at various time scales, in particular long-term ones. However, the approaches which were developed until then to study the arrangement of archaeological remains and the links they share with their environment, are on one hand most related to statistical and counting methods, and on the other hand often take into account only their functional or symbolical dimension, overshadowing their purely physical aspect. Image analysis by Mathematical Morphology permits to overtake this limit. Two applications of this method are proposed: the first consists in detecting spatial configurations in the arrangement of funerary structures in a Bronze Age necropolis of central Mongolia, in order to point out some particular organisations. The purpose of the second study is to set up an image processing protocol applied to urban maps from different dates, permitting to detect the various architectonic orientations.Archéologie spatiale par analyse d'image et morphologie mathématique Depuis une dizaine d'années, géographes, archéologues et historiens collaborent autour de l'analyse des processus de transformation de l'espace à différentes échelles de temps, et notamment dans la longue durée. Il s'agit ainsi de comprendre la répartition des objets archéologiques dans l'espace et les processus qui leur ont donné naissance, tout en replaçant ceux-ci dans leur contexte géographique et historique, à plusieurs échelles spatiales et temporelles. Ces dernières années, les travaux réalisés en " archéologie spatiale " ont ainsi considérablement dépassé la démarche purement statistique qui caractérisait les débuts de cette discipline, et ont replacé la dimension spatiale au cœur de la réflexion. Cependant, les démarches mises au point jusqu'ici pour étudier la distribution des vestiges, et des liens que ceux-ci entretiennent avec leur environnement, s'attachent essentiellement à leur dimension fonctionnelle ou symbolique, en occultant leur aspect purement physique: les objets sont immédiatement conceptualisés, catégorisés. Si la forme, la nature des objets, leur distribution, et leur contexte géographique et archéologique sont indéniablement liés, ces caractéristiques ne sont prises en compte qu'assez artificiellement et non simultanément dans les travaux. Or, l'analyse d'image par la morphologie mathématique permet de dépasser ces limites. Par les applications présentées dans cet article nous souhaitons démontrer les potentialités de cette technique pour la rétrospective spatiale en général et l'archéologie en particulier

    Efficient Morphological Analysis Using Arbitrary Structuring Elements for Security Purposes

    Get PDF
    The term Mathematical Morphology (MM) mostly deals with the mathematical theory of describing shapes using sets. In morphology, images are represented as sets. This task is investigated by the interaction between an image and a certain chosen arbitrary structuring element using the basic operations of erosion and dilation. The various applications of morphologyinclude skeletonization, prunning, optical character recognition,image analysis,artifacts removal,boundary extraction, etc. It is further extended by the fact that mathematical morphology provides better quality image data for analysis and diagnostic purposes. The process is very efficient due to the use of MATLAB algorithmswhich are helpful for securing meaningful information against different threats like-speckle noise, salt and pepper noise,etc

    Image morphological processing

    Get PDF
    Mathematical Morphology with applications in image processing and analysis has been becoming increasingly important in today\u27s technology. Mathematical Morphological operations, which are based on set theory, can extract object features by suitably shaped structuring elements. Mathematical Morphological filters are combinations of morphological operations that transform an image into a quantitative description of its geometrical structure based on structuring elements. Important applications of morphological operations are shape description, shape recognition, nonlinear filtering, industrial parts inspection, and medical image processing. In this dissertation, basic morphological operations, properties and fuzzy morphology are reviewed. Existing techniques for solving corner and edge detection are presented. A new approach to solve corner detection using regulated mathematical morphology is presented and is shown that it is more efficient in binary images than the existing mathematical morphology based asymmetric closing for corner detection. A new class of morphological operations called sweep mathematical morphological operations is developed. The theoretical framework for representation, computation and analysis of sweep morphology is presented. The basic sweep morphological operations, sweep dilation and sweep erosion, are defined and their properties are studied. It is shown that considering only the boundaries and performing operations on the boundaries can substantially reduce the computation. Various applications of this new class of morphological operations are discussed, including the blending of swept surfaces with deformations, image enhancement, edge linking and shortest path planning for rotating objects. Sweep mathematical morphology is an efficient tool for geometric modeling and representation. The sweep dilation/erosion provides a natural representation of sweep motion in the manufacturing processes. A set of grammatical rules that govern the generation of objects belonging to the same group are defined. Earley\u27s parser serves in the screening process to determine whether a pattern is a part of the language. Finally, summary and future research of this dissertation are provided

    Characterization of nanostructured material images using fractal descriptors

    Get PDF
    This work presents a methodology to the morphology analysis and characterization of nanostructured material images acquired from FEG-SEM (Field Emission Gun-Scanning Electron Microscopy) technique. The metrics were extracted from the image texture (mathematical surface) by the volumetric fractal descriptors, a methodology based on the Bouligand-Minkowski fractal dimension, which considers the properties of the Minkowski dilation of the surface points. An experiment with galvanostatic anodic titanium oxide samples prepared in oxalyc acid solution using different conditions of applied current, oxalyc acid concentration and solution temperature was performed. The results demonstrate that the approach is capable of characterizing complex morphology characteristics such as those present in the anodic titanium oxide.Comment: 8 pages, 5 figures, accepted for publication Physica

    Automatic classification of skin lesions using color mathematical morphology-based texture descriptors

    Get PDF
    SPIE : Society of Photo-Optical Instrumentation EngineersInternational audienceIn this paper an automatic classification method of skin lesions from dermoscopic images is proposed. This method is based on color texture analysis based both on color mathematical morphology and Kohonen Self-Organizing Maps (SOM), and it does not need any previous segmentation process. More concretely, mathematical morphology is used to compute a local descriptor for each pixel of the image, while the SOM is used to cluster them and, thus, create the texture descriptor of the global image. Two approaches are proposed, depending on whether the pixel descriptor is computed using classical (i.e. spatially invariant) or adaptive (i.e. spatially variant) mathematical morphology by means of the Color Adaptive Neighborhoods (CANs) framework. Both approaches obtained similar areas under the ROC curve (AUC): 0.854 and 0.859 outperforming the AUC built upon dermatologists' predictions (0.792)

    Higher Dimensional Image Analysis using Brunn-Minkowski Theorem, Convexity and Mathematical Morphology

    Get PDF
    The theory of deterministic morphological operators is quite rich and has been used on set and lattice theory. Mathematical Morphology can benefit from the already developed theory in convex analysis. Mathematical Morphology introduced by Serra is a very important tool in image processing and Pattern recognition. The framework of Mathematical Morphology consists in Erosions and Dilations. Fractals are mathematical sets with a high degree of geometrical complexity that can model many natural phenomena. Examples include physical objects such as clouds, mountains, trees and coastlines as well as image intensity signals that emanate from certain type of fractal surfaces. So this article tries to link the relation between combinatorial convexity and Mathematical Morphology. Keywords: Convex bodies, convex polyhedra, homothetics, morphological cover, fractal, dilation, erosion

    Fuzzy techniques for noise removal in image sequences and interval-valued fuzzy mathematical morphology

    Get PDF
    Image sequences play an important role in today's world. They provide us a lot of information. Videos are for example used for traffic observations, surveillance systems, autonomous navigation and so on. Due to bad acquisition, transmission or recording, the sequences are however usually corrupted by noise, which hampers the functioning of many image processing techniques. A preprocessing module to filter the images often becomes necessary. After an introduction to fuzzy set theory and image processing, in the first main part of the thesis, several fuzzy logic based video filters are proposed: one filter for grayscale video sequences corrupted by additive Gaussian noise and two color extensions of it and two grayscale filters and one color filter for sequences affected by the random valued impulse noise type. In the second main part of the thesis, interval-valued fuzzy mathematical morphology is studied. Mathematical morphology is a theory intended for the analysis of spatial structures that has found application in e.g. edge detection, object recognition, pattern recognition, image segmentation, image magnification… In the thesis, an overview is given of the evolution from binary mathematical morphology over the different grayscale morphology theories to interval-valued fuzzy mathematical morphology and the interval-valued image model. Additionally, the basic properties of the interval-valued fuzzy morphological operators are investigated. Next, also the decomposition of the interval-valued fuzzy morphological operators is investigated. We investigate the relationship between the cut of the result of such operator applied on an interval-valued image and structuring element and the result of the corresponding binary operator applied on the cut of the image and structuring element. These results are first of all interesting because they provide a link between interval-valued fuzzy mathematical morphology and binary mathematical morphology, but such conversion into binary operators also reduces the computation. Finally, also the reverse problem is tackled, i.e., the construction of interval-valued morphological operators from the binary ones. Using the results from a more general study in which the construction of an interval-valued fuzzy set from a nested family of crisp sets is constructed, increasing binary operators (e.g. the binary dilation) are extended to interval-valued fuzzy operators

    A METHODOLOGY TO SEGMENT X-RAY TOMOGRAPHIC IMAGES OF MULTIPHASE POROUS MEDIA: APPLICATION TO BUILDING STONES.

    Get PDF
    An image analysis technique based on mathematical morphology tools dedicated to the segmentation of X-ray tomographic images of porous media is presented in this article. It consists in an efficient denoising using alternate sequential filters and a watershed operation using an original starting marker. The image is transformed into a mosaic that is straightforward to segment. An application to building stones of heritage monuments illustrates the potentialities of this technique

    Modeling of evolving textures using granulometries

    Get PDF
    This chapter describes a statistical approach to classification of dynamic texture images, called parallel evolution functions (PEFs). Traditional classification methods predict texture class membership using comparisons with a finite set of predefined texture classes and identify the closest class. However, where texture images arise from a dynamic texture evolving over time, estimation of a time state in a continuous evolutionary process is required instead. The PEF approach does this using regression modeling techniques to predict time state. It is a flexible approach which may be based on any suitable image features. Many textures are well suited to a morphological analysis and the PEF approach uses image texture features derived from a granulometric analysis of the image. The method is illustrated using both simulated images of Boolean processes and real images of corrosion. The PEF approach has particular advantages for training sets containing limited numbers of observations, which is the case in many real world industrial inspection scenarios and for which other methods can fail or perform badly. [41] G.W. Horgan, Mathematical morphology for analysing soil structure from images, European Journal of Soil Science, vol. 49, pp. 161–173, 1998. [42] G.W. Horgan, C.A. Reid and C.A. Glasbey, Biological image processing and enhancement, Image Processing and Analysis, A Practical Approach, R. Baldock and J. Graham, eds., Oxford University Press, Oxford, UK, pp. 37–67, 2000. [43] B.B. Hubbard, The World According to Wavelets: The Story of a Mathematical Technique in the Making, A.K. Peters Ltd., Wellesley, MA, 1995. [44] H. Iversen and T. Lonnestad. An evaluation of stochastic models for analysis and synthesis of gray-scale texture, Pattern Recognition Letters, vol. 15, pp. 575–585, 1994. [45] A.K. Jain and F. Farrokhnia, Unsupervised texture segmentation using Gabor filters, Pattern Recognition, vol. 24(12), pp. 1167–1186, 1991. [46] T. Jossang and F. Feder, The fractal characterization of rough surfaces, Physica Scripta, vol. T44, pp. 9–14, 1992. [47] A.K. Katsaggelos and T. Chun-Jen, Iterative image restoration, Handbook of Image and Video Processing, A. Bovik, ed., Academic Press, London, pp. 208–209, 2000. [48] M. K¨oppen, C.H. Nowack and G. R¨osel, Pareto-morphology for color image processing, Proceedings of SCIA99, 11th Scandinavian Conference on Image Analysis 1, Kangerlussuaq, Greenland, pp. 195–202, 1999. [49] S. Krishnamachari and R. Chellappa, Multiresolution Gauss-Markov random field models for texture segmentation, IEEE Transactions on Image Processing, vol. 6(2), pp. 251–267, 1997. [50] T. Kurita and N. Otsu, Texture classification by higher order local autocorrelation features, Proceedings of ACCV93, Asian Conference on Computer Vision, Osaka, pp. 175–178, 1993. [51] S.T. Kyvelidis, L. Lykouropoulos and N. Kouloumbi, Digital system for detecting, classifying, and fast retrieving corrosion generated defects, Journal of Coatings Technology, vol. 73(915), pp. 67–73, 2001. [52] Y. Liu, T. Zhao and J. Zhang, Learning multispectral texture features for cervical cancer detection, Proceedings of 2002 IEEE International Symposium on Biomedical Imaging: Macro to Nano, pp. 169–172, 2002. [53] G. McGunnigle and M.J. Chantler, Modeling deposition of surface texture, Electronics Letters, vol. 37(12), pp. 749–750, 2001. [54] J. McKenzie, S. Marshall, A.J. Gray and E.R. Dougherty, Morphological texture analysis using the texture evolution function, International Journal of Pattern Recognition and Artificial Intelligence, vol. 17(2), pp. 167–185, 2003. [55] J. McKenzie, Classification of dynamically evolving textures using evolution functions, Ph.D. Thesis, University of Strathclyde, UK, 2004. [56] S.G. Mallat, Multiresolution approximations and wavelet orthonormal bases of L2(R), Transactions of the American Mathematical Society, vol. 315, pp. 69–87, 1989. [57] S.G. Mallat, A theory for multiresolution signal decomposition: the wavelet representation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, pp. 674–693, 1989. [58] B.S. Manjunath and W.Y. Ma, Texture features for browsing and retrieval of image data, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, pp. 837–842, 1996. [59] B.S. Manjunath, G.M. Haley and W.Y. Ma, Multiband techniques for texture classification and segmentation, Handbook of Image and Video Processing, A. Bovik, ed., Academic Press, London, pp. 367–381, 2000. [60] G. Matheron, Random Sets and Integral Geometry, Wiley Series in Probability and Mathematical Statistics, John Wiley and Sons, New York, 1975

    An improved microarray image analysis architecture using mathematical morphology

    Get PDF
    DNA microarrays are now widely used to measure gene expression levels of healthy and cancerous cells. To allow further experiment for drug development to treat cancer, colour intensity from images of microarray spots need to be extracted as accurate as possible. The intensity extraction requires pre-requisite analysis stages including noise removal, and followed by location gridding. However, it remains as a challenging task for microarray analysis due to the variation of noise that infested the images. In this study, microarray analysis architecture using mathematical morphology was proposed, namely Mathematical Morphology Microarray Image Analysis (MaMIA).Firstly, in denoising stage, noise identification is conducted to identify and reverse the noise. Next, combinations of mathematical morphology were applied to the microarray and its pixel derivatives during the gridding stage. Raw microarrays used by MaMIA are available at Stanford Microarray Database (SMD), Gene Expression Omnibus (GEO) and from a dilution experiment (DILN). From comparisons with previous existing architectures, Optimal Multilevel Thresholding (OMTG) and Automated Robust MicroArray Data Analysis (ARMADA), MaMIA have proven to efficiently remove noise with highest value, 81.6657dB for Peak Signal to Noise Ratio (PSNR) and success identification of spots in cases of noises; with highest gridding accuracy level of 98.34%.Overall processing time, MaMIA architecture can perform gridding in less than 22 seconds, fastest as compared to its contender. This research have revealed the potential of analysing microarray by mainly using mathematical morphology operation, either applied on microarray or its pixel derivative
    corecore