A new design tool for feature extraction in noisy images based on grayscale hit-or-miss transforms

The Hit-or-Miss transform (HMT) is a well known morphological transform capable of identifying features in digital images. When image features contain noise, texture or some other distortion, the HMT may fail. Various researchers have extended the HMT in different ways to make it more robust to noise. The most successful, and most recent extensions of the HMT for noise robustness, use rank order operators in place of standard morphological erosions and dilations. A major issue with the proposed methods is that no technique is provided for calculating the parameters that are introduced to generalize the HMT, and, in most cases, these parameters are determined empirically. We present here, a new conceptual interpretation of the HMT which uses a percentage occupancy (PO) function to implement the erosion and dilation operators in a single pass of the image. Further, we present a novel design tool, derived from this PO function that can be used to determine the only parameter for our routine and for other generalizations of the HMT proposed in the literature. We demonstrate the power of our technique using a set of very noisy images and draw a comparison between our method and the most recent extensions of the HMT

A fast method for computing the output of rank order filters within arbitrarily shaped windows

Rank order filters are used in a multitude of image processing tasks. Their application can range from simple preprocessing tasks which aim to reduce/remove noise, to more complex problems where such filters can be used to detect and segment image features. There is, therefore, a need to develop fast algorithms to compute the output of this class of filter. A number of methods for efficiently computing the output of specific rank order filters have been proposed [1]. For example, numerous fast algorithms exist that can be used for calculating the output of the median filter. Fast algorithms for calculating morphological erosions and dilations - which are also a special case of the more general rank order filter - have also been proposed. In this paper we present an extension of a recently introduced method for computing fast morphological operators to the more general case of rank order filters. Using our method, we are able to efficiently compute any rank, using any arbitrarily shaped window, such that it is possible to quickly compute the output of any rank order filter. We demonstrate the usefulness and efficiency of our technique by implementing a fast method for computing a recent generalisation of the morphological Hit-or-Miss Transform which makes it more robust in the presence of noise. We also compare the speed and efficiency of this routine with similar techniques that have been proposed in the literature

Curvilinear Structure Enhancement in Biomedical Images

Curvilinear structures can appear in many different areas and at a variety of scales. They can be axons and dendrites in the brain, blood vessels in the fundus, streets, rivers or fractures in buildings, and others. So, it is essential to study curvilinear structures in many fields such as neuroscience, biology, and cartography regarding image processing. Image processing is an important field for the help to aid in biomedical imaging especially the diagnosing the disease. Image enhancement is the early step of image analysis. In this thesis, I focus on the research, development, implementation, and validation of 2D and 3D curvilinear structure enhancement methods, recently established. The proposed methods are based on phase congruency, mathematical morphology, and tensor representation concepts. First, I have introduced a 3D contrast independent phase congruency-based enhancement approach. The obtained results demonstrate the proposed approach is robust against the contrast variations in 3D biomedical images. Second, I have proposed a new mathematical morphology-based approach called the bowler-hat transform. In this approach, I have combined the mathematical morphology with a local tensor representation of curvilinear structures in images. The bowler-hat transform is shown to give better results than comparison methods on challenging data such as retinal/fundus images. The bowler-hat transform is shown to give better results than comparison methods on challenging data such as retinal/fundus images. Especially the proposed method is quite successful while enhancing of curvilinear structures at junctions. Finally, I have extended the bowler-hat approach to the 3D version to prove the applicability, reliability, and ability of it in 3D

Outlier and target detection in aerial hyperspectral imagery : a comparison of traditional and percentage occupancy hit or miss transform techniques

The use of aerial hyperspectral imagery for the purpose of remote sensing is a rapidly growing research area. Currently, targets are generally detected by looking for distinct spectral features of the objects under surveillance. For example, a camouflaged vehicle, deliberately designed to blend into background trees and grass in the visible spectrum, can be revealed using spectral features in the near-infrared spectrum. This work aims to develop improved target detection methods, using a two-stage approach, firstly by development of a physics-based atmospheric correction algorithm to convert radiance into reflectance hyperspectral image data and secondly by use of improved outlier detection techniques. In this paper the use of the Percentage Occupancy Hit or Miss Transform is explored to provide an automated method for target detection in aerial hyperspectral imagery

BEMDEC: An Adaptive and Robust Methodology for Digital Image Feature Extraction

The intriguing study of feature extraction, and edge detection in particular, has, as a result of the increased use of imagery, drawn even more attention not just from the field of computer science but also from a variety of scientific fields. However, various challenges surrounding the formulation of feature extraction operator, particularly of edges, which is capable of satisfying the necessary properties of low probability of error (i.e., failure of marking true edges), accuracy, and consistent response to a single edge, continue to persist. Moreover, it should be pointed out that most of the work in the area of feature extraction has been focused on improving many of the existing approaches rather than devising or adopting new ones. In the image processing subfield, where the needs constantly change, we must equally change the way we think. In this digital world where the use of images, for variety of purposes, continues to increase, researchers, if they are serious about addressing the aforementioned limitations, must be able to think outside the box and step away from the usual in order to overcome these challenges. In this dissertation, we propose an adaptive and robust, yet simple, digital image features detection methodology using bidimensional empirical mode decomposition (BEMD), a sifting process that decomposes a signal into its two-dimensional (2D) bidimensional intrinsic mode functions (BIMFs). The method is further extended to detect corners and curves, and as such, dubbed as BEMDEC, indicating its ability to detect edges, corners and curves. In addition to the application of BEMD, a unique combination of a flexible envelope estimation algorithm, stopping criteria and boundary adjustment made the realization of this multi-feature detector possible. Further application of two morphological operators of binarization and thinning adds to the quality of the operator

Applications of Computer Vision Technologies of Automated Crack Detection and Quantification for the Inspection of Civil Infrastructure Systems

Many components of existing civil infrastructure systems, such as road pavement, bridges, and buildings, are suffered from rapid aging, which require enormous nation\u27s resources from federal and state agencies to inspect and maintain them. Crack is one of important material and structural defects, which must be inspected not only for good maintenance of civil infrastructure with a high quality of safety and serviceability, but also for the opportunity to provide early warning against failure. Conventional human visual inspection is still considered as the primary inspection method. However, it is well established that human visual inspection is subjective and often inaccurate. In order to improve current manual visual inspection for crack detection and evaluation of civil infrastructure, this study explores the application of computer vision techniques as a non-destructive evaluation and testing (NDE&T) method for automated crack detection and quantification for different civil infrastructures. In this study, computer vision-based algorithms were developed and evaluated to deal with different situations of field inspection that inspectors could face with in crack detection and quantification. The depth, the distance between camera and object, is a necessary extrinsic parameter that has to be measured to quantify crack size since other parameters, such as focal length, resolution, and camera sensor size are intrinsic, which are usually known by camera manufacturers. Thus, computer vision techniques were evaluated with different crack inspection applications with constant and variable depths. For the fixed-depth applications, computer vision techniques were applied to two field studies, including 1) automated crack detection and quantification for road pavement using the Laser Road Imaging System (LRIS), and 2) automated crack detection on bridge cables surfaces, using a cable inspection robot. For the various-depth applications, two field studies were conducted, including 3) automated crack recognition and width measurement of concrete bridges\u27 cracks using a high-magnification telescopic lens, and 4) automated crack quantification and depth estimation using wearable glasses with stereovision cameras. From the realistic field applications of computer vision techniques, a novel self-adaptive image-processing algorithm was developed using a series of morphological transformations to connect fragmented crack pixels in digital images. The crack-defragmentation algorithm was evaluated with road pavement images. The results showed that the accuracy of automated crack detection, associated with artificial neural network classifier, was significantly improved by reducing both false positive and false negative. Using up to six crack features, including area, length, orientation, texture, intensity, and wheel-path location, crack detection accuracy was evaluated to find the optimal sets of crack features. Lab and field test results of different inspection applications show that proposed compute vision-based crack detection and quantification algorithms can detect and quantify cracks from different structures\u27 surface and depth. Some guidelines of applying computer vision techniques are also suggested for each crack inspection application

Analytical study of computer vision-based pavement crack quantification using machine learning techniques

Image-based techniques are a promising non-destructive approach for road pavement condition evaluation. The main objective of this study is to extract, quantify and evaluate important surface defects, such as cracks, using an automated computer vision-based system to provide a better understanding of the pavement deterioration process. To achieve this objective, an automated crack-recognition software was developed, employing a series of image processing algorithms of crack extraction, crack grouping, and crack detection. Bottom-hat morphological technique was used to remove the random background of pavement images and extract cracks, selectively based on their shapes, sizes, and intensities using a relatively small number of user-defined parameters. A technical challenge with crack extraction algorithms, including the Bottom-hat transform, is that extracted crack pixels are usually fragmented along crack paths. For de-fragmenting those crack pixels, a novel crack-grouping algorithm is proposed as an image segmentation method, so called MorphLink-C. Statistical validation of this method using flexible pavement images indicated that MorphLink-C not only improves crack-detection accuracy but also reduces crack detection time. Crack characterization was performed by analysing imagerial features of the extracted crack image components. A comprehensive statistical analysis was conducted using filter feature subset selection (FSS) methods, including Fischer score, Gini index, information gain, ReliefF, mRmR, and FCBF to understand the statistical characteristics of cracks in different deterioration stages. Statistical significance of crack features was ranked based on their relevancy and redundancy. The statistical method used in this study can be employed to avoid subjective crack rating based on human visual inspection. Moreover, the statistical information can be used as fundamental data to justify rehabilitation policies in pavement maintenance. Finally, the application of four classification algorithms, including Artificial Neural Network (ANN), Decision Tree (DT), k-Nearest Neighbours (kNN) and Adaptive Neuro-Fuzzy Inference System (ANFIS) is investigated for the crack detection framework. The classifiers were evaluated in the following five criteria: 1) prediction performance, 2) computation time, 3) stability of results for highly imbalanced datasets in which, the number of crack objects are significantly smaller than the number of non-crack objects, 4) stability of the classifiers performance for pavements in different deterioration stages, and 5) interpretability of results and clarity of the procedure. Comparison results indicate the advantages of white-box classification methods for computer vision based pavement evaluation. Although black-box methods, such as ANN provide superior classification performance, white-box methods, such as ANFIS, provide useful information about the logic of classification and the effect of feature values on detection results. Such information can provide further insight for the image-based pavement crack detection application

Introduction to Facial Micro Expressions Analysis Using Color and Depth Images: A Matlab Coding Approach (Second Edition, 2023)

The book attempts to introduce a gentle introduction to the field of Facial Micro Expressions Recognition (FMER) using Color and Depth images, with the aid of MATLAB programming environment. FMER is a subset of image processing and it is a multidisciplinary topic to analysis. So, it requires familiarity with other topics of Artifactual Intelligence (AI) such as machine learning, digital image processing, psychology and more. So, it is a great opportunity to write a book which covers all of these topics for beginner to professional readers in the field of AI and even without having background of AI. Our goal is to provide a standalone introduction in the field of MFER analysis in the form of theorical descriptions for readers with no background in image processing with reproducible Matlab practical examples. Also, we describe any basic definitions for FMER analysis and MATLAB library which is used in the text, that helps final reader to apply the experiments in the real-world applications. We believe that this book is suitable for students, researchers, and professionals alike, who need to develop practical skills, along with a basic understanding of the field. We expect that, after reading this book, the reader feels comfortable with different key stages such as color and depth image processing, color and depth image representation, classification, machine learning, facial micro-expressions recognition, feature extraction and dimensionality reduction. The book attempts to introduce a gentle introduction to the field of Facial Micro Expressions Recognition (FMER) using Color and Depth images, with the aid of MATLAB programming environment.Comment: This is the second edition of the boo

Détection des bâtiments à partir des images multispectrales à très haute résolution spatiale par la transformation Hit-or-Miss

Résumé : La détection des bâtiments dans les images à très haute résolution spatiale (THRS) a plusieurs applications pratiques et représente un domaine de recherche scientifique intensive ces dernières années. Elle fait face à la complexité du milieu urbain et aux spécificités des images provenant des différents capteurs. La performance des méthodes existantes pour l’extraction des bâtiments n’est pas encore suffisante pour qu’elles soient généralisées à grande échelle (différents types de tissus urbains et capteurs). Les opérateurs morphologiques se sont montrés efficaces pour la détection des bâtiments dans les images panchromatiques (images en niveaux de gris) à très haute résolution spectrale (THRS). L’information spectrale issue des images multispectrales est jugée nécessaire pour l’amélioration de leur performance. L’extension des opérateurs morphologiques pour les images multispectrales exige l’adoption d’une stratégie qui permet le traitement des pixels sous forme de vecteurs, dont les composantes sont les valeurs dans les différentes bandes spectrales. Ce travail de recherche vise l’application de la transformation morphologique dite Hit-or-Miss (HMT) à des images multispectrales à THRS, afin de détecter des bâtiments. Pour répondre à la problématique de l’extension des opérateurs morphologiques pour les images multispectrales, nous proposons deux solutions. Comme une première solution nous avons généré des images en niveaux de gris à partir les bandes multispectrales. Dans ces nouvelles images les bâtiments potentiels sont rehaussés par rapport à l’arrière-plan. La HMT en niveaux de gris est alors appliquée à ces images afin de détecter les bâtiments. Pour rehausser les bâtiments nous avons proposé un nouvel indice, que nous avons appelé Spectral Similarity Ratio (SSR). Pour éviter de définir des configurations, des ensembles d’éléments structurants (ES), nécessaires pour l’application de la HMT, au préalable, nous avons utilisé l’érosion et la dilatation floues et poursuivi la réponse des pixels aux différentes valeurs des ES. La méthode est testée sur des extraits d’images représentant des quartiers de type résidentiel. Le taux moyen de reconnaissance obtenu pour les deux capteurs Ikonos et GeoEye est de 85 % et de 80 %, respectivement. Le taux moyen de bonne identification, quant à lui, est de 85 % et 84 % pour les images Ikonos et GeoEye, respectivement. Après certaines améliorations, la méthode a été appliquée sur des larges scènes Ikonos et WorldView-2, couvrant différents tissus urbains. Le taux moyen des bâtiments reconnus est de 82 %. Pour sa part, le taux de bonne identification est de 81 %. Dans la deuxième solution, nous adoptons une stratégie vectorielle pour appliquer la HMT directement sur les images multispectrales. La taille des ES de cette transformation morphologique est définie en utilisant la transformation dite chapeau haut-de-forme par reconstruction. Une étape de post-traitement inclut le filtrage de la végétation par l’indice de la végétation NDVI et la validation de la localisation des bâtiments par l’information d’ombre. La méthode est appliquée sur un espace urbain de type résidentiel. Des extraits d’images provenant des capteurs satellitaires Ikonos, GeoEye et WorldView 2 ont été traités. Le taux des bâtiments reconnus est relativement élevé pour tous les extraits - entre 85 % et 97 %. Le taux de bonne identification démontre des résultats entre 74 % et 88 %. Les résultats obtenus nous permettent de conclure que les objectifs de ce travail de recherche, à savoir, la proposition d’une technique pour l’estimation de la similarité spectrale entre les pixels formant le toit d’un bâtiment, l’intégration de l’information multispectrale dans la HMT dans le but de détecter les bâtiments, et la proposition d’une technique qui permet la définition semi-automatique des configurations bâtiment/voisinage dans les images multispectrales, ont été atteints. // Abstract : Detection of buildings in very high spatial resolution images (THRS) has various practical applications and is recently a subject of intensive scientific research. It faces the complexity of the urban environment and the variety of image characteristics depending on the type of the sensor. The performance of existing building extraction methods is not yet sufficient to be generalized to a large scale (different urban patterns and sensors). Morphological operators have been proven effective for the detection of buildings in panchromatic (greyscale) very high spectral resolution (VHSR) images. The spectral information of multispectral images is jugged efficient to improve the results of the detection. The extension of morphological operators to multispectral images is not straightforward. As pixels of multispectral images are pixels vectors the components of which are the intensity values in the different bands, a strategy to order vectors must be adopted. This research thesis focuses on the application of the morphological transformation called Hit-or-Miss (HMT) on multispectral VHSR images in order to detect buildings. To address the issue of the extension of morphological operators to multispectral images we have proposed two solutions. The first one employs generation of greyscale images from multispectral bands, where potential buildings are enhanced. The grayscale HMT is then applied to these images in order to detect buildings. To enhance potential building locations we have proposed the use of Spectral Similarity Ratio (SSR). To avoid the need to set multiple configurations of structuring elements (SE) necessary for the implementation of the HMT, we have used fuzzy erosion and fuzzy dilation and examined the pixel response to different values of SE. The method has been tested on image subsets taken over residential areas. The average rate of recognition for the two sensors, Ikonos and GeoEye, is 85% and 80%, respectively. The average rate of correct identification is 85% and 84%, for Ikonos and GeoEye subsets, respectively. Having made some improvements, we then applied the method to large scenes from Ikonos and WorldView-2 images covering different urban patterns. The average rate of recognized buildings is 82%. The rate of correct identification is 81%. As a second solution, we have proposed a new vector based strategy which allows the multispectral information to be integrated into the percent occupancy HMT (POHMT). Thus, the POHMT has been directly applied on multispectral images. The parameters for the POHMT have been defined using the morphological transformation dubbed top hat by reconstruction. A post-processing step included filtering the vegetation and validating building locations by proximity to shadow. The method has been applied to urban residential areas. Image subsets from Ikonos, GeoEye and WorldView2 have been processed. The rate of recognized buildings is relatively high for all subsets - between 85% and 97%. The rate of correct identification is between 74 % and 88 %. The results allow us to conclude that the objectives of this research, namely, suggesting a technique for estimating the spectral similarity between the pixels forming the roof of a building, the integration of multispectral information in the HMT in order to detect buildings and the proposition of a semiautomatic technique for the definition of the configurations building/neighbourhood in multispectral images, have been achieved

Recognition of Electrical & Electronics Components

Recognition or more specifically Pattern or Object recognition is a typical characteristic of human beings and other living organisms. The term pattern or object means something that is set as an idea to be imitated. For example, in our childhood a shape ‘A’ is shown to us and we are asked to imitate that. So the shape is the ideal one. On the other hand, if what we produce or draw obeying that instruction is close to that shape, our teacher identifies that as ’A’. this identification is called recognition and the shapes we draw (that is object we made) may be termed as patterns. Thus, the pattern recognition means identification of the real object. Recognition should, therefore, be preceded by the development of the concept of the ideal or model or prototype. This process is called Learning. In most real life problems no ideal example is available. In that case, the concept of ideal is abstracted from many near perfect examples. Under this notion learning is of two types : supervised learning if appropriate label is attached to each of these examples ; and unsupervised learning if no labeling is available